{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T19:49:12Z","timestamp":1721418552188},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T00:00:00Z","timestamp":1338595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10479-012-1162-x","type":"journal-article","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T16:51:14Z","timestamp":1338569474000},"page":"131-157","source":"Crossref","is-referenced-by-count":7,"title":["A computational study of solution approaches for the resource constrained elementary shortest path problem"],"prefix":"10.1007","volume":"201","author":[{"given":"Luigi","family":"Di\u00a0Puglia\u00a0Pugliese","sequence":"first","affiliation":[]},{"given":"Francesca","family":"Guerriero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,2]]},"reference":[{"key":"1162_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230130212","volume":"13","author":"Y. P. Aneja","year":"1983","unstructured":"Aneja, Y. P., Aggarwal, V., & Nair, K. P. K. (1983). Shortest chain subject to side constraints. Networks, 13, 295\u2013302.","journal-title":"Networks"},{"key":"1162_CR2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.32.3.208","volume":"32","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Boland, N., Clarke, L., Johnson, E. L., Nemhauser, G. L., & Shenoi, R. G. (1998). Flight string models for aircraft fleeting and routing. Transportation Science, 32, 208\u2013220.","journal-title":"Transportation Science"},{"key":"1162_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J. E. Beasley","year":"1989","unstructured":"Beasley, J. E., & Christofides, N. (1989). An algorithm for the resource constrained shortest path problem. Networks, 19, 379\u2013394.","journal-title":"Networks"},{"key":"1162_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","volume":"34","author":"N. Boland","year":"2006","unstructured":"Boland, N., Dethridge, J., & Dumitrescu, I. (2006). Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Operations Research Letters, 34, 58\u201368.","journal-title":"Operations Research Letters"},{"issue":"2","key":"1162_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"B. V. Cherkassky","year":"1996","unstructured":"Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996). Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming, 73(2), 129\u2013174.","journal-title":"Mathematical Programming"},{"key":"1162_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (1981). Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Mathematical Programming, 20, 255\u2013282.","journal-title":"Mathematical Programming"},{"key":"1162_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/1.9780898718515.ch7","volume-title":"The vehicle-routing problem","author":"J. F. Cordeau","year":"2002","unstructured":"Cordeau, J. F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2002). VRP with time windows. In P. Toth & D. Vigo (Eds.), The vehicle-routing problem (pp. 157\u2013193)."},{"issue":"2","key":"1162_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/trsc.1050.0118","volume":"40","author":"M. Dell\u2019Amico","year":"2006","unstructured":"Dell\u2019Amico, M., Righini, G., & Salani, M. (2006). A branch-and-price approach to the vehicle-routing problem with simultaneous distribution and collection. Transportation Science, 40(2), 235\u2013247.","journal-title":"Transportation Science"},{"key":"1162_CR9","unstructured":"Desrochers, M. (1988). An algorithm for the shortest path problem with resource constraints (Technical report G-88-27). GERAD."},{"key":"1162_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/03155986.1988.11732063","volume":"26","author":"M. Desrochers","year":"1988","unstructured":"Desrochers, M., & Soumis, F. (1988). A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR. Information Systems and Operational Research, 26, 191\u2013212.","journal-title":"INFOR. Information Systems and Operational Research"},{"key":"1162_CR11","first-page":"357","volume":"17","author":"J. Desrosiers","year":"1983","unstructured":"Desrosiers, J., Pelletier, P., & Soumis, F. (1983). Plus court chemin avec constraints d\u2019horaires. RAIRO\u2014Theoretical Informatics and Applications, 17, 357\u2013377 (in French).","journal-title":"RAIRO\u2014Theoretical Informatics and Applications"},{"issue":"2","key":"1162_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342\u2013354.","journal-title":"Operations Research"},{"key":"1162_CR13","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M. Dror","year":"1994","unstructured":"Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operational Research, 42, 977\u2013978.","journal-title":"Operational Research"},{"issue":"3","key":"1162_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., & Boland, N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks, 42(3), 135\u2013153.","journal-title":"Networks"},{"issue":"3","key":"1162_CR15","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"43","author":"D. Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks, 43(3), 216\u2013229.","journal-title":"Networks"},{"key":"1162_CR16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Y. Handler","year":"1980","unstructured":"Handler, G. Y., & Zang, I. (1980). A dual algorithm for the constrained shortest path problem. Networks, 10, 293\u2013309.","journal-title":"Networks"},{"key":"1162_CR17","first-page":"93","volume":"17","author":"D. J. Houck","year":"1980","unstructured":"Houck, D. J., Picard, J. C., Queyranne, M., & Vemuganti, R. R. (1980). The travelling salesman problem as a constrained shortest path problem: theory and computational experience. Operational Research, 17, 93\u2013109.","journal-title":"Operational Research"},{"issue":"1","key":"1162_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","volume":"30","author":"S. Irnich","year":"2008","unstructured":"Irnich, S. (2008). Resource extension functions: properties, inversion and generalization to segments. OR-Spektrum, 30(1), 113\u2013148.","journal-title":"OR-Spektrum"},{"key":"1162_CR19","unstructured":"Jaumard, B., Semet, F., & Vovor, T. (1996). A two-phase resource constrained shortest path algorithm for acyclic graphs (Technical report G-96-48). Les Cahier du GERAD."},{"key":"1162_CR20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"H. C. Joksch","year":"1966","unstructured":"Joksch, H. C. (1966). The shortest route problem with constraints. Journal of Mathematical Analysis and Applications, 14, 191\u2013197.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"1162_CR21","unstructured":"Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. PhD thesis, Institute of Mathematical Modelling, Technical University of Denmark, DK-2800 Lyngby. Dissertation no. 16."},{"key":"1162_CR22","volume-title":"Combinatorial optimization: networks and matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L. (1976). Combinatorial optimization: networks and matroids. New York: Holt, Rinehart and Winston."},{"key":"1162_CR23","series-title":"LNCS","first-page":"326","volume-title":"7th ann. European symp. on algorithms (ESA2000)","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., & Ziegelmann, M. (2000). Resource constraint shortest paths. In LNCS: Vol.\u00a01879. 7 th ann. European symp. on algorithms (ESA2000) (pp. 326\u2013337)."},{"issue":"4","key":"1162_CR24","doi-asserted-by":"crossref","first-page":"579","DOI":"10.2208\/jscejd.63.579","volume":"63","author":"A. G. Qureshi","year":"2007","unstructured":"Qureshi, A. G., Taniguchi, E., & Yamada, T. (2007). Elementary shortest path problem with resource constraints and time dependent late arrival penalties. Doboku Gakkai Ronbunshuu D, 63(4), 579\u2013590.","journal-title":"Doboku Gakkai Ronbunshuu D"},{"issue":"3","key":"1162_CR25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G. Righini","year":"2006","unstructured":"Righini, G., & Salani, M. (2006). Symmetry helps: bounded bidirectional dynamic-programming for the elementary shortest path problem with resource constraints. Discrete Optimization, 3(3), 255\u2013273.","journal-title":"Discrete Optimization"},{"issue":"3","key":"1162_CR26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G. Righini","year":"2008","unstructured":"Righini, G., & Salani, M. (2008). New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks, 51(3), 155\u2013170.","journal-title":"Networks"},{"key":"1162_CR27","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","volume":"36","author":"G. Righini","year":"2009","unstructured":"Righini, G., & Salani, M. (2009). Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers & Operations Research, 36, 1191\u20131203.","journal-title":"Computers & Operations Research"},{"key":"1162_CR28","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.trb.2006.12.001","volume":"41","author":"L. Santos","year":"2007","unstructured":"Santos, L., Coutinho-Rodrigues, J., & Current, J. R. (2007). An improved solution algorithm for the constrained shortest path problem. Transportation Research. Part B, 41, 756\u2013771.","journal-title":"Transportation Research. Part B"},{"key":"1162_CR29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02216932","volume":"20","author":"C. C. Skiscim","year":"1989","unstructured":"Skiscim, C. C., & Golden, B. (1989). Solving the k-shortest and constrained shortest path problem efficiently. Annals of Operations Research, 20, 249\u2013282.","journal-title":"Annals of Operations Research"},{"key":"1162_CR30","unstructured":"Solomon, M. M. (1983). Vehicle routing and scheduling with time window constraints: models and algorithms. PhD thesis, Department of Decision Science, University of Pennsylvania."},{"key":"1162_CR31","volume-title":"SIAM monographs on discrete mathematics and applications","author":"P. Toth","year":"2002","unstructured":"Toth, P., & Vigo, D. (2002). Capacitated vehicle-routing problems in the vehicle-routing problem. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1162-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1162-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1162-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:36Z","timestamp":1559153376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1162-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["1162"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1162-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,2]]}}}