Journal ArticleDOI
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
Reads0
Chats0
TLDR
The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a large class of time-constrained vehicle routing problems, introducing several new features to manage the temporal dimension.About:
This article is published in Computers & Operations Research.The article was published on 2013-01-01. It has received 452 citations till now. The article focuses on the topics: Static routing & 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.
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
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
TL;DR: A new problem, the so-called Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows (EFSMVRPTW), covers real world applications where an optimal mix of different available battery powered (and conventional) vehicles has to be found.
Journal ArticleDOI
Routing a mixed fleet of electric and conventional vehicles
Dominik Goeke,Michael Schneider +1 more
TL;DR: In this article, the authors proposed an Adaptive Large Neighborhood Search algorithm that is enhanced by a local search for intensification to optimize the routing of a mixed fleet of electric commercial vehicles and conventional internal combustion commercial vehicles (ICCVs).
References
More filters
Journal ArticleDOI
OR Practice-Computerized Vehicle Routing in the Soft Drink Industry
Bruce L. Golden,Edward Wasil +1 more
TL;DR: In this article, the authors examine the use of microcomputer-based vehicle routing software in the soft drink industry and present several case studies that highlight the ways in which software packages have been able to cope with these concerns and other industryrelated problems.
Journal ArticleDOI
Applying GIS and Or Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems
Don Weigel,Buyang Cao +1 more
TL;DR: A series of algorithms are constructed, including the algorithm to build the origin-and-destination matrix, the algorithms to assign resources, and algorithms to perform sequencing and route improvement for the Sears technician-dispatching and home-delivery business.
A Branch-and-Price-Based Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows
TL;DR: A large neighborhood search algorithm that takes advantage of the power of branch‐and‐price which is the leading methodology for the exact solution of the VRPTW.
Journal ArticleDOI
A Scatter Search for the periodic capacitated arc routing problem
TL;DR: This paper considers the Periodic Capacitated Arc Routing Problem (PCARP), a natural extension of the well-known CARP to a multi-period horizon and develops and evaluates a greedy heuristic and a Scatter Search that competes with one state-of-the-art metaheuristic proposed for the CARP.
Journal ArticleDOI
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
TL;DR: This refinement of a previously proposed tabu search algorithm yields new best known solutions on a set of benchmark instances of the multi-depot, the periodic and the site-dependent vehicle routing problems with time windows.