scispace - formally typeset
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

Order-first split-second methods for vehicle routing problems: A review

TL;DR: In this paper, the authors consider an ordering of customers instead of building a giant tour, and propose an ordering-first split-second approach for vehicle routing. But this approach can be declined for different vehicle routing problems and reviews the associated literature.
Journal ArticleDOI

Routing a mix of conventional, plug-in hybrid, and electric vehicles

TL;DR: In this paper, the authors introduce an electric vehicle routing problem combining conventional, plug-in hybrid, and electric vehicles, and design a sophisticated metaheuristic which combines a genetic algorithm with local and large neighborhood search.
Journal ArticleDOI

Forty years of periodic vehicle routing

TL;DR: The wide array of circumstances and settings in which the periodic vehicle routing problem has been applied is discussed and the development of solution methods, both exact and heuristic, for the PVRP are described.
Journal ArticleDOI

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

TL;DR: This work has tackled a real-world newspaper distribution problem with recycling policy as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP), which is the first study of such a problem in the literature.
Journal ArticleDOI

Chaotic dynamic weight particle swarm optimization for numerical function optimization

TL;DR: The experimental results show that, for almost all functions, the proposed chaotic dynamic weight particle swarm optimization technique has superior performance compared with other nature-inspired optimizations and well-known PSO variants.
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

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

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.
Related Papers (5)