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
Book ChapterDOI
Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows
TL;DR: The benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations are shown, which bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.
Journal ArticleDOI
Optimizing periodic maintenance operations for Schindler Elevator Corporation
TL;DR: Schindler, the world's largest escalator company and second-largest elevator company, maintains tens of thousands of elevators and escalators throughout North America.
Matheuristics for the Periodic Vehicle Routing Problem with Time Windows
TL;DR: Two matheuristic strategies are investigated using the periodic vehicle routing problem with time windows as a testbed, finding that both often yield significantly better results than their pure metaheuristic counterparts.
Journal ArticleDOI
Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment
TL;DR: In this article, a two-phase heuristic method was proposed to efficiently solve the intractable multi-depot vehicle routing problem with time windows, where the waiting time has a significant impact on the total distribution time and the number of vehicles used.
A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows
TL;DR: Two neighborhood-based meta-heuristics are used to educate the offspring generated by a new crossover operator to enhance the solution quality, and this hybridization provides the means to combine the exploration capabilities of population-based methods and the systematic, sometimes aggressive search capabilities of neighborhood- based methods.