Metaheuristic approaches to order sequencing on a unidirectional picking line

de Villiers, A. P.; Matthews, J.; Visagie, S. E.
January 2013
Orion;2013, Vol. 29 Issue 1, p55
Academic Journal
In this paper the sequencing of orders on a unidirectional picking line is considered. The aim of the order sequencing is to minimise the number of cycles travelled by a picker within the picking line to complete all orders. A tabu search, simulated annealing, genetic algorithm, generalised extremal optimisation and a random local search are presented as possible solution approaches. Computational results based on real life data instances are presented for these metaheuristics and compared to the performance of a lower bound and the solutions used in practise. The random local search exhibits the best overall solution quality, however, the generalised extremal optimisation approach delivers comparable results in considerably shorter computational times.


Related Articles

  • Efficient and Robust Parameter Tuning for Heuristic Algorithms. Akbaripour, H.; Masehian, E. // International Journal of Industrial Engineering & Production Res;Jun2013, Vol. 24 Issue 2, p143 

    The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are...

  • Statistical optimum estimation techniques for combinatorial optimization problems: a review and critique. Giddings, Angela; Rardin, Ronald; Uzsoy, Reha // Journal of Heuristics;Jun2014, Vol. 20 Issue 3, p329 

    Over the last several decades researchers have addressed the use of statistical techniques to estimate the optimal values of difficult optimization problems. These efforts have been developed in different communities with a wide range of different applications in mind. In this paper we review...

  • Harmony search-based test data generation for branch coverage in software structural testing. Mao, Chengying // Neural Computing & Applications;Jul2014, Vol. 25 Issue 1, p199 

    Test data generation is always a key task in the field of software testing. In recent years, meta-heuristic search techniques have been considered as an effective way to assist test data generation in software structural testing. In this way, some representative test cases with high-coverage...

  • Dealing with hardware heterogeneity: a new parallel search model. Domínguez, Julián; Alba, Enrique // Natural Computing;Jun2013, Vol. 12 Issue 2, p179 

    In this article we present Ethane, a parallel heterogeneous metaheuristic model specifically designed for its execution on heterogeneous hardware environments. With Ethane we propose a hybrid parallel search algorithm inspired in the structure of the chemical compound of the same name,...

  • EVOLUTIONARY ALGORITHM BASED ON SIMULATED ANNEALING FOR THE MULTI-OBJECTIVE OPTIMIZATION OF COMBINATORIAL PROBLEMS. Ruiz, Elias D. Nino; Nieto Parra, Henry; Chinchilla Camargo, Anangelica Isabel // International Journal of Combinatorial Optimization Problems & I;May-Aug2013, Vol. 4 Issue 2, p53 

    This paper states a novel hybrid-metaheuristic based on the Theory of Deterministic Swapping, Theory of Evolution and Simulated Annealing Meta-heuristic for the multi-objective optimization of combinatorial problems. The proposed algorithm is named EMSA. It is an improvement of MODS algorithm....

  • A multi-objective facility location model with batch arrivals: two parameter-tuned meta-heuristic algorithms. Pasandideh, Seyed; Niaki, Seyed; Hajipour, Vahid // Journal of Intelligent Manufacturing;Apr2013, Vol. 24 Issue 2, p331 

    Many research works in mathematical modeling of the facility location problem have been carried out in discrete and continuous optimization area to obtain the optimum number of required facilities along with the relevant allocation processes. This paper proposes a new multi-objective...

  • PARMODS: A Parallel Framework for MODS Metaheuristics. Ruiz, Elias D. D. Nino; Miranda, Stella; Ardila, Carlos J.; Nieto, Wilson // International Journal of Computers, Communications & Control;Dec2014, Vol. 9 Issue 6, p741 

    In this paper, we propose a novel framework for the parallel solution of combinatorial problems based on MODS theory (PARMODS) This framework makes use of metaheuristics based on the Deterministic Swapping (MODS) theory. These approaches represents the feasible solution space of any...

  • An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. Rabiee, M.; Sadeghi Rad, Reza; Mazinani, M.; Shafaei, R. // International Journal of Advanced Manufacturing Technology;Mar2014, Vol. 71 Issue 5-8, p1229 

    This paper addresses the problem of no-wait two-stage flexible flow shop scheduling problem (NWTSFFSSP) considering unrelated parallel machines, sequence-dependent setup times, probable reworks and different ready times to actualize the problem. The performance measure used in this study is...

  • Metaheuristic Channel Assignment in DVB-T Networks in Conformity with Digital Dividend Requirements. Velivasaki, Terpsichori-Helen; Kakarakis, Sarantis-Dimitrios; Kapsalis, Nicolas; Capsalis, Christos // Wireless Personal Communications;May2013, Vol. 70 Issue 2, p709 

    The problem of acquiring harmonized digital dividend in the upper part of the UHF band is considered through modifying the existing DVB-T frequency plans, as derived from the Geneva Agreement in 2006 (GE06). A novel scheme is proposed to modify GE06 plans by providing the requirements in...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics