Journal ArticleDOI
Using a TSP heuristic for routing order pickers in warehouses
TLDR
This paper deals with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle warehouse systems, and investigates whether the sophistication of 'state-of-the-art' local search heuristics is necessary for routing order picker in warehouses, or whether a subset of features suffices to generate high-quality solutions.About:
This article is published in European Journal of Operational Research.The article was published on 2010-02-01. It has received 181 citations till now. The article focuses on the topics: Heuristics & Travelling salesman problem.read more
Citations
More filters
Journal ArticleDOI
Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review
TL;DR: A state-of-the-art review and classification of the scientific literature investigating combinations of tactical and operational order picking planning problems in picker-to-parts systems is presented with the aim of determining how planning problems are related.
Journal ArticleDOI
Toward a relevant agenda for warehousing research: literature review and practitioners’ input
TL;DR: The suggested future research agenda highlights the importance of supportive aspects of the warehousing business, employment of real data in analysis and empirical research methods, and the expected trends of business environment such as more volatile demand, higher desire for customized services and more expansion of e-commerce.
Journal ArticleDOI
Order picking with multiple pickers and due dates – Simultaneous solution of Order Batching, Batch Assignment and Sequencing, and Picker Routing Problems
TL;DR: A mathematical model of the problem is introduced that allows for solving small problem instances in reasonable computing times and a variable neighborhood descent (VND) algorithm is presented which includes various neighborhood structures regarding the batching and sequencing problem.
Journal ArticleDOI
Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms
TL;DR: Novel tabu search algorithms integrated with a novel clustering algorithm are proposed to solve the order batching and picker routing problems jointly for multiple-cross-aisle warehouse systems and come out to be the most efficient methods in terms of solution quality and computational efficiency.
Journal ArticleDOI
A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
TL;DR: A joint order-batching and picker routing method is introduced to solve this combined precedence-constrained routing and order- batching problem and compares well to other heuristics from literature.
References
More filters
Journal ArticleDOI
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
TL;DR: A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers, which provides a super astronomical period of 2 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words.
Journal ArticleDOI
Design and control of warehouse order picking: A literature review
TL;DR: In this paper, a literature overview on typical decision problems in design and control of manual order-picking processes is given, focusing on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning.
Journal ArticleDOI
An effective implementation of the Lin–Kernighan traveling salesman heuristic
TL;DR: An implementation of the Lin–Kernighan heuristic, one of the most successful methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem (TSP), is described.
Journal ArticleDOI
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Olli Bräysy,Michel Gendreau +1 more
TL;DR: How heuristic methods should be evaluated and proposed using the concept of Pareto optimality in the comparison of different heuristic approaches are discussed.
BookDOI
The vehicle routing problem : latest advances and new challenges
TL;DR: In this article, the authors present a survey of the state-of-the-art approaches for solving the Capacitated Vehicle Routing Problem on trees and using a genetic algorithm to solve the generalized orienteering problem.