'Slowly becoming sales promotion men?': Negotiating the career of the sales representative in Britain, 1920s–1970s

The commercial traveler, or traveling salesman, was an agent of commercialism and modernization as well as a stock character in British popular culture. To C. Wright Mills, salesmen faced particularly challenging demands to conform to managerial direction. This article examines how British salesmen negotiated their occupational identity during the twentieth century. Developments in marketing, corporate growth, and periods of war and recession all challenged salesmen’s status and autonomy. These influences prompted a lengthy and recurring debate about how best to present, defend, and justify their work and identity. New marketing techniques and management systems evolved steadily, rather than producing sudden or uniform changes in the ways in which salesmen worked. Their culture of enterprise and individualism persisted, in part as it was shared by employers and managers. The impact of new marketing methods proved greatest in confectionery, tobacco, and other consumer goods trades as sales of branded, packaged goods expanded. Even then, salesmen contributed to shaping their work and occupational identity, proving unable to establish professional credentials and dividing over whether adopting trade union methods could improve their position

Design and Control of Warehouse Order Picking: a literature review

Order picking has long been identified as the most labour-intensive and costly activity for almost every warehouse; the cost of order picking is estimated to be as much as 55% of the total warehouse operating expense. Any underperformance in order picking can lead to unsatisfactory service and high operational cost for its warehouse, and consequently for the whole supply chain. In order to operate efficiently, the orderpicking process needs to be robustly designed and optimally controlled. This paper gives a literature overview on typical decision problems in design and control of manual order-picking processes. We focus on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning. The research in this area has grown rapidly recently. Still, combinations of the above areas have hardly been explored. Order-picking system developments in practice lead to promising new research directions.Order picking;Logistics;Warehouse Management

Deconstructing the Big Valley Search Space Hypothesis

The big valley hypothesis suggests that, in combinatorial optimisation, local optima of good quality are clustered and surround the global optimum. We show here that the idea of a single valley does not always hold. Instead the big valley seems to de-construct into several valleys, also called ‘funnels’ in theoretical chemistry. We use the local optima networks model and propose an effective procedure for extracting the network data. We conduct a detailed study on four selected TSP instances of moderate size and observe that the big valley decomposes into a number of sub-valleys of different sizes and fitness distributions. Sometimes the global optimum is located in the largest valley, which suggests an easy to search landscape, but this is not generally the case. The global optimum might be located in a small valley, which offers a clear and visual explanation of the increased search difficulty in these cases. Our study opens up new possibilities for analysing and visualising combinatorial landscapes as complex networks

Improving exploration in Ant Colony Optimisation with antennation

Ant Colony Optimisation (ACO) algorithms use two heuristics to solve computational problems: one long-term (pheromone) and the other short-term (local heuristic). This paper details the development of antennation, a mid-term heuristic based on an analogous process in real ants. This is incorporated into ACO for the Travelling Salesman Problem (TSP). Antennation involves sharing information of the previous paths taken by ants, including information gained from previous meetings. Antennation was added to the Ant System (AS), Ant Colony System (ACS) and Ant Multi-Tour System (AMTS) algorithms. Tests were conducted on symmetric TSPs of varying size. Antennation provides an advantage when incorporated into algorithms without an inbuilt exploration mechanism and a disadvantage to those that do. AS and AMTS with antennation have superior performance when compared to their canonical form, with the effect increasing as problem size increases.IEEE Computational Intelligence Societ

The behaviour of ACS-TSP algorithm when adapting both pheromone parameters using fuzzy logic controller

In this paper, an evolved ant colony system (ACS) is proposed by dynamically adapting the responsible parameters for the decay of the pheromone trails and using fuzzy logic controller (FLC) applied in the travelling salesman problems (TSP). The purpose of the proposed method is to understand the effect of both parameters and on the performance of the ACS at the level of solution quality and convergence speed towards the best solutions through studying the behavior of the ACS algorithm during this adaptation. The adaptive ACS is compared with the standard one. Computational results show that the adaptive ACS with dynamic adaptation of local pheromone parameter is more effective compared to the standard ACS

The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration

We use the Local Optima Network model to study the structure of symmetric TSP fitness landscapes. The `big-valley' hypothesis holds that for TSP and other combinatorial problems, local optima are not randomly distributed, instead they tend to be clustered around the global optimum. However, a recent study has observed that, for solutions close in evaluation to the global optimum, this structure breaks down into multiple valleys, forming what has been called `multiple funnels'. The multiple funnel concept implies that local optima are organised into clusters, so that a particular local optimum largely belongs to a particular funnel. Our study is the first to extract and visualise local optima networks for TSP and is based on a sampling methodology relying on the Chained Lin-Kernighan algorithm. We confirm the existence of multiple funnels on two selected TSP instances, finding additional funnels in a previously studied instance. Our results suggests that transitions among funnels are possible using operators such as `double-bridge'. However, for consistently escaping sub-optimal funnels, more robust escaping mechanisms are required