@incollection{Laporte2014a,
abstract = {In recent years, several sophisticated mathematical programming decomposition algorithms have been put forward for the solution of the VRP. Yet, despite this effort, only relatively small instances involving around 100 customers can be solved optimally, and the variance of computing times is high. However, instances encountered in real-life settings are sometimes large and must be solved quickly within predictable times, which means that efficient heuristics are required in practice. Also, because the exact problem definition varies from one setting to another, it becomes necessary to develop heuristics that are sufficiently flexible to handle a variety of objectives and side constraints. These concerns are clearly reflected in the algorithms developed over the past few years. This chapter provides an overview of heuristics for the VRP, with an emphasis on recent results.},
author = {Laporte, G. and Ropke, S. and Vidal, T.},
booktitle = {Vehicle Routing: Problems, Methods, and Applications},
chapter = {4},
doi = {10.1137/1.9781611973594.ch4},
editor = {Toth, P. and Vigo, D.},
file = {:C$\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Laporte, Ropke, Vidal/Laporte, Ropke, Vidal - 2014 - Heuristics for the vehicle routing problem.pdf:pdf},
mendeley-groups = {Metaheuristics/Decompositions,VRP/Surveys},
pages = {87--116},
publisher = {Society for Industrial and Applied Mathematics},
title = {{Heuristics for the vehicle routing problem}},
url = {https://doi.org/10.1137/1.9781611973594.ch4},
year = {2014}
}

{"_id":"9sRjy5CXbB8p54gRv","bibbaseid":"laporte-ropke-vidal-heuristicsforthevehicleroutingproblem-2014","downloads":1,"creationDate":"2017-06-20T13:26:52.947Z","title":"Heuristics for the vehicle routing problem","author_short":["Laporte, G.","Ropke, S.","Vidal, T."],"year":2014,"bibtype":"incollection","biburl":"https://w1.cirrelt.ca/~vidalt/resources/My Collection.bib","bibdata":{"bibtype":"incollection","type":"incollection","abstract":"In recent years, several sophisticated mathematical programming decomposition algorithms have been put forward for the solution of the VRP. Yet, despite this effort, only relatively small instances involving around 100 customers can be solved optimally, and the variance of computing times is high. However, instances encountered in real-life settings are sometimes large and must be solved quickly within predictable times, which means that efficient heuristics are required in practice. Also, because the exact problem definition varies from one setting to another, it becomes necessary to develop heuristics that are sufficiently flexible to handle a variety of objectives and side constraints. These concerns are clearly reflected in the algorithms developed over the past few years. This chapter provides an overview of heuristics for the VRP, with an emphasis on recent results.","author":[{"propositions":[],"lastnames":["Laporte"],"firstnames":["G."],"suffixes":[]},{"propositions":[],"lastnames":["Ropke"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Vidal"],"firstnames":["T."],"suffixes":[]}],"booktitle":"Vehicle Routing: Problems, Methods, and Applications","chapter":"4","doi":"10.1137/1.9781611973594.ch4","editor":[{"propositions":[],"lastnames":["Toth"],"firstnames":["P."],"suffixes":[]},{"propositions":[],"lastnames":["Vigo"],"firstnames":["D."],"suffixes":[]}],"file":":C$\\$:/Users/Thibaut/Documents/Mendeley-Articles/Laporte, Ropke, Vidal/Laporte, Ropke, Vidal - 2014 - Heuristics for the vehicle routing problem.pdf:pdf","mendeley-groups":"Metaheuristics/Decompositions,VRP/Surveys","pages":"87–116","publisher":"Society for Industrial and Applied Mathematics","title":"Heuristics for the vehicle routing problem","url":"https://doi.org/10.1137/1.9781611973594.ch4","year":"2014","bibtex":"@incollection{Laporte2014a,\nabstract = {In recent years, several sophisticated mathematical programming decomposition algorithms have been put forward for the solution of the VRP. Yet, despite this effort, only relatively small instances involving around 100 customers can be solved optimally, and the variance of computing times is high. However, instances encountered in real-life settings are sometimes large and must be solved quickly within predictable times, which means that efficient heuristics are required in practice. Also, because the exact problem definition varies from one setting to another, it becomes necessary to develop heuristics that are sufficiently flexible to handle a variety of objectives and side constraints. These concerns are clearly reflected in the algorithms developed over the past few years. This chapter provides an overview of heuristics for the VRP, with an emphasis on recent results.},\nauthor = {Laporte, G. and Ropke, S. and Vidal, T.},\nbooktitle = {Vehicle Routing: Problems, Methods, and Applications},\nchapter = {4},\ndoi = {10.1137/1.9781611973594.ch4},\neditor = {Toth, P. and Vigo, D.},\nfile = {:C$\\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Laporte, Ropke, Vidal/Laporte, Ropke, Vidal - 2014 - Heuristics for the vehicle routing problem.pdf:pdf},\nmendeley-groups = {Metaheuristics/Decompositions,VRP/Surveys},\npages = {87--116},\npublisher = {Society for Industrial and Applied Mathematics},\ntitle = {{Heuristics for the vehicle routing problem}},\nurl = {https://doi.org/10.1137/1.9781611973594.ch4},\nyear = {2014}\n}\n","author_short":["Laporte, G.","Ropke, S.","Vidal, T."],"editor_short":["Toth, P.","Vigo, D."],"key":"Laporte2014a","id":"Laporte2014a","bibbaseid":"laporte-ropke-vidal-heuristicsforthevehicleroutingproblem-2014","role":"author","urls":{"Paper":"https://doi.org/10.1137/1.9781611973594.ch4"},"metadata":{"authorlinks":{"vidal, t":"https://bibbase.org/show?bib=https%3A%2F%2Fw1.cirrelt.ca%2F%7Evidalt%2Fresources%2FMy%2520Collection.bib"}},"downloads":1},"search_terms":["heuristics","vehicle","routing","problem","laporte","ropke","vidal"],"keywords":[],"authorIDs":["awoTsndRPACdYbwLY"],"dataSources":["yinfondEAJRbDM9sJ","sempRA6PhmAdGk3yG"]}