Journal ArticleDOI
New exact method for large asymmetric distance-constrained vehicle routing problem
Reads0
Chats0
TLDR
An old branch-and-bound method for solving the asymmetric distance–constrained vehicle routing problem suggested by Laporte et al. in 1987 is revised and modified and capable of solving the largest instances ever solved in the literature.About:
This article is published in European Journal of Operational Research.The article was published on 2013-05-01. It has received 62 citations till now. The article focuses on the topics: 2-opt & Vehicle routing problem.read more
Citations
More filters
Journal ArticleDOI
The vehicle routing problem
TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.
An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report
TL;DR: The implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver, which is able to solve a variety of well-known problems, including the sequential ordering problem, the traveling repairman problem, variants of the multiple travel-ing salesman problem, as well as vehicle routing problems with capacity, time windows, pickup-and-delivery and distance constraints.
Operations Research Letters
Jan Karel Lenstra,Gerhard J. Woeginger,F Spieksma,P Marcotte,S Kou,N Megiddo,B Shepherd,S Seshadri,R Schultz,T de Kok,C Helmberg,A Martin,S van de Velde,S Andradottir,S C Borst,T Takine,George L. Nemhauser,K Aardal,D Klatte +18 more
TL;DR: Operations Research Letters is a publication for literature on all aspects of operations research and the management and decision sciences that focuses on new models, theorems, algorithms, and experimental work that the author wants to disseminate rapidly.
Journal ArticleDOI
Novel Ant Colony Optimization Methods for Simplifying Solution Construction in Vehicle Routing Problems
TL;DR: A novel ACO algorithm (called AMR) to solve the vehicle routing problem (VRP) that allows ants to go in and out the depots more than once until they have visited all customers, which simplifies the procedure of constructing feasible solutions.
Journal ArticleDOI
Electric vehicle-routing problem with charging demands and energy consumption
TL;DR: An electric vehicle-routing problem (EVRP) is developed to settle some operation distribution troubles such as battery energy limitations and difficulties in finding charging stations for electric vehicles (EVs), and the model is solved based on the hybrid genetic algorithm to get the routes and charging plan.
References
More filters
Journal ArticleDOI
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Book
Integer and Combinatorial Optimization
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
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.
The Hungarian Method for the Assignment Problem.
TL;DR: This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory.