A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Penna, P., Subramanian, A., Ochi, L., Vidal, T., & Prins, C. Annals of Operations Research, 273(1-2):5–74, 2019.
Paper doi abstract bibtex 1 download We consider a family of rich vehicle routing problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multi- ple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the sequences of visits and perform either heuristic or optimal reassignments of vehicles to routes. To the best of our knowledge, this is the first unified approach for a large class of heterogeneous fleet RVRPs, capable of solving more than 12 problem variants. The efficiency of the algorithm is evaluated on 643 well-known benchmark instances, and 71.70% of the best known solutions are either retrieved or improved. Moreover, the proposed metaheuristic, which can be considered as a matheuristic, produces high quality solutions with low standard deviation in comparison with previous methods. Finally, we observe that the use of combined neighborhoods does not lead to significant quality gains. Contrary to intuition, the computational effort seems better spent on more intensive route optimization rather than on more intelligent and frequent fleet re-assignments.
@article{Penna2019,
abstract = {We consider a family of rich vehicle routing problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multi- ple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the sequences of visits and perform either heuristic or optimal reassignments of vehicles to routes. To the best of our knowledge, this is the first unified approach for a large class of heterogeneous fleet RVRPs, capable of solving more than 12 problem variants. The efficiency of the algorithm is evaluated on 643 well-known benchmark instances, and 71.70{\%} of the best known solutions are either retrieved or improved. Moreover, the proposed metaheuristic, which can be considered as a matheuristic, produces high quality solutions with low standard deviation in comparison with previous methods. Finally, we observe that the use of combined neighborhoods does not lead to significant quality gains. Contrary to intuition, the computational effort seems better spent on more intensive route optimization rather than on more intelligent and frequent fleet re-assignments.},
author = {Penna, P.H.V. and Subramanian, A. and Ochi, L.S. and Vidal, T. and Prins, C.},
doi = {10.1007/s10479-017-2642-9},
file = {:C$\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Penna et al/Penna et al. - 2019 - A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.pdf:pdf},
journal = {Annals of Operations Research},
keywords = {Heterogeneous fleet,Iterated local search,Matheuristics,Rich vehicle routing,Set partitioning},
number = {1-2},
pages = {5--74},
title = {{A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet}},
url = {https://arxiv.org/pdf/1803.01930.pdf},
volume = {273},
year = {2019}
}
Downloads: 1
{"_id":"Ah5oBfqHqD2GEe793","bibbaseid":"penna-subramanian-ochi-vidal-prins-ahybridheuristicforabroadclassofvehicleroutingproblemswithheterogeneousfleet-2019","downloads":1,"creationDate":"2019-02-04T21:14:23.974Z","title":"A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet","author_short":["Penna, P.","Subramanian, A.","Ochi, L.","Vidal, T.","Prins, C."],"year":2019,"bibtype":"article","biburl":"https://w1.cirrelt.ca/~vidalt/resources/My Collection.bib","bibdata":{"bibtype":"article","type":"article","abstract":"We consider a family of rich vehicle routing problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multi- ple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the sequences of visits and perform either heuristic or optimal reassignments of vehicles to routes. To the best of our knowledge, this is the first unified approach for a large class of heterogeneous fleet RVRPs, capable of solving more than 12 problem variants. The efficiency of the algorithm is evaluated on 643 well-known benchmark instances, and 71.70% of the best known solutions are either retrieved or improved. Moreover, the proposed metaheuristic, which can be considered as a matheuristic, produces high quality solutions with low standard deviation in comparison with previous methods. Finally, we observe that the use of combined neighborhoods does not lead to significant quality gains. Contrary to intuition, the computational effort seems better spent on more intensive route optimization rather than on more intelligent and frequent fleet re-assignments.","author":[{"propositions":[],"lastnames":["Penna"],"firstnames":["P.H.V."],"suffixes":[]},{"propositions":[],"lastnames":["Subramanian"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Ochi"],"firstnames":["L.S."],"suffixes":[]},{"propositions":[],"lastnames":["Vidal"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Prins"],"firstnames":["C."],"suffixes":[]}],"doi":"10.1007/s10479-017-2642-9","file":":C$\\$:/Users/Thibaut/Documents/Mendeley-Articles/Penna et al/Penna et al. - 2019 - A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.pdf:pdf","journal":"Annals of Operations Research","keywords":"Heterogeneous fleet,Iterated local search,Matheuristics,Rich vehicle routing,Set partitioning","number":"1-2","pages":"5–74","title":"A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet","url":"https://arxiv.org/pdf/1803.01930.pdf","volume":"273","year":"2019","bibtex":"@article{Penna2019,\nabstract = {We consider a family of rich vehicle routing problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multi- ple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the sequences of visits and perform either heuristic or optimal reassignments of vehicles to routes. To the best of our knowledge, this is the first unified approach for a large class of heterogeneous fleet RVRPs, capable of solving more than 12 problem variants. The efficiency of the algorithm is evaluated on 643 well-known benchmark instances, and 71.70{\\%} of the best known solutions are either retrieved or improved. Moreover, the proposed metaheuristic, which can be considered as a matheuristic, produces high quality solutions with low standard deviation in comparison with previous methods. Finally, we observe that the use of combined neighborhoods does not lead to significant quality gains. Contrary to intuition, the computational effort seems better spent on more intensive route optimization rather than on more intelligent and frequent fleet re-assignments.},\nauthor = {Penna, P.H.V. and Subramanian, A. and Ochi, L.S. and Vidal, T. and Prins, C.},\ndoi = {10.1007/s10479-017-2642-9},\nfile = {:C$\\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Penna et al/Penna et al. - 2019 - A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.pdf:pdf},\njournal = {Annals of Operations Research},\nkeywords = {Heterogeneous fleet,Iterated local search,Matheuristics,Rich vehicle routing,Set partitioning},\nnumber = {1-2},\npages = {5--74},\ntitle = {{A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet}},\nurl = {https://arxiv.org/pdf/1803.01930.pdf},\nvolume = {273},\nyear = {2019}\n}\n","author_short":["Penna, P.","Subramanian, A.","Ochi, L.","Vidal, T.","Prins, C."],"key":"Penna2019","id":"Penna2019","bibbaseid":"penna-subramanian-ochi-vidal-prins-ahybridheuristicforabroadclassofvehicleroutingproblemswithheterogeneousfleet-2019","role":"author","urls":{"Paper":"https://arxiv.org/pdf/1803.01930.pdf"},"keyword":["Heterogeneous fleet","Iterated local search","Matheuristics","Rich vehicle routing","Set partitioning"],"metadata":{"authorlinks":{"vidal, t":"https://bibbase.org/show?bib=https%3A%2F%2Fw1.cirrelt.ca%2F%7Evidalt%2Fresources%2FMy%2520Collection.bib"}},"downloads":1,"html":""},"search_terms":["hybrid","heuristic","broad","class","vehicle","routing","problems","heterogeneous","fleet","penna","subramanian","ochi","vidal","prins"],"keywords":["heterogeneous fleet","iterated local search","matheuristics","rich vehicle routing","set partitioning"],"authorIDs":["awoTsndRPACdYbwLY"],"dataSources":["yinfondEAJRbDM9sJ","sempRA6PhmAdGk3yG"]}