@article{Bulhoes2018,
abstract = {We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems.},
archivePrefix = {arXiv},
arxivId = {1706.03097},
author = {Bulh{\~{o}}es, T. and H{\`{a}}, M.H. and Martinelli, R. and Vidal, T.},
eprint = {1706.03097},
file = {:C$\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Bulh{\~{o}}es et al/Bulh{\~{o}}es et al. - 2018 - The vehicle routing problem with service level constraints.pdf:pdf},
journal = {European Journal of Operational Research},
keywords = {branch-and-cut,genetic,service level constraints,vehicle routing problem},
mendeley-groups = {Metaheuristics/Decompositions,VRP-Var1-ASSIGN/Var1-ASSIGN-Service-Levels},
number = {2},
pages = {544--558},
title = {{The vehicle routing problem with service level constraints}},
url = {https://arxiv.org/pdf/1706.03097.pdf},
volume = {265},
year = {2018}
}

{"_id":"QAL3H7dP72FbkJCZk","bibbaseid":"bulhes-h-martinelli-vidal-thevehicleroutingproblemwithservicelevelconstraints-2018","downloads":0,"creationDate":"2018-02-22T14:19:55.102Z","title":"The vehicle routing problem with service level constraints","author_short":["Bulhões, T.","Hà, M.","Martinelli, R.","Vidal, T."],"year":2018,"bibtype":"article","biburl":"https://w1.cirrelt.ca/~vidalt/resources/My Collection.bib","bibdata":{"bibtype":"article","type":"article","abstract":"We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems.","archiveprefix":"arXiv","arxivid":"1706.03097","author":[{"propositions":[],"lastnames":["Bulhões"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Hà"],"firstnames":["M.H."],"suffixes":[]},{"propositions":[],"lastnames":["Martinelli"],"firstnames":["R."],"suffixes":[]},{"propositions":[],"lastnames":["Vidal"],"firstnames":["T."],"suffixes":[]}],"eprint":"1706.03097","file":":C$\\$:/Users/Thibaut/Documents/Mendeley-Articles/Bulhões et al/Bulhões et al. - 2018 - The vehicle routing problem with service level constraints.pdf:pdf","journal":"European Journal of Operational Research","keywords":"branch-and-cut,genetic,service level constraints,vehicle routing problem","mendeley-groups":"Metaheuristics/Decompositions,VRP-Var1-ASSIGN/Var1-ASSIGN-Service-Levels","number":"2","pages":"544–558","title":"The vehicle routing problem with service level constraints","url":"https://arxiv.org/pdf/1706.03097.pdf","volume":"265","year":"2018","bibtex":"@article{Bulhoes2018,\nabstract = {We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems.},\narchivePrefix = {arXiv},\narxivId = {1706.03097},\nauthor = {Bulh{\\~{o}}es, T. and H{\\`{a}}, M.H. and Martinelli, R. and Vidal, T.},\neprint = {1706.03097},\nfile = {:C$\\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Bulh{\\~{o}}es et al/Bulh{\\~{o}}es et al. - 2018 - The vehicle routing problem with service level constraints.pdf:pdf},\njournal = {European Journal of Operational Research},\nkeywords = {branch-and-cut,genetic,service level constraints,vehicle routing problem},\nmendeley-groups = {Metaheuristics/Decompositions,VRP-Var1-ASSIGN/Var1-ASSIGN-Service-Levels},\nnumber = {2},\npages = {544--558},\ntitle = {{The vehicle routing problem with service level constraints}},\nurl = {https://arxiv.org/pdf/1706.03097.pdf},\nvolume = {265},\nyear = {2018}\n}\n","author_short":["Bulhões, T.","Hà, M.","Martinelli, R.","Vidal, T."],"key":"Bulhoes2018","id":"Bulhoes2018","bibbaseid":"bulhes-h-martinelli-vidal-thevehicleroutingproblemwithservicelevelconstraints-2018","role":"author","urls":{"Paper":"https://arxiv.org/pdf/1706.03097.pdf"},"keyword":["branch-and-cut","genetic","service level constraints","vehicle routing problem"],"metadata":{"authorlinks":{"vidal, t":"https://bibbase.org/show?bib=https%3A%2F%2Fw1.cirrelt.ca%2F%7Evidalt%2Fresources%2FMy%2520Collection.bib"}},"downloads":0},"search_terms":["vehicle","routing","problem","service","level","constraints","bulhões","hà","martinelli","vidal"],"keywords":["branch-and-cut","genetic","service level constraints","vehicle routing problem"],"authorIDs":["awoTsndRPACdYbwLY"],"dataSources":["yinfondEAJRbDM9sJ","sempRA6PhmAdGk3yG"]}