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
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines
TL;DR: This paper introduces, model, and solves a rich multiperiod inventory-routing problem with pickups and deliveries motivated by the replenishment of automated teller machines in the Netherlands using a very large-scale mixed-integer linear programming model.
Journal ArticleDOI
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
TL;DR: In this article, a population-based metaheuristic is proposed to solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading.
Journal ArticleDOI
Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
TL;DR: An updated survey of the main methods that allow the use of multi-objective schemes for single-Objective optimization and some possible paths of future work in this area are identified.
Journal ArticleDOI
A memetic algorithm for the patient transportation problem
TL;DR: A mathematical formulation for the problem is provided and a memetic algorithm with a customized recombination operator is developed, which is adapted to solve the classic DARP instances, and found to perform well on medium-scale instances.
Journal ArticleDOI
Multi-trip time-dependent vehicle routing problem with time windows
TL;DR: A hybrid meta-heuristic algorithm is designed to solve a routing problem in urban transportation which considers time-dependent travel time, multiple trips per vehicle, and loading time at the depot simultaneously, and is shown to be robust and efficient under different speed profiles and maximum trip duration limits.
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.