{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T04:48:14Z","timestamp":1779252494662,"version":"3.51.4"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,6,25]]},"DOI":"10.1007\/s10288-007-0047-3","type":"journal-article","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T05:36:51Z","timestamp":1180589811000},"page":"99-116","source":"Crossref","is-referenced-by-count":174,"title":["Combinatorial optimization and Green Logistics"],"prefix":"10.1007","volume":"5","author":[{"given":"Abdelkader","family":"Sbihi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard W.","family":"Eglese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,1]]},"reference":[{"key":"47_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 HM (1989) A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19:731\u2013749","journal-title":"Networks"},{"key":"47_CR2","doi-asserted-by":"crossref","first-page":"3423","DOI":"10.1016\/j.cor.2005.02.012","volume":"33","author":"UF Aminu","year":"2006","unstructured":"Aminu UF, Eglese RW (2006) A constraint programming aproach to the Chinese Postman problem with time windows. Comput Oper Res 33:3423-3431","journal-title":"Comput Oper Res"},{"issue":"3","key":"47_CR3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/03602559909351599","volume":"38","author":"JC Ammons","year":"1999","unstructured":"Ammons JC, Realff MJ, Newton D (1999) Carpet recycling: determining the reverse production system design. J PolymPlast Technol Eng 38(3):547\u2013567","journal-title":"J PolymPlast Technol Eng"},{"issue":"7","key":"47_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 MG (2004) Vehicle routing in the 1-skip collection problem. J Oper Res Soc 55(7):717\u2013727","journal-title":"J Oper Res Soc"},{"key":"47_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":"47_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0377-2217(98)00093-9","volume":"110","author":"AI Barros","year":"1998","unstructured":"Barros AI, Dekker R, Scholten V (1998) A two-level network for recycling sand: a case study. Eur J Oper Res 110(2):199\u2013214","journal-title":"Eur J Oper Res"},{"key":"47_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, Benaventa E, Lacomme P, Prins C (2006) Lower and upper bounds for the mixed capacitated arc routing problem. Comput Oper Res 33:3363\u20133383","journal-title":"Comput Oper Res"},{"key":"47_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":"47_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. Eur J Oper Res 147:629\u2013643","journal-title":"Eur J Oper Res"},{"key":"47_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. Transport Sci 34:271\u2013288","journal-title":"Transport Sci"},{"key":"47_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. Springer, Berlin"},{"key":"47_CR12","unstructured":"Brand\u00e3o J, Eglese RW (2006) A deterministic tabu search algorithm for the capacitated arc routing problem. Comput Oper Res (in press) doi: 10.106\/j.cor.2006.07.007"},{"key":"47_CR13","unstructured":"De Brito MP, Van Der Laan EA (2003) Inventory management with returns: the impact of misinformation. Erasmus research institute series, Erasmus University Rotterdam, Rotterdam, The Netherlands"},{"issue":"5","key":"47_CR14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.tre.2005.01.003","volume":"42","author":"H-K Chen","year":"2006","unstructured":"Chen H-K, Hsueh C-F, Chang M-S (2006) The real-time time-dependent vehicle routing problem. Transp Res Part E: Logist Transp Rev 42(5):383\u2013408","journal-title":"Transp Res Part E: Logist Transp Rev"},{"issue":"2","key":"47_CR15","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. J Intell Manufact 16(2):243\u2013251","journal-title":"J Intell Manufact"},{"issue":"2","key":"47_CR16","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 scatter search for the periodic capacitated arc routing problem. Eur J Oper Res 169(2):586\u2013605","journal-title":"Eur J Oper Res"},{"issue":"4","key":"47_CR17","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 JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"key":"47_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: Rego C, Alidaee B (eds) Metaheuristic optimization via memory and evolution: tabu search and scatter search. Kluwer, Boston, pp 145\u2013163"},{"key":"47_CR19","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: Langevin A, Riopel D (eds) Logistics systems: design and optimization. Springer, New York, pp 279\u2013297"},{"key":"47_CR20","first-page":"81","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JM (1959) The truck dispatching problem. Manag Sci 6:81\u201391","journal-title":"Manag Sci"},{"key":"47_CR21","volume-title":"Reverse logistics: quantitative models for closed-loop supply chains","year":"2004","unstructured":"Dekker R, Fleischmann M, Inderfurth K, Van Wassenhove LN (eds), (2004) Reverse logistics: quantitative models for closed-loop supply chains. Springer, Berlin"},{"issue":"5","key":"47_CR22","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. Int J Prod Res 38(5):1083\u20131099","journal-title":"Int J Prod Res"},{"key":"47_CR23","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":"47_CR24","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":"47_CR25","volume-title":"Arc routing: theory solutions and applications","year":"2000","unstructured":"Dror M (ed) (2000) Arc routing: theory solutions and applications. Kluwer, Boston"},{"key":"47_CR26","first-page":"633","volume-title":"Metaheuristics: theory and applications.","author":"RW Eglese","year":"1996","unstructured":"Eglese RW, Li LYO (1996) A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In: Osman IH, Kelly JP (eds), Metaheuristics: theory and applications. Kluwer, Boston, pp 633\u2013650"},{"key":"47_CR27","doi-asserted-by":"crossref","first-page":"3508","DOI":"10.1016\/j.cor.2005.03.029","volume":"33","author":"RW Eglese","year":"2006","unstructured":"Eglese RW, Maden W, Slater A (2006) A road timetable\u2122 to aid vehicle routing and scheduling. Comput Oper Res 33:3508\u20133519","journal-title":"Comput Oper Res"},{"key":"47_CR28","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. Springer, New York"},{"key":"47_CR29","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 JM, Dekker R, Van Der Laan EA, Van Nunen JAEE, Van Wassenhove LN (1997) Quantitative models for reverse logistics: a review. Eur J Oper Res 103:1\u201317","journal-title":"Eur J Oper Res"},{"issue":"6","key":"47_CR30","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 HR, Dekker R, Flapper SDP (2000) A characterisation of logistics networks for product recovery. OMEGA Int J Manag Sci 28(6):653\u2013666","journal-title":"OMEGA Int J Manag Sci"},{"issue":"1","key":"47_CR31","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/03081060008717659","volume":"24","author":"LP Fu","year":"2000","unstructured":"Fu LP, Rilett LR (2000) Estimation of time-dependent, stochastic route travel times using artificial neural networks. Transport Plan Technol 24(1):25\u201348","journal-title":"Transport Plan Technol"},{"issue":"3","key":"47_CR32","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 Arag\u00e3o M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program Ser A B 106(3):491\u2013511","journal-title":"Math Program Ser A B"},{"key":"47_CR33","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: Toth P, Vigo D (eds) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 129\u2013154"},{"key":"47_CR34","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. Eur J Oper Res 104:333\u2013342","journal-title":"Eur J Oper Res"},{"key":"47_CR35","volume-title":"Vehicle routing: methods and studies","author":"BL Golden","year":"1988","unstructured":"Golden BL, Assad AA (1988) Vehicle routing: methods and studies. North-Holland, Amsterdam"},{"key":"47_CR36","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"BL Golden","year":"1981","unstructured":"Golden BL, Wong RT (1981) Capacitated arc routing problems. Networks 11:305\u2013315","journal-title":"Networks"},{"issue":"1","key":"47_CR37","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"BL Golden","year":"1983","unstructured":"Golden BL, de Armon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput Oper Res 10(1):47\u201359","journal-title":"Comput Oper Res"},{"issue":"2","key":"47_CR38","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. Comput Ind Eng 44(2):249\u2013266","journal-title":"Comput Ind Eng"},{"issue":"11","key":"47_CR39","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. Comput Oper Res 32(11):2959\u20132986","journal-title":"Comput Oper Res"},{"issue":"1","key":"47_CR40","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. Oper Res 48(1):129\u2013135","journal-title":"Oper Res"},{"key":"47_CR41","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. Transport Sci 35:425\u2013434","journal-title":"Transport Sci"},{"key":"47_CR42","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. Transport Res Part E Logist Transport Rev 38:457\u2013473","journal-title":"Transport Res Part E Logist Transport Rev"},{"issue":"5","key":"47_CR43","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1057\/palgrave.jors.2600716","volume":"50","author":"V Jayaraman","year":"1999","unstructured":"Jayaraman V, Guide VDR Jr, Srivastava R (1999) A closed-loop logistics model for remanufacturing. J Oper Res Soc 50(5):497\u2013508","journal-title":"J Oper Res Soc"},{"key":"47_CR44","volume-title":"Operations research in production planning, scheduling, and inventory control","author":"LA Johnson","year":"1974","unstructured":"Johnson LA, Montgomery DC (1974) Operations research in production planning, scheduling, and inventory control. Wiley, New York"},{"key":"47_CR45","unstructured":"Krikke HR (1998) Recovery strategies and reverse logistic network design. Thesis, University of Twente, Enschede, The Netherlands"},{"issue":"3","key":"47_CR46","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s002910050095","volume":"21","author":"HR Krikke","year":"1999","unstructured":"Krikke HR, Van Harten A, Schuur PC (1999) Business case Oc\u00e9: reverse logistic network re-design for copiers. OR Spektrum 21(3):381\u2013409","journal-title":"OR Spektrum"},{"key":"47_CR47","unstructured":"Krikke HR, Bloemhof-Ruwaard J, Van Wassenhove L (2001) Design of closed loop supply chains: a production and return network for refrigerators. Erim report series research in management, Ers-2001-45-Lis"},{"issue":"2","key":"47_CR48","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. Int J Phys Distrib Logist Manag 25(2):56\u201368","journal-title":"Int J Phys Distrib Logist Manag"},{"key":"47_CR49","doi-asserted-by":"crossref","unstructured":"Lacomme P, Prins C, Sevaux M (2003) Multiobjective capacitated arc routing problem. In: Fonseca C, Fleming PJ, Zitzler E, Thiele T (eds) Proceedings evolutionary multi-criterion optimization: second international conference, EMO 2003, Faro, Portugal, 8\u201311 April 2003, LNCS 2632, pp 550\u2013564, Springer, Berlin","DOI":"10.1007\/3-540-36970-8_39"},{"issue":"1-4","key":"47_CR50","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. Ann Oper Res 131(1-4):159\u2013185","journal-title":"Ann Oper Res"},{"issue":"2","key":"47_CR51","first-page":"535","volume":"165","author":"P Lacomme","year":"2005","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W (2005) Evolutionary algorithms for periodic arc routing problems, Eur J Oper Res 165(2):535\u2013553","journal-title":"Evolutionary algorithms for periodic arc routing problems, Eur J Oper Res"},{"key":"47_CR52","first-page":"147","volume":"31","author":"G Laporte","year":"1987","unstructured":"Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. Ann Discrete Math 31:147\u2013184","journal-title":"Ann Discrete Math"},{"key":"47_CR53","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: Toth P, Vigo D (eds) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 109\u2013128"},{"key":"47_CR54","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 Arag\u00e3o M, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823\u20131837","journal-title":"Comput Oper Res"},{"key":"47_CR55","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 AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100:423\u2013445","journal-title":"Math Program"},{"key":"47_CR56","unstructured":"Maden W (2006) Models and heuristics algorithms for complex routing and scheduling problems. Ph.D. dissertation, Department of Management Science, Lancaster University Management School, UK"},{"issue":"3","key":"47_CR57","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 MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transport Sci 26(3):185\u2013200","journal-title":"Transport Sci"},{"issue":"7\/8","key":"47_CR58","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 MG (1998) A linear programming model for the separate refuse collection service. Comput Oper Res 25(7\/8):659\u2013673","journal-title":"Comput Oper Res"},{"issue":"2","key":"47_CR59","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. Eur J Oper Res 104(2):375\u2013392","journal-title":"Eur J Oper Res"},{"key":"47_CR60","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1057\/palgrave.jors.2600325","volume":"48","author":"L De Meulemeester","year":"1997","unstructured":"De Meulemeester L, Laporte G, Louveaux FV, Semet F (1997) Optimal sequencing of skip collections and deliveries. J Oper Res Soc 48:57\u201364","journal-title":"J Oper Res Soc"},{"issue":"6","key":"47_CR61","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/inte.27.6.69","volume":"27","author":"SV Mondschein","year":"1997","unstructured":"Mondschein SV, Schilkrut A (1997) Optimal investment policies for pollution control in the copper industry. Interfaces 27(6):69\u201387","journal-title":"Interfaces"},{"key":"47_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: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 219\u2013234"},{"key":"47_CR63","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(99)00045-4","volume":"121","author":"MC Mour\u00e3o","year":"2000","unstructured":"Mour\u00e3o MC, Almeida T (2000) Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. Eur J Oper Res 121:420\u2013434","journal-title":"Eur J Oper Res"},{"key":"47_CR64","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1061\/(ASCE)1090-025X(2003)7:2(69)","volume":"7","author":"AK Nema","year":"1999","unstructured":"Nema AK, Gupta SK (1999) Multiobjective risk analysis and optimization of regional hazardous waste management system. Practice Period Hazard Toxic Radioactive Waste Manag 7:69\u201377","journal-title":"Practice Period Hazard Toxic Radioactive Waste Manag"},{"key":"47_CR65","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0956-053X(99)00241-X","volume":"19","author":"AK Nema","year":"2003","unstructured":"Nema AK, Gupta SK (2003) Optimization of regional hazardous waste management systems: an improved formulation. Waste Manag 19:441\u2013451","journal-title":"Waste Manag"},{"key":"47_CR66","unstructured":"OR\/MS Today (2006) Vehicle routing software survey. http:\/\/www.lionhrtpub.com\/orms\/surveys\/ Vehicle_Routing\/vrss.html"},{"key":"47_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":"47_CR68","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0305-0548(87)90065-7","volume":"14","author":"WL Pearn","year":"1987","unstructured":"Pearn WL, Assad A, Golden BL (1987) Transforming arc routing into node routing problems. Comput Oper Res 14:285\u2013288","journal-title":"Comput Oper Res"},{"issue":"EE5","key":"47_CR69","first-page":"1014","volume":"108","author":"JJ Peirce","year":"1982","unstructured":"Peirce JJ, Davidson GM (1982) Linear programming in hazardous waste management. J Environ Eng 108(EE5):1014\u20131026","journal-title":"J Environ Eng"},{"key":"47_CR70","unstructured":"Pronello C, Andr\u00e9 M (2000) Pollutant emissions estimation in road transport models. INRETS-LTE report, vol 2007"},{"key":"47_CR71","unstructured":"Rogers DS, Tibben-Lembke RS (1999) Going backwards: reverse logistics trends and practices. Reverse Logistics Executive Council (RLEC), Pittsburgh"},{"issue":"1","key":"47_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":"47_CR73","unstructured":"Sarkis J (2001) Greener manufacturing and operations from design to delivery and back. Greenleaf Publishing, Sheffield"},{"key":"47_CR74","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1061\/(ASCE)1090-025X(2003)7:2(78)","volume":"7","author":"LH Shih","year":"2003","unstructured":"Shih LH, Lin YT (2003) Multicriteria optimization for infectious medical waste collection system planning. Pract Period Hazard Toxic Radioactive Waste Manag 7:78\u201385","journal-title":"Pract Period Hazard Toxic Radioactive Waste Manag"},{"key":"47_CR75","first-page":"64","volume":"14","author":"EA Silver","year":"1973","unstructured":"Silver EA, Meal HC (1973) A heuristic for selecting lot size requirements for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Prod Invent Manag 14:64\u201374","journal-title":"Prod Invent Manag"},{"key":"47_CR76","unstructured":"Silver EA, Pyke DF, Peterson R (1996) Inventory management and production planning and scheduling, 3rd edn (1998). Wiley, New York"},{"issue":"2","key":"47_CR77","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. Eur J Oper Res 97(2):308\u2013326","journal-title":"Eur J Oper Res"},{"key":"47_CR78","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 AP, de Sousa JP (2004) Recyclable waste collection planning: a case study. Eur J Oper Res 158:543\u2013554","journal-title":"Eur J Oper Res"},{"issue":"20","key":"47_CR79","doi-asserted-by":"crossref","first-page":"4377","DOI":"10.1080\/00207540600693564","volume":"44","author":"RH Teunter","year":"2006","unstructured":"Teunter RH, Bayindir ZP, Van Den Heuvel W (2006) Dynamic lot sizing with product returns and remanufacturing. Int J Prod Res 44(20):4377\u20134400","journal-title":"Int J Prod Res"},{"key":"47_CR80","volume-title":"The vehicle routing problem","year":"2001","unstructured":"Toth P, Vigo D (eds) (2001) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia"},{"key":"47_CR81","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. Eur J Oper Res 22:329\u2013337","journal-title":"Eur J Oper Res"},{"key":"47_CR82","unstructured":"Van Den 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":"47_CR83","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner HM, Whitin TM (1958) A dynamic version of the economic lot size model. Manag Sci 5:86\u201396","journal-title":"Manag Sci"},{"key":"47_CR84","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0959-6526(02)00066-5","volume":"11","author":"CD White","year":"2003","unstructured":"White CD, Masnet E, Meisner Rosen C, Beckman SL (2003) Product recovery with some byte: an overview of management challenges and environmental consequences in reverse manufacturing for the computer industry. J Cleaner Prod 11:445\u2013458","journal-title":"J Cleaner Prod"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0047-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0047-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:55Z","timestamp":1559117575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0047-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,1]]},"references-count":84,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6,25]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0047-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,1]]}}}