A survey on matheuristics for routing problems
In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approache...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2014-11-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440621000344 |
_version_ | 1818846148113203200 |
---|---|
author | Claudia Archetti M.Grazia Speranza |
author_facet | Claudia Archetti M.Grazia Speranza |
author_sort | Claudia Archetti |
collection | DOAJ |
description | In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of matheuristics: decomposition approaches, improvement heuristics and branch-and-price/column generation-based approaches. The contribution of this paper is to offer to researchers interested in routing problems a structured overview of the most successful ideas to combine heuristic schemes and mathematical programming models to obtain high quality solutions. Moreover, we analyze the state of the art and provide insights and hints for future research. |
first_indexed | 2024-12-19T05:40:56Z |
format | Article |
id | doaj.art-c2edb2af065a4ea1892e577e5f9597b5 |
institution | Directory Open Access Journal |
issn | 2192-4406 |
language | English |
last_indexed | 2024-12-19T05:40:56Z |
publishDate | 2014-11-01 |
publisher | Elsevier |
record_format | Article |
series | EURO Journal on Computational Optimization |
spelling | doaj.art-c2edb2af065a4ea1892e577e5f9597b52022-12-21T20:34:01ZengElsevierEURO Journal on Computational Optimization2192-44062014-11-0124223246A survey on matheuristics for routing problemsClaudia Archetti0M.Grazia Speranza1Department of Economics and Management, University of Brescia, Brescia, Italy.Department of Economics and Management, University of Brescia, Brescia, Italy.In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of matheuristics: decomposition approaches, improvement heuristics and branch-and-price/column generation-based approaches. The contribution of this paper is to offer to researchers interested in routing problems a structured overview of the most successful ideas to combine heuristic schemes and mathematical programming models to obtain high quality solutions. Moreover, we analyze the state of the art and provide insights and hints for future research.http://www.sciencedirect.com/science/article/pii/S219244062100034490C11 |
spellingShingle | Claudia Archetti M.Grazia Speranza A survey on matheuristics for routing problems EURO Journal on Computational Optimization 90C11 |
title | A survey on matheuristics for routing problems |
title_full | A survey on matheuristics for routing problems |
title_fullStr | A survey on matheuristics for routing problems |
title_full_unstemmed | A survey on matheuristics for routing problems |
title_short | A survey on matheuristics for routing problems |
title_sort | survey on matheuristics for routing problems |
topic | 90C11 |
url | http://www.sciencedirect.com/science/article/pii/S2192440621000344 |
work_keys_str_mv | AT claudiaarchetti asurveyonmatheuristicsforroutingproblems AT mgraziasperanza asurveyonmatheuristicsforroutingproblems AT claudiaarchetti surveyonmatheuristicsforroutingproblems AT mgraziasperanza surveyonmatheuristicsforroutingproblems |