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
A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics
TL;DR: A large neighbourhood search algorithm is introduced that substantially improves the benchmark solutions for the vehicle routing problem variant considering time windows, time-dependent travel times and driving hours regulations (EC) 561/2006 that apply to vehicles over 3.5 tons in European cities.
Journal ArticleDOI
A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios
TL;DR: A new distributed algorithm based on the partition of the requests space and the combination of the routes is presented and tested on a set of 24 different scenarios of a large-scale problem in the city of San Francisco, proving that the distributed algorithm can be an effective way to solve high dimensional dial-a-ride problems.
Journal ArticleDOI
A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems
TL;DR: A unified heuristic algorithm for a large class of earliness–tardiness (E–T) scheduling problems that is capable of producing high-quality solutions when compared to the best ones available in the literature that were obtained by specific methods is proposed.
Journal ArticleDOI
Discrete firefly algorithm with compound neighborhoods for asymmetric multi-depot vehicle routing problem in the maintenance of farm machinery
TL;DR: Computational results demonstrate that the proposed approach performs better than CPLEX solver, especially for large designed instances, and is superior to the other algorithms on solving benchmark instances of multi-depot vehicle routing problem with time windows.
Book
Metaheuristics for Vehicle Routing Problems
Caroline Prodhon,Christian Prins +1 more
TL;DR: The basic problem of vehicle routing is a classical operations research problem, known to be NP-hard and called the vehicle routing problem (VRP) or capacitated VRP (CVRP).
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.