Journal ArticleDOI
Metaheuristics for vehicle routing problems with three-dimensional loading constraints
TLDR
This paper addresses an important combination of three-dimensional loading and vehicle routing, known as the Three-Dimensional Loading Capacitated Vehicle Routing Problem, by means of an Ant Colony Optimization algorithm that makes use of fast packing heuristics for the loading.About:
This article is published in European Journal of Operational Research.The article was published on 2010-03-16. It has received 169 citations till now. The article focuses on the topics: Static routing & Vehicle routing problem.read more
Citations
More filters
Journal ArticleDOI
Survey of Green Vehicle Routing Problem: Past and future trends
TL;DR: The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with G VRP and offer an insight into the next wave of research into GVRp.
Journal ArticleDOI
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
TL;DR: This article takes a closer look at the concepts of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with different attributes, and leads to the identification of “winning strategies” in designing effective heuristics forMAVRP.
Journal ArticleDOI
Constraints in container loading – A state-of-the-art review
TL;DR: This work states that container loading problems have been dealt with frequently in the operations research literature and that the proposed approaches are of limited practical value since they do not pay enough attention to constraints encountered in practice.
Journal ArticleDOI
Rich vehicle routing problems: From a taxonomy to a definition
TL;DR: The purpose of the paper is to provide a comprehensive and relevant taxonomy for the RVRP literature and to propose an elaborate definition of RVRPs.
Journal ArticleDOI
Routing problems with loading constraints
Manuel Iori,Silvano Martello +1 more
TL;DR: In this article, the authors consider combinatorial optimization problems arising in transportation logistics when one is interested in optimizing both the routing of vehicles and the loading of goods into them, and present a systematic view of this field.
References
More filters
Journal ArticleDOI
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
MonographDOI
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
Book
Local Search in Combinatorial Optimization
TL;DR: Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time.
A tabu search heuristic for the vehicle routing problem
TL;DR: Taburoute as mentioned in this paper is a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions, which considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route.
Journal ArticleDOI
A tabu search heuristic for the vehicle routing problem
TL;DR: Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.