Pub Date : 2000-06-01DOI: 10.1137/1.9780898718515.ch9
G. Desaulniers, J. Desrosiers, A. Erdmann, M. Solomon, F. Soumis
{"title":"VRP with Pickup and Delivery","authors":"G. Desaulniers, J. Desrosiers, A. Erdmann, M. Solomon, F. Soumis","doi":"10.1137/1.9780898718515.ch9","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch9","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124959401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1999-02-01DOI: 10.1137/1.9780898718515.ch7
J. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon, F. Soumis
This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Problem. In the VRPTW, the service at each customer must start within an associated time window and the vehicle must remain at the customer location during service. Soft time windows can be violated at a cost while hard time windows do not allow for a vehicle to arrive at a customer after the latest time to begin service. We first present a multi-commodity network flow formulation with time and capacity constraints for the VRPTW. Approximation methods proposed in the literature to derive upper bounds are then reviewed. Then we explain how lower bounds can be obtained using optimal approaches, namely, Lagrangean relaxation and column generation. Next, we provide branching and cutting strategies that can be embedded within these optimal approaches to produce integer solutions. Special cases and extensions to the VRPTW follow as well as our conclusions.
{"title":"VRP with Time Windows","authors":"J. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon, F. Soumis","doi":"10.1137/1.9780898718515.ch7","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch7","url":null,"abstract":"This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Problem. In the VRPTW, the service at each customer must start within an associated time window and the vehicle must remain at the customer location during service. Soft time windows can be violated at a cost while hard time windows do not allow for a vehicle to arrive at a customer after the latest time to begin service. We first present a multi-commodity network flow formulation with time and capacity constraints for the VRPTW. Approximation methods proposed in the literature to derive upper bounds are then reviewed. Then we explain how lower bounds can be obtained using optimal approaches, namely, Lagrangean relaxation and column generation. Next, we provide branching and cutting strategies that can be embedded within these optimal approaches to produce integer solutions. Special cases and extensions to the VRPTW follow as well as our conclusions.","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121497585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1137/1.9780898718515.ch10
B. Golden, A. Assad, E. Wasil
{"title":"Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries","authors":"B. Golden, A. Assad, E. Wasil","doi":"10.1137/1.9780898718515.ch10","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch10","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127589688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1137/1.9780898718515.ch4
Julien Bramel, D. Simchi-Levi
{"title":"Set-Covering-Based Algorithms for the Capacitated VRP","authors":"Julien Bramel, D. Simchi-Levi","doi":"10.1137/1.9780898718515.ch4","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch4","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128478665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1137/1.9780898718515.ch14
E. K. Baker
{"title":"Evolution of Microcomputer-Based Vehicle Routing Software: Case Studies in the United States","authors":"E. K. Baker","doi":"10.1137/1.9780898718515.ch14","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch14","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116115554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1137/1.9780898718515.ch2
P. Toth, D. Vigo
{"title":"Branch-And-Bound Algorithms for the Capacitated VRP","authors":"P. Toth, D. Vigo","doi":"10.1137/1.9780898718515.ch2","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch2","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126878704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1137/1.9780898718515.ch5
G. Laporte, F. Semet
{"title":"Classical Heuristics for the Capacitated VRP","authors":"G. Laporte, F. Semet","doi":"10.1137/1.9780898718515.ch5","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch5","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131260609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1137/1.9780898718515.ch12
A. Campbell, L. Clarke, M. Savelsbergh
{"title":"Inventory Routing in Practice","authors":"A. Campbell, L. Clarke, M. Savelsbergh","doi":"10.1137/1.9780898718515.ch12","DOIUrl":"https://doi.org/10.1137/1.9780898718515.ch12","url":null,"abstract":"","PeriodicalId":150091,"journal":{"name":"The Vehicle Routing Problem","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132733048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：