{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T07:56:08Z","timestamp":1781164568417,"version":"3.54.1"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T00:00:00Z","timestamp":1256947200000},"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":[[2010,3]]},"DOI":"10.1007\/s10479-009-0651-z","type":"journal-article","created":{"date-parts":[[2009,10,29]],"date-time":"2009-10-29T23:30:11Z","timestamp":1256859011000},"page":"159-175","source":"Crossref","is-referenced-by-count":182,"title":["Combinatorial optimization and Green Logistics"],"prefix":"10.1007","volume":"175","author":[{"given":"Abdelkader","family":"Sbihi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard W.","family":"Eglese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,10,31]]},"reference":[{"key":"651_CR1","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1002\/net.3230190702","volume":"19","author":"Y. Agarwal","year":"1989","unstructured":"Agarwal, Y., Mathur, K., & Salkin, H. M. (1989). A set-partitioning-based exact algorithm for the vehicle routing problem. Networks, 19, 731\u2013749.","journal-title":"Networks"},{"key":"651_CR2","doi-asserted-by":"crossref","first-page":"3423","DOI":"10.1016\/j.cor.2005.02.012","volume":"33","author":"U. F. Aminu","year":"2006","unstructured":"Aminu, U. F., & Eglese, R. W. (2006). A constraint programming approach to the Chinese postman problem with time windows. Computers & Operations Research, 33, 3423\u20133431.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"651_CR3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/03602559909351599","volume":"38","author":"J. C. Ammons","year":"1999","unstructured":"Ammons, J. C., Realff, M. J., & Newton, D. (1999). Carpet recycling: Determining the reverse production system design. Journal of Polymer-Plastics Technology and Engineering, 38(3), 547\u2013567.","journal-title":"Journal of Polymer-Plastics Technology and Engineering"},{"issue":"7","key":"651_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1057\/palgrave.jors.2601743","volume":"55","author":"C. Archetti","year":"2004","unstructured":"Archetti, C., & Speranza, M. G. (2004). Vehicle routing in the 1-skip collection problem. Journal of the Operational Research Society, 55(7), 717\u2013727.","journal-title":"Journal of the Operational Research Society"},{"key":"651_CR5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/net.20091","volume":"47","author":"R. Baldacci","year":"2006","unstructured":"Baldacci, R., & Maniezzo, V. (2006). Exact methods based on node-routing formulations for undirected arc-routing problems. Networks, 47, 52\u201360.","journal-title":"Networks"},{"issue":"2","key":"651_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0377-2217(98)00093-9","volume":"110","author":"A. I. Barros","year":"1998","unstructured":"Barros, A. I., Dekker, R., & Scholten, V. (1998). A two-level network for recycling sand: A\u00a0case study. European Journal of Operational Research, 110(2), 199\u2013214.","journal-title":"European Journal of Operational Research"},{"key":"651_CR7","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","volume":"33","author":"J.-M. Belenguera","year":"2006","unstructured":"Belenguera, J.-M., Benavent, E., Lacomme, P., & Prins, C. (2006). Lower and upper bounds for the mixed capacitated arc routing problem. Computers & Operations Research, 33, 3363\u20133383.","journal-title":"Computers & Operations Research"},{"key":"651_CR8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E. Benavent","year":"1992","unstructured":"Benavent, E., Campos, V., & Corber\u00e1n, A. (1992). The capacitated arc routing problem: Lower bounds. Networks, 22, 669\u2013690.","journal-title":"Networks"},{"key":"651_CR9","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","volume":"147","author":"P. Beullens","year":"2003","unstructured":"Beullens, P., Muyldermans, L., Cattrysse, D., & Van Oudheusden, D. (2003). A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research, 147, 629\u2013643.","journal-title":"European Journal of Operational Research"},{"key":"651_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1287\/trsc.34.3.271.12301","volume":"34","author":"L. Bodin","year":"2000","unstructured":"Bodin, L., Mingozzi, A., Baldacci, R., & Ball, M. (2000). The rollon-rolloff vehicle routing problem. Transportation Science, 34, 271\u2013288.","journal-title":"Transportation Science"},{"key":"651_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9309-2","volume-title":"The logic of logistics: Theory, algorithms, and applications for logistics management","author":"J. Bramel","year":"1997","unstructured":"Bramel, J., & Simchi-Levi, D. (1997). The logic of logistics: Theory, algorithms, and applications for logistics management. Berlin: Springer."},{"key":"651_CR12","unstructured":"Brand\u00e3o, J., & Eglese, R. W. (2006, forthcoming). A\u00a0deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research. doi: 10.106\/j.cor.2006.07.007 ."},{"issue":"5","key":"651_CR13","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.tre.2005.01.003","volume":"42","author":"H. K. Chen","year":"2005","unstructured":"Chen, H. K., Hsueh, C. F., & Chang, M. S. (2005). The real-time time-dependent vehicle routing problem. Transportation Research Part\u00a0E, Logistics and Transportation Review, 42(5), 383\u2013408.","journal-title":"Transportation Research Part\u00a0E, Logistics and Transportation Review"},{"issue":"2","key":"651_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10845-004-5892-8","volume":"16","author":"F. Chu","year":"2005","unstructured":"Chu, F., Labadi, N., & Prins, C. (2005). Heuristics for the periodic capacitated arc routing problem. Journal of Intelligent Manufacturing, 16(2), 243\u2013251.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"651_CR15","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.ejor.2004.08.017","volume":"169","author":"F. Chu","year":"2006","unstructured":"Chu, F., Labadi, N., & Prins, C. (2006). A\u00a0scatter search for the periodic capacitated arc routing problem. European Journal of Operational Research, 169(2), 586\u2013605.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"651_CR16","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568\u2013581.","journal-title":"Operations Research"},{"key":"651_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/0-387-24977-X_9","volume-title":"Logistics systems: Design and optimization","author":"J.-F. Cordeau","year":"2005","unstructured":"Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2005). New heuristics for the vehicle routing problem. In A. Langevin & D. Riopel (Eds.), Logistics systems: Design and optimization (pp.\u00a0279\u2013297). New York: Springer."},{"key":"651_CR18","first-page":"145","volume-title":"Metaheuristic optimization via memory and evolution: Tabu search and scatter search","author":"J.-F. Cordeau","year":"2004","unstructured":"Cordeau, J.-F., & Laporte, G. (2004). Tabu search heuristics for the vehicle routing problem. In C. Rego & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution: Tabu search and scatter search (pp.\u00a0145\u2013163). Boston: Kluwer."},{"key":"651_CR19","first-page":"81","volume":"6","author":"G. B. Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. M. (1959). The truck dispatching problem. Management Science, 6, 81\u201391.","journal-title":"Management Science"},{"key":"651_CR20","series-title":"Erasmus research institute series","volume-title":"Inventory management with returns: the impact of misinformation","author":"M. P. Brito De","year":"2003","unstructured":"De Brito, M. P., & Van\u00a0Der Laan, E. A. (2003). Inventory management with returns: the impact of misinformation. Erasmus research institute series. Rotterdam: Erasmus University Rotterdam."},{"key":"651_CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1057\/palgrave.jors.2600325","volume":"48","author":"L. Meulemeester De","year":"1997","unstructured":"De Meulemeester, L., Laporte, G., Louveaux, F. V., & Semet, F. (1997). Optimal sequencing of skip collections and deliveries. Journal of Operational Research Society, 48, 57\u201364.","journal-title":"Journal of Operational Research Society"},{"key":"651_CR22","volume-title":"Reverse logistics: Quantitative models for closed-loop supply chains","year":"2004","unstructured":"Dekker, R., Fleischmann, M., Inderfurth, K., & Van Wassenhove, L. N. (Eds.) (2004). Reverse logistics: Quantitative models for closed-loop supply chains. Berlin: Springer."},{"issue":"5","key":"651_CR23","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1080\/002075400189031","volume":"38","author":"N. Dellaert","year":"2000","unstructured":"Dellaert, N., & Jeunet, J. (2000). Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. International Journal of Production Research, 38(5), 1083\u20131099.","journal-title":"International Journal of Production Research"},{"key":"651_CR24","unstructured":"Donati, A., Gambardella, L., Casagrande, N., Rizzoli, A., & Montemanni, R. (2003). Time dependent vehicle routing problem with an ant colony system (Internal IDSIA report, IDSIA-02-03)."},{"issue":"3","key":"651_CR25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/inte.30.3.143.11670","volume":"30","author":"S. Dowlatshahi","year":"2000","unstructured":"Dowlatshahi, S. (2000). Developing a theory of reverse logistics. Interfaces, 30(3), 143\u2013155.","journal-title":"Interfaces"},{"key":"651_CR26","volume-title":"Arc routing: Theory solutions and applications","year":"2000","unstructured":"Dror, M. (Ed.) (2000). Arc routing: Theory solutions and applications. Boston: Kluwer."},{"key":"651_CR27","first-page":"633","volume-title":"Metaheuristics: Theory and applications","author":"R. W. Eglese","year":"1996","unstructured":"Eglese, R. W., & Li, L. Y. O. (1996). A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In I. H. Osman & J. P. Kelly (Eds.), Metaheuristics: Theory and applications (pp.\u00a0633\u2013650). Dordrecht: Kluwer."},{"key":"651_CR28","doi-asserted-by":"crossref","first-page":"3508","DOI":"10.1016\/j.cor.2005.03.029","volume":"33","author":"R. W. Eglese","year":"2006","unstructured":"Eglese, R. W., Maden, W., & Slater, A. (2006). A Road Timetable\u2122 to aid vehicle routing and scheduling. Computers & Operations Research, 33, 3508\u20133519.","journal-title":"Computers & Operations Research"},{"key":"651_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56691-2","volume-title":"Quantitative models for reverse logistics","author":"M. Fleischmann","year":"2001","unstructured":"Fleischmann, M. (2001). Quantitative models for reverse logistics. New York: Springer."},{"key":"651_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00230-0","volume":"103","author":"M. Fleischmann","year":"1997","unstructured":"Fleischmann, M., Bloemhof-Ruwaard, J. M., Dekker, R., Van\u00a0Der Laan, E. A., Van Nunen, J. A. E. E., & Van Wassenhove, L. N. (1997). Quantitative models for reverse logistics: A review. European Journal of Operational Research, 103, 1\u201317.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"651_CR31","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/S0305-0483(00)00022-0","volume":"28","author":"M. Fleischmann","year":"2000","unstructured":"Fleischmann, M., Krikke, H. R., Dekker, R., & Flapper, S. D. P. (2000). A characterisation of logistics networks for product recovery. OMEGA\u2014International Journal of Management Science, 28(6), 653\u2013666.","journal-title":"OMEGA\u2014International Journal of Management Science"},{"issue":"1","key":"651_CR32","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/03081060008717659","volume":"24","author":"L. P. Fu","year":"2000","unstructured":"Fu, L. P., & Rilett, L. R. (2000). Estimation of time-dependent, stochastic route travel times using artificial neural networks. Transportation Planning and Technology, 24(1), 25\u201348.","journal-title":"Transportation Planning and Technology"},{"issue":"3","key":"651_CR33","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Poggi de\u00a0Arag\u00e3o, M., Reis, M., Uchoa, E., & Werneck, R. F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming, Series\u00a0A and\u00a0B, 106(3), 491\u2013511.","journal-title":"Mathematical Programming, Series\u00a0A and\u00a0B"},{"key":"651_CR34","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9780898718515.ch6","volume-title":"The vehicle routing problem","author":"M. Gendreau","year":"2002","unstructured":"Gendreau, M., Laporte, G., & Potvin, J.-Y. (2002). Metaheuristics for the capacitated VRP. In P. Toth & D. Vigo (Eds.), The vehicle routing problem. SIAM monographs on discrete mathematics and applications (pp.\u00a0129\u2013154). Philadelphia: SIAM."},{"key":"651_CR35","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0377-2217(97)00188-4","volume":"104","author":"I. Giannikos","year":"1998","unstructured":"Giannikos, I. (1998). A multi-objective programming model for locating treatment sites and routing hazardous wastes. European Journal of Operational Research, 104, 333\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"651_CR36","volume-title":"Vehicle routing: Methods and studies","author":"B. L. Golden","year":"1988","unstructured":"Golden, B. L., & Assad, A. A. (1988). Vehicle routing: Methods and studies. Amsterdam: North-Holland."},{"key":"651_CR37","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B. L. Golden","year":"1981","unstructured":"Golden, B. L., & Wong, R. T. (1981). Capacitated arc routing problems. Networks, 11, 305\u2013315.","journal-title":"Networks"},{"issue":"1","key":"651_CR38","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"B. L. Golden","year":"1983","unstructured":"Golden, B. L., De Armon, J. S., & Baker, E. K. (1983). Computational experiments with algorithms for a class of routing problems. Computers & Operations Research, 10(1), 47\u201359.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"651_CR39","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0360-8352(02)00178-X","volume":"44","author":"P. Greistorfer","year":"2003","unstructured":"Greistorfer, P. (2003). A tabu scatter search metaheuristic for the arc routing problem. Computers and Industrial Engineering, 44(2), 249\u2013266.","journal-title":"Computers and Industrial Engineering"},{"issue":"11","key":"651_CR40","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","volume":"32","author":"A. Haghani","year":"2005","unstructured":"Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers & Operations Research, 32(11), 2959\u20132986.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"651_CR41","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A. Hertz","year":"2000","unstructured":"Hertz, A., Laporte, G., & Mittaz, M. (2000). A tabu search heuristic for the capacitated arc routing problem. Operations Research, 48(1), 129\u2013135.","journal-title":"Operations Research"},{"key":"651_CR42","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A. Hertz","year":"2001","unstructured":"Hertz, A., Laporte, G., & Mittaz, M. (2001). A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science, 35, 425\u2013434.","journal-title":"Transportation Science"},{"key":"651_CR43","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S1366-5545(02)00020-0","volume":"38","author":"T.-L. Hu","year":"2002","unstructured":"Hu, T.-L., Sheu, J.-B., & Huang, K.-H. (2002). A reverse logistics cost minimization model for the treatment of hazardous wastes. Transportation Research, Part\u00a0E, Logistics and Transportation Review, 38, 457\u2013473.","journal-title":"Transportation Research, Part\u00a0E, Logistics and Transportation Review"},{"issue":"5","key":"651_CR44","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1057\/palgrave.jors.2600716","volume":"50","author":"V. Jayaraman","year":"1999","unstructured":"Jayaraman, V., Guide, Jr. V. D. R., & Srivastava, R. (1999). A closed-loop logistics model for remanufacturing. Journal of the Operational Research Society, 50(5), 497\u2013508.","journal-title":"Journal of the Operational Research Society"},{"key":"651_CR45","volume-title":"Operations research in production planning, scheduling, and inventory control","author":"L. A. Johnson","year":"1974","unstructured":"Johnson, L. A., & Montgomery, D. C. (1974). Operations research in production planning, scheduling, and inventory control. New York: Wiley."},{"key":"651_CR46","unstructured":"Krikke, H. R. (1998). Recovery strategies and reverse logistic network design. Thesis, University of Twente, Enschede, The Netherlands."},{"issue":"3","key":"651_CR47","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s002910050095","volume":"21","author":"H. R. Krikke","year":"1999","unstructured":"Krikke, H. R., Van Harten, A., & Schuur, P. C. (1999). Business case Oc\u00e9: reverse logistic network re-design for copiers. OR Spektrum, 21(3), 381\u2013409.","journal-title":"OR Spektrum"},{"key":"651_CR48","unstructured":"Krikke, H. R., Bloemhof-Ruwaard, J., & Van Wassenhove, L. (2001). Design of closed loop supply chains: A\u00a0production and return network for refrigerators (Erim Report Series Research in Management, Ers-2001-45-Lis)."},{"issue":"2","key":"651_CR49","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1108\/09600039510083934","volume":"25","author":"L. Kroon","year":"1995","unstructured":"Kroon, L., & Vrijens, G. (1995). Returnable containers: An example of reverse logistics. International Journal of Physical Distribution and Logistics Management, 25(2), 56\u201368.","journal-title":"International Journal of Physical Distribution and Logistics Management"},{"key":"651_CR50","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1007\/3-540-36970-8_39","volume-title":"Proceedings evolutionary multi-criterion optimization: Second international conference, EMO 2003","author":"P. Lacomme","year":"2003","unstructured":"Lacomme, P., Prins, C., & Sevaux, M. (2003). Multiobjective capacitated arc routing problem. In C. Fonseca, P. J. Fleming, E. Zitzler, & T. Thiele (Eds.), LNCS : Vol.\u00a02632. Proceedings evolutionary multi-criterion optimization: Second international conference, EMO 2003, Faro, Portugal, 8\u201311 April 2003 (pp. 550\u2013564). Berlin: Springer."},{"issue":"1\u20134","key":"651_CR51","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P. Lacomme","year":"2004","unstructured":"Lacomme, P., Prins, C., & Ramdane-Cherif, W. (2004). Competitive memetic algorithms for arc routing problems. Annals of Operations Research, 131(1\u20134), 159\u2013185.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"651_CR52","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","volume":"165","author":"P. Lacomme","year":"2005","unstructured":"Lacomme, P., Prins, C., & Ramdane-Cherif, W. (2005). Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research, 165(2), 535\u2013553.","journal-title":"European Journal of Operational Research"},{"key":"651_CR53","first-page":"147","volume":"31","author":"G. Laporte","year":"1987","unstructured":"Laporte, G., & Nobert, Y. (1987). Exact algorithms for the vehicle routing problem. Annals of Discrete Mathematics, 31, 147\u2013184.","journal-title":"Annals of Discrete Mathematics"},{"key":"651_CR54","series-title":"SIAM Monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The vehicle routing problem","author":"G. Laporte","year":"2002","unstructured":"Laporte, G., & Semet, F. (2002). Classical heuristics for the capacitated VRP. In P. Toth & D. Vigo (Eds.), The vehicle routing problem. SIAM Monographs on discrete mathematics and applications (pp.\u00a0109\u2013128). Philadelphia: SIAM."},{"key":"651_CR55","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H. Longo","year":"2006","unstructured":"Longo, H., Poggi de\u00a0Arag\u00e3o, M., & Uchoa, E. (2006). Solving capacitated arc routing problems using a transformation to the CVRP. Computers & Operations Research, 33, 1823\u20131837.","journal-title":"Computers & Operations Research"},{"key":"651_CR56","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J. Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A. N., & Eglese, R. W. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100, 423\u2013445.","journal-title":"Mathematical Programming"},{"key":"651_CR57","unstructured":"Maden, W. (2006). Models and heuristics algorithms for complex routing and scheduling problems. Ph.D\u00a0dissertation, Department of Management Science, Lancaster University Management School, UK."},{"issue":"3","key":"651_CR58","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C. Malandraki","year":"1992","unstructured":"Malandraki, C., & Daskin, M. S. (1992). Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Science, 26(3), 185\u2013200.","journal-title":"Transportation Science"},{"issue":"7\/8","key":"651_CR59","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/S0305-0548(97)00094-4","volume":"25","author":"R. Mansini","year":"1998","unstructured":"Mansini, R., & Speranza, M. G. (1998). A linear programming model for the separate refuse collection service. Computers & Operations Research, 25(7\/8), 659\u2013673.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"651_CR60","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0377-2217(97)00192-6","volume":"104","author":"A. Mar\u00ecn","year":"1998","unstructured":"Mar\u00ecn, A., & Pelegr\u00ecn, B. (1998). The return plant location problem: Modelling and resolution. European Journal of Operational Research, 104(2), 375\u2013392.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"651_CR61","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/inte.27.6.69","volume":"27","author":"S. V. Mondschein","year":"1997","unstructured":"Mondschein, S. V., & Schilkrut, A. (1997). Optimal investment policies for pollution control in the copper industry. Interfaces, 27(6), 69\u201387.","journal-title":"Interfaces"},{"key":"651_CR62","first-page":"219","volume-title":"New ideas in optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P. (1999). Memetic algorithms: A short introduction. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp.\u00a0219\u2013234). New York: McGraw-Hill."},{"key":"651_CR63","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(99)00045-4","volume":"121","author":"M. C. Mour\u00e3o","year":"2000","unstructured":"Mour\u00e3o, M. C., & Almeida, T. (2000). Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. European Journal of Operational Research, 121, 420\u2013434.","journal-title":"European Journal of Operational Research"},{"key":"651_CR64","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1061\/(ASCE)1090-025X(2003)7:2(69)","volume":"7","author":"A. K. Nema","year":"1999","unstructured":"Nema, A. K., & Gupta, S. K. (1999). Multiobjective risk analysis and optimization of regional hazardous waste management system. Practice Periodical of Hazardous, Toxic and Radioactive Waste Management, 7, 69\u201377.","journal-title":"Practice Periodical of Hazardous, Toxic and Radioactive Waste Management"},{"key":"651_CR65","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0956-053X(99)00241-X","volume":"19","author":"A. K. Nema","year":"2003","unstructured":"Nema, A. K., & Gupta, S. K. (2003). Optimization of regional hazardous waste management systems: an improved formulation. Waste Management, 19, 441\u2013451.","journal-title":"Waste Management"},{"key":"651_CR66","unstructured":"OR\/MS Today (2006). Vehicle routing software survey. http:\/\/www.lionhrtpub.com\/orms\/surveys\/Vehicle_Routing\/vrss.html ."},{"key":"651_CR67","unstructured":"Palmer, A. (2004). The environmental implications of grocery home delivery. Centre for Logistics and Supply Chain Management, Cranfield University, ELA Doctorate Workshop."},{"key":"651_CR68","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0305-0548(87)90065-7","volume":"14","author":"W. L. Pearn","year":"1987","unstructured":"Pearn, W. L., Assad, A., & Golden, B. L. (1987). Transforming arc routing into node routing problems. Computers & Operations Research, 14, 285\u2013288.","journal-title":"Computers & Operations Research"},{"issue":"EE5","key":"651_CR69","first-page":"1014","volume":"108","author":"J. J. Peirce","year":"1982","unstructured":"Peirce, J. J., & Davidson, G. M. (1982). Linear programming in hazardous waste management. Journal Environmental Engineering, 108(EE5), 1014\u20131026.","journal-title":"Journal Environmental Engineering"},{"key":"651_CR70","unstructured":"Pronello, C., & Andr\u00e9, M. (2000). Pollutant emissions estimation in road transport models (INRETS-LTE Report, Vol. 2007)."},{"key":"651_CR71","volume-title":"Going backwards: Reverse logistics trends and practices","author":"D. S. Rogers","year":"1999","unstructured":"Rogers, D. S., & Tibben-Lembke, R. S. (1999). Going backwards: Reverse logistics trends and practices. Pittsburgh: Reverse Logistics Executive Council (RLEC)."},{"issue":"1","key":"651_CR72","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/inte.1040.0109","volume":"35","author":"S. Sahoo","year":"2005","unstructured":"Sahoo, S., Kim, S., Kim, B., Kraas, B., & Popov, A. (2005). Routing optimization for waste management. Interfaces, 35(1), 24\u201336.","journal-title":"Interfaces"},{"key":"651_CR73","volume-title":"Greener manufacturing and operations from design to delivery and back","author":"J. Sarkis","year":"2001","unstructured":"Sarkis, J. (2001). Greener manufacturing and operations from design to delivery and back. Sheffield: Greenleaf."},{"issue":"2","key":"651_CR74","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10288-007-0047-3","volume":"5","author":"A. Sbihi","year":"2007","unstructured":"Sbihi, A., & Eglese, R. W. (2007). Combinatorial optimization and Green logistics. 4OR: A\u00a0Quarterly Journal of Operations Research, 5(2), 99\u2013116.","journal-title":"4OR: A\u00a0Quarterly Journal of Operations Research"},{"key":"651_CR75","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1061\/(ASCE)1090-025X(2003)7:2(78)","volume":"7","author":"L. H. Shih","year":"2003","unstructured":"Shih, L. H., & Lin, Y. T. (2003). Multicriteria optimization for infectious medical waste collection system planning. Practice Periodical of Hazardous, Toxic and Radioactive Waste Management, 7, 78\u201385.","journal-title":"Practice Periodical of Hazardous, Toxic and Radioactive Waste Management"},{"key":"651_CR76","first-page":"64","volume":"14","author":"E. A. Silver","year":"1973","unstructured":"Silver, E. A., & Meal, H. C. (1973). A heuristic for selecting lot size requirements for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production and Inventory Management, 14, 64\u201374.","journal-title":"Production and Inventory Management"},{"key":"651_CR77","volume-title":"Inventory management and production planning and scheduling","author":"E. A. Silver","year":"1996","unstructured":"Silver, E. A., Pyke, D. F., & Peterson, R. (1996). Inventory management and production planning and scheduling (3\u00a0ed.). New York: Wiley.","edition":"3"},{"issue":"2","key":"651_CR78","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0377-2217(96)00200-7","volume":"97","author":"T. Spengler","year":"1997","unstructured":"Spengler, T., Piichert, H., Penkuhn, T., & Rentz, O. (1997). Environmental integrated production and recycling management. European Journal of Operational Research, 97(2), 308\u2013326.","journal-title":"European Journal of Operational Research"},{"key":"651_CR79","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/S0377-2217(03)00379-5","volume":"158","author":"J. Teixeira","year":"2004","unstructured":"Teixeira, J., Antunes, A. P., & de Sousa, J. P. (2004). Recyclable waste collection planning: a case study. European Journal of Operational Research, 158, 543\u2013554.","journal-title":"European Journal of Operational Research"},{"issue":"20","key":"651_CR80","doi-asserted-by":"crossref","first-page":"4377","DOI":"10.1080\/00207540600693564","volume":"44","author":"R. H. Teunter","year":"2006","unstructured":"Teunter, R. H., Bayindir, Z. P., & Van\u00a0Den Heuvel, W. (2006). Dynamic lot sizing with product returns and remanufacturing. International Journal of Production Research, 44(20), 4377\u20134400.","journal-title":"International Journal of Production Research"},{"key":"651_CR81","series-title":"SIAM monographs on discrete mathematics and applications","volume-title":"The vehicle routing problem","author":"P. Toth","year":"2001","unstructured":"Toth, P., & Vigo, D. (2001). The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia: SIAM."},{"key":"651_CR82","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G. Ulusoy","year":"1985","unstructured":"Ulusoy, G. (1985). The fleet size and mix problem for capacitated arc routing. European Journal of Operational Research, 22, 329\u2013337.","journal-title":"European Journal of Operational Research"},{"key":"651_CR83","unstructured":"Van\u00a0Den Heuvel, W. (2004). On the complexity of the economic lot-sizing problem with remanufacturing options (Econometric Institute report. Technical Report EI 2004-46). Econometric Institute, Erasmus University Rotterdam, The Netherlands."},{"key":"651_CR84","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H. M. Wagner","year":"1958","unstructured":"Wagner, H. M., & Whitin, T. M. (1958). A dynamic version of the economic lot size model. Management Science, 5, 86\u201396.","journal-title":"Management Science"},{"key":"651_CR85","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0959-6526(02)00066-5","volume":"11","author":"C. D. White","year":"2003","unstructured":"White, C. D., Masnet, E., Meisner Rosen, C., & Beckman, S. L. (2003). Product recovery with some byte: an\u00a0overview of management challenges and environmental consequences in reverse manufacturing for the computer industry. Journal of Cleaner Production, 11, 445\u2013458.","journal-title":"Journal of Cleaner Production"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0651-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0651-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0651-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:57Z","timestamp":1559138877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0651-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,31]]},"references-count":85,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0651-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,31]]}}}