Sequential search and its application to vehicle-routing problems

DOI10.1016/j.cor.2005.02.020zbMath1086.90064OpenAlexW1990372046MaRDI QIDQ2489298

Stefan Irnich, Birger Funke, Tore Grünert

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.020

zbMATH Keywords

Local searchVehicle-routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (26)

An efficient implementation of a static move descriptor-based local search heuristic ⋮ Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem ⋮ Solving the unconstrained optimization problem by a variable neighborhood search ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem ⋮ The close-open mixed vehicle routing problem ⋮ A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Efficiently solving very large-scale routing problems ⋮ A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST ⋮ Vehicle Routing Problems with Inter-Tour Resource Constraints ⋮ The vehicle routing problem with profits and consistency constraints ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ Solution of real-world postman problems ⋮ Variable neighbourhood search: methods and applications ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ On the one-to-one pickup-and-delivery problem with time windows and trailers ⋮ Variable neighbourhood search: Methods and applications ⋮ Fast local search algorithms for the handicapped persons transportation problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• TSPLIB
• GRASP
• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The savings algorithm for the vehicle routing problem
• Large-step Markov chains for the TSP incorporating local search heuristics
• Variable neighborhood search
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Technical Note—A Note on the Multiple Traveling Salesmen Problem
• TSPLIB—A Traveling Salesman Problem Library
• On the Distance Constrained Vehicle Routing Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Efficient Heuristic Procedure for Partitioning Graphs
• Parallel iterative search methods for vehicle routing problems
• A guide to vehicle routing heuristics
• A unified tabu search heuristic for vehicle routing problems with time windows
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Method for Solving Traveling-Salesman Problems
• Algorithms for Large-scale Travelling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: Sequential search and its application to vehicle-routing problems