A survey on matheuristics for routing problems | Zendy

Claudia Archetti | Zendy; M. Grazia Speranza | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A survey on matheuristics for routing problems

Author(s) -

Claudia Archetti,

M. Grazia Speranza

Publication year - 2014

Publication title -

euro journal on computational optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.95

H-Index - 14

eISSN - 2192-4414

pISSN - 2192-4406

DOI - 10.1007/s13675-014-0030-7

Subject(s) - heuristics , column generation , computer science , heuristic , routing (electronic design automation) , vehicle routing problem , mathematical optimization , decomposition , quality (philosophy) , operations research , management science , artificial intelligence , mathematics , engineering , computer network , ecology , philosophy , epistemology , biology , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research