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
Integrated machine scheduling and vehicle routing with time windows
TL;DR: The genetic algorithm outperforms the classic decomposition approaches in case of small-size instances and is able to generate relatively good solutions for instances with up to 50 jobs, 5 machines, and 10 vehicles.
Journal ArticleDOI
A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows
TL;DR: A parallel simulated annealing algorithm that includes a Residual Capacity and Radial Surcharge insertion-based heuristic is developed and applied to solve a variant of the vehicle routing problem in which customers require simultaneous pickup and delivery of goods during specific individual time windows.
Journal ArticleDOI
OR problems related to Home Health Care: A review of relevant routing and scheduling problems
Mohamed Fatah Cisse,Semih Yalçındağ,Yannick Kergosien,Evren Sahin,Christophe Lenté,Andrea Matta +5 more
TL;DR: This paper details a comprehensive overview of recent OR models developed for the HHCRSP, a field that has received a great amount of attention in recent years.
Journal ArticleDOI
A memetic algorithm for the Multi Trip Vehicle Routing Problem
TL;DR: This work considers the Multi Trip Vehicle Routing Problem, in which a set of geographically scattered customers have to be served by a fleet of vehicles, and aims to minimize the total travel time while respecting temporal and capacity constraints.
Journal ArticleDOI
A Taxonomic Review of Metaheuristic Algorithms for Solving the Vehicle Routing Problem and Its Variants
Raafat Elshaer,Hadeer Awad +1 more
TL;DR: Based on a metaheuristic classification, 299 VRP articles published between 2009 and 2017 are classified to reveal the usage trends of the algorithms and the solved VRP variants for showing the ones that are most popular, and those that are promising topics for future research.
References
More filters
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
The traveling salesman problem
TL;DR: This study tested human performance on a real and virtual floor, as well as in a threedimensional (3D) virtual space, and modeled these results by a graph pyramid algorithm, which suggests that deterioration of performance in the 3D space can be attributed to geometrical relations between hierarchical clustering in a3D space and coarse-to-fine production of a tour.
Journal ArticleDOI
A general heuristic for vehicle routing problems
David Pisinger,Stefan Ropke +1 more
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.
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.
Book ChapterDOI
Local Search in Combinatorial Optimization
TL;DR: Computational bounds for local search in combinatorial local search algorithms for Combinatorial problems local searchgorithms for solving the combinatoric a dual local search framework for combinatorials the max-min ant system and local search for combinatorsial a framework for local combinatoria optimization problems localSearch in combinatorship optimization radarx heuristics and localsearch paginas.