@article{
 title = {The vehicle routing problem with service level constraints},
 type = {article},
 year = {2018},
 keywords = {branch-and-cut,genetic,service level constraints,vehicle routing problem},
 pages = {544-558},
 volume = {265},
 websites = {https://arxiv.org/pdf/1706.03097.pdf},
 id = {54949902-34d4-3406-90c1-27dec3d27d7e},
 created = {2017-06-20T15:05:30.070Z},
 file_attached = {true},
 profile_id = {5e3d1dc4-cb58-3af5-aff1-4d943d2eaf6a},
 last_modified = {2019-03-03T15:40:24.548Z},
 read = {true},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Bulhoes2018},
 folder_uuids = {9c3862b7-56c8-4e82-a880-5b922363f046,1393ea51-539c-4a08-a724-d5cef5421b5d},
 private_publication = {false},
 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.},
 bibtype = {article},
 author = {Bulhões, T. and Hà, M.H. and Martinelli, R. and Vidal, T.},
 journal = {European Journal of Operational Research},
 number = {2}
}

{"_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://bibbase.org/service/mendeley/1465671","bibdata":{"title":"The vehicle routing problem with service level constraints","type":"article","year":"2018","keywords":"branch-and-cut,genetic,service level constraints,vehicle routing problem","pages":"544-558","volume":"265","websites":"https://arxiv.org/pdf/1706.03097.pdf","id":"54949902-34d4-3406-90c1-27dec3d27d7e","created":"2017-06-20T15:05:30.070Z","file_attached":"true","profile_id":"5e3d1dc4-cb58-3af5-aff1-4d943d2eaf6a","last_modified":"2019-03-03T15:40:24.548Z","read":"true","starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Bulhoes2018","folder_uuids":"9c3862b7-56c8-4e82-a880-5b922363f046,1393ea51-539c-4a08-a724-d5cef5421b5d","private_publication":false,"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.","bibtype":"article","author":"Bulhões, T. and Hà, M.H. and Martinelli, R. and Vidal, T.","journal":"European Journal of Operational Research","number":"2","bibtex":"@article{\n title = {The vehicle routing problem with service level constraints},\n type = {article},\n year = {2018},\n keywords = {branch-and-cut,genetic,service level constraints,vehicle routing problem},\n pages = {544-558},\n volume = {265},\n websites = {https://arxiv.org/pdf/1706.03097.pdf},\n id = {54949902-34d4-3406-90c1-27dec3d27d7e},\n created = {2017-06-20T15:05:30.070Z},\n file_attached = {true},\n profile_id = {5e3d1dc4-cb58-3af5-aff1-4d943d2eaf6a},\n last_modified = {2019-03-03T15:40:24.548Z},\n read = {true},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Bulhoes2018},\n folder_uuids = {9c3862b7-56c8-4e82-a880-5b922363f046,1393ea51-539c-4a08-a724-d5cef5421b5d},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Bulhões, T. and Hà, M.H. and Martinelli, R. and Vidal, T.},\n journal = {European Journal of Operational Research},\n number = {2}\n}","author_short":["Bulhões, T.","Hà, M.","Martinelli, R.","Vidal, T."],"urls":{"Website":"https://arxiv.org/pdf/1706.03097.pdf"},"biburl":"https://bibbase.org/service/mendeley/1465671","bibbaseid":"bulhes-h-martinelli-vidal-thevehicleroutingproblemwithservicelevelconstraints-2018","role":"author","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~vidalt%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","2252seNhipfTmjEBQ"]}