{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:02Z","timestamp":1725815942084},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_25","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"262-274","source":"Crossref","is-referenced-by-count":8,"title":["Cumulative Vehicle Routing Problem: A Column Generation Approach"],"prefix":"10.1007","author":[{"given":"Daya Ram","family":"Gaur","sequence":"first","affiliation":[]},{"given":"Rishi Ranjan","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/trsc.24.4.294","volume":"24","author":"K. Altinkemer","year":"1990","unstructured":"Altinkemer, K., Gavish, B.: Technical Note: Heuristics for Delivery Problems with Constant Error Guarantees. Transportation Science\u00a024(4), 294\u2013297 (1990)","journal-title":"Transportation Science"},{"key":"25_CR2","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem, Tech. Rep. 1 RR949-M, ARTEMIS-IMAG, Grenoble France (1995)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E.: New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research (56), 529\u2013558 (1999)","DOI":"10.1023\/A:1018939709890"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Operations Research\u00a012, 300\u2013304 (1964)","journal-title":"Operations Research"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/net.3230230202","volume":"23","author":"L. Bianco","year":"1993","unstructured":"Bianco, L., Mingozzi, A., Ricciardelli, S.: The traveling salesman problem with cumulative costs. Networks\u00a023(2), 81\u201391 (1993)","journal-title":"Networks"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, W.R., Raghavan, P., Sudan, M.: The minimum latency problem. In: STOC, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1287\/opre.44.3.501","volume":"44","author":"J. Bramel","year":"1996","unstructured":"Bramel, J., Simchi-Levi, D.: Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research\u00a044, 501\u2013509 (1996)","journal-title":"Operations Research"},{"issue":"10","key":"25_CR8","doi-asserted-by":"publisher","first-page":"2972","DOI":"10.1016\/j.cor.2005.02.029","volume":"33","author":"A. Chabrier","year":"2006","unstructured":"Chabrier, A.: Vehicle Routing Problem with elementary shortest path based column generation. Computers & Operations Research\u00a033(10), 2972\u20132990 (2006)","journal-title":"Computers & Operations Research"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. In: OR, pp. 309\u2013318 (1969)","DOI":"10.1057\/jors.1969.75"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230110206","volume":"11","author":"F.H. Cullen","year":"1981","unstructured":"Cullen, F.H., Jarvis, J.J., Ratliff, H.D.: Set partitioning based heuristics for interactive routing. Networks\u00a011(2), 125\u2013143 (1981)","journal-title":"Networks"},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.orl.2013.07.007","volume":"41","author":"D.R. Gaur","year":"2013","unstructured":"Gaur, D.R., Mudgal, A., Singh, R.R.: Routing vehicles to minimize fuel consumption. Operations Research Letters\u00a041(6), 576\u2013580 (2013)","journal-title":"Operations Research Letters"},{"key":"25_CR12","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655\u2013664. Society for Industrial and Applied Mathematics (January 2003)"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D. Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks\u00a044(3), 216\u2013229 (2004)","journal-title":"Networks"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column generation, GERAD 25th Anniversary Series, ch. 2, pp. 33\u201365. Springer (2005)","DOI":"10.1007\/0-387-25486-2_2"},{"key":"25_CR16","first-page":"85","volume-title":"Vehicle Routing Problem","author":"\u0130. Kara","year":"2008","unstructured":"Kara, \u0130., Kara, B.Y., Yeti\u015f, M.K.: Cumulative Vehicle Routing Problems. In: Caric, T., Gold, H. (eds.) Vehicle Routing Problem, pp. 85\u201398. I-Tech Education and Publishing KG, Vienna (2008)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-73556-4_9","volume-title":"Combinatorial Optimization and Applications","author":"\u0130. Kara","year":"2007","unstructured":"Kara, \u0130., Kara, B.Y., Yetis, M.K.: Energy Minimizing Vehicle Routing Problem. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 62\u201371. Springer, Heidelberg (2007)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Lysgaard, J., Wohlk, S.: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. European Journal of Operational Research (August 2013)","DOI":"10.1016\/j.ejor.2013.08.032"},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"25_CR20","unstructured":"Rinaldi, G., Yarrow, L.: Optimizing a 48-city traveling salesman problem: A case study in combinatorial problem solving, New York University, Graduate School of Business Administration (1985)"},{"issue":"1-4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"L.M. Rousseau","year":"2004","unstructured":"Rousseau, L.M., Gendreau, M., Pesant, G., Focacci, F.: Solving VRPTWs with constraint programming based column generation. Annals of Operations Research\u00a0130(1-4), 199\u2013216 (2004)","journal-title":"Annals of Operations Research"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.10.030","volume":"193","author":"B. Sahin","year":"2009","unstructured":"Sahin, B., Yilmaz, H., Ust, Y., Guneri, A.F., Gulsun, B.: An approach for analyzing transportation costs and a case study. European Journal of Operational Research\u00a0193, 1\u201311 (2009)","journal-title":"European Journal of Operational Research"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM (2001)","DOI":"10.1137\/1.9780898718515"},{"key":"25_CR24","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)"},{"key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"D.P. Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)","edition":"1"},{"issue":"7","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","volume":"39","author":"Y. Xiao","year":"2012","unstructured":"Xiao, Y., Zhao, Q., Kaku, I., Xu, Y.: Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Computers & Operations Research\u00a039(7), 1419\u20131431 (2012)","journal-title":"Computers & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:58:54Z","timestamp":1559091534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}