Survey: matheuristics for rich vehicle routing problems

Authors:
Karl F. Doerner;Verena Schmid
Affiliations:
University of Vienna, Faculty of Business, Economics and Statistics, Austria;University of Vienna, Faculty of Business, Economics and Statistics, Austria
Venue:
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Year:
2010

Citing 49
Cited 2

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
The vehicle routing problem

The vehicle routing problem
An overview of vehicle routing problems

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

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

The vehicle routing problem
Set-covering-based 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
VRP with Time Windows

The vehicle routing problem
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

INFORMS Journal on Computing
A Heuristic Method for the Set Covering Problem

Operations Research
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows

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

INFORMS Journal on Computing
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Transportation Science
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
A first multilevel cooperative algorithm for capacitated multicommodity network design

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Variable neighborhood search and local branching

Computers and Operations Research
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Computers and Operations Research
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

Transportation Science
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science
A Tabu Search Algorithm for a Routing and Container Loading Problem

Transportation Science
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
Metaheuristics for the vehicle routing problem with loading constraints

Networks
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks - Special Issue In Memory of Stefano Pallottino
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

Transportation Science
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery

Transportation Science
Heuristics for the multi-period orienteering problem with multiple time windows

Computers and Operations Research
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

Computers and Operations Research
Fifty Years of Vehicle Routing

Transportation Science
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands

Transportation Science
An ILP improvement procedure for the Open Vehicle Routing Problem

Computers and Operations Research
Matheuristics: Hybridizing Metaheuristics and Mathematical Programming

Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: an application to the 2-dimensional loading vehicle routing problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Heuristic and exact algorithms for the multi-pile vehicle routing problem

OR Spectrum
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A taxonomy of cooperative search algorithms

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Discrete Optimization

Heuristics for a real-world mail delivery problem

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
A lower bound for the Node, Edge, and Arc Routing Problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys recent developments of hybrid solution techniques for different vehicle routing problems. Only hybridizations of heuristic and exact solution techniques are considered. Most of the existing hybrid approaches are based on set-covering formulations, local branching or different decomposition techniques.