Sequential search and its application to vehicle-routing problems

Authors:
Stefan Irnich;Birger Funke;Tore Grünert
Affiliations:
Deutsche Post Lehrstuhl für Optimierung von Distributionsnetzwerken, RWTH Aachen University, Aachen, Germany;GTS Systems and Consulting GmbH, Herzogenrath, Germany;GTS Systems and Consulting GmbH, Herzogenrath, Germany
Venue:
Computers and Operations Research
Year:
2006

Citing 12
Cited 8

On the distance constrained vehicle routing problem

Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
Variable neighborhood search

Computers and Operations Research
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

Journal of the ACM (JACM)
Branch-and-bound algorithms for the capacitated VRP

The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP

The vehicle routing problem
Classical heuristics for the capacitated VRP

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Tabu Search

Tabu Search
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing

Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration

Journal of Heuristics
A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows

Applied Soft Computing
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research
Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm

Applied Soft Computing
A hybrid intelligent algorithm for vehicle routing models with fuzzy travel times

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows

ICCL'11 Proceedings of the Second international conference on Computational logistics
High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows

Journal of Mathematical Modelling and Algorithms
An event-driven optimization framework for dynamic vehicle routing

Decision Support Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Local search is the most frequently used heuristic technique for solving combinatorial optimization problems. It is also the basis for modern metaheuristics, like, e.g., Tabu Search, and Variable Neighborhood Search. The paper introduces sequential search as a generic technique for the efficient exploration of local-search neighborhoods. One of its key concepts is the systematic decomposition of moves, which allows pruning within local search based on associated partial gains. The application of theoretical concepts to several well-known neighborhoods of the vehicle-routing problem (VRP) is demonstrated. Computational tests show substantial speedup factors, e.g., up to 10000 for the 3-opt* neighborhood. This underlines the superiority of sequential search over straightforward techniques in the VRP context.