Skip to main content
Log in

Combinatorial optimization and Green Logistics

  • Invited survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems. The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agarwal Y, Mathur K, Salkin HM (1989) A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19:731–749

    Article  Google Scholar 

  • Aminu UF, Eglese RW (2006) A constraint programming aproach to the Chinese Postman problem with time windows. Comput Oper Res 33:3423-3431

    Article  Google Scholar 

  • Ammons JC, Realff MJ, Newton D (1999) Carpet recycling: determining the reverse production system design. J PolymPlast Technol Eng 38(3):547–567

    Google Scholar 

  • Archetti C, Speranza MG (2004) Vehicle routing in the 1-skip collection problem. J Oper Res Soc 55(7):717–727

    Article  Google Scholar 

  • Baldacci R, Maniezzo V (2006) Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47:52–60

    Article  Google Scholar 

  • Barros AI, Dekker R, Scholten V (1998) A two-level network for recycling sand: a case study. Eur J Oper Res 110(2):199–214

    Article  Google Scholar 

  • 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–3383

    Article  Google Scholar 

  • Benavent E, Campos V, Corberán A (1992) The capacitated arc routing problem: lower bounds. Networks 22:669–690

    Article  Google Scholar 

  • 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–643

    Article  Google Scholar 

  • Bodin L, Mingozzi A, Baldacci R, Ball M (2000) The rollon-rolloff vehicle routing problem. Transport Sci 34:271–288

    Article  Google Scholar 

  • Bramel J, Simchi-Levi D (1997) The logic of logistics: theory, algorithms, and applications for logistics management. Springer, Berlin

    Google Scholar 

  • Brandão 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

  • 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

  • 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–408

    Article  Google Scholar 

  • Chu F, Labadi N, Prins C (2005) Heuristics for the periodic capacitated arc routing problem. J Intell Manufact 16(2):243–251

    Article  Google Scholar 

  • Chu F, Labadi N, Prins C (2006) A scatter search for the periodic capacitated arc routing problem. Eur J Oper Res 169(2):586–605

    Article  Google Scholar 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581

    Google Scholar 

  • 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–163

    Google Scholar 

  • 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–297

    Chapter  Google Scholar 

  • Dantzig GB, Ramser JM (1959) The truck dispatching problem. Manag Sci 6:81–91

    Google Scholar 

  • Dekker R, Fleischmann M, Inderfurth K, Van Wassenhove LN (eds), (2004) Reverse logistics: quantitative models for closed-loop supply chains. Springer, Berlin

    Google Scholar 

  • Dellaert N, Jeunet J (2000) Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. Int J Prod Res 38(5):1083–1099

    Article  Google Scholar 

  • 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

  • Dowlatshahi S (2000) Developing a theory of reverse logistics. Interfaces 30(3):143–155

    Article  Google Scholar 

  • Dror M (ed) (2000) Arc routing: theory solutions and applications. Kluwer, Boston

    Google Scholar 

  • 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–650

    Google Scholar 

  • Eglese RW, Maden W, Slater A (2006) A road timetable to aid vehicle routing and scheduling. Comput Oper Res 33:3508–3519

    Article  Google Scholar 

  • Fleischmann M (2001) Quantitative models for reverse logistics. Springer, New York

    Google Scholar 

  • 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–17

    Article  Google Scholar 

  • 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–666

    Article  Google Scholar 

  • Fu LP, Rilett LR (2000) Estimation of time-dependent, stochastic route travel times using artificial neural networks. Transport Plan Technol 24(1):25–48

    Google Scholar 

  • Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão 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–511

    Article  Google Scholar 

  • 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–154

    Google Scholar 

  • Giannikos I (1998) A multi-objective programming model for locating treatment sites and routing hazardous wastes. Eur J Oper Res 104:333–342

    Article  Google Scholar 

  • Golden BL, Assad AA (1988) Vehicle routing: methods and studies. North-Holland, Amsterdam

    Google Scholar 

  • Golden BL, Wong RT (1981) Capacitated arc routing problems. Networks 11:305–315

    Article  Google Scholar 

  • Golden BL, de Armon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput Oper Res 10(1):47–59

    Article  Google Scholar 

  • Greistorfer P (2003) A tabu scatter search metaheuristic for the arc routing problem. Comput Ind Eng 44(2):249–266

    Article  Google Scholar 

  • Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput Oper Res 32(11):2959–2986

    Article  Google Scholar 

  • Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129–135

    Article  Google Scholar 

  • Hertz A, Laporte G, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transport Sci 35:425–434

    Article  Google Scholar 

  • 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–473

    Article  Google Scholar 

  • Jayaraman V, Guide VDR Jr, Srivastava R (1999) A closed-loop logistics model for remanufacturing. J Oper Res Soc 50(5):497–508

    Article  Google Scholar 

  • Johnson LA, Montgomery DC (1974) Operations research in production planning, scheduling, and inventory control. Wiley, New York

    Google Scholar 

  • Krikke HR (1998) Recovery strategies and reverse logistic network design. Thesis, University of Twente, Enschede, The Netherlands

  • Krikke HR, Van Harten A, Schuur PC (1999) Business case Océ: reverse logistic network re-design for copiers. OR Spektrum 21(3):381–409

    Google Scholar 

  • 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

  • Kroon L, Vrijens G (1995) Returnable containers: an example of reverse logistics. Int J Phys Distrib Logist Manag 25(2):56–68

    Article  Google Scholar 

  • 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–11 April 2003, LNCS 2632, pp 550–564, Springer, Berlin

  • Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memetic algorithms for arc routing problems. Ann Oper Res 131(1-4):159–185

    Article  Google Scholar 

  • Lacomme P, Prins C, Ramdane-Cherif W (2005) Evolutionary algorithms for periodic arc routing problems, Eur J Oper Res 165(2):535–553

    Google Scholar 

  • Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. Ann Discrete Math 31:147–184

    Google Scholar 

  • 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–128

    Google Scholar 

  • Longo H, Poggi de Aragão M, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823–1837

    Article  Google Scholar 

  • Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100:423–445

    Article  Google Scholar 

  • 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

  • Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transport Sci 26(3):185–200

    Google Scholar 

  • Mansini R, Speranza MG (1998) A linear programming model for the separate refuse collection service. Comput Oper Res 25(7/8):659–673

    Article  Google Scholar 

  • Marìn A, Pelegrìn B (1998) The return plant location problem: modelling and resolution. Eur J Oper Res 104(2):375–392

    Article  Google Scholar 

  • De Meulemeester L, Laporte G, Louveaux FV, Semet F (1997) Optimal sequencing of skip collections and deliveries. J Oper Res Soc 48:57–64

    Article  Google Scholar 

  • Mondschein SV, Schilkrut A (1997) Optimal investment policies for pollution control in the copper industry. Interfaces 27(6):69–87

    Google Scholar 

  • 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–234

    Google Scholar 

  • Mourão MC, Almeida T (2000) Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. Eur J Oper Res 121:420–434

    Article  Google Scholar 

  • 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–77

    Article  Google Scholar 

  • Nema AK, Gupta SK (2003) Optimization of regional hazardous waste management systems: an improved formulation. Waste Manag 19:441–451

    Article  Google Scholar 

  • OR/MS Today (2006) Vehicle routing software survey. http://www.lionhrtpub.com/orms/surveys/ Vehicle_Routing/vrss.html

  • Palmer A (2004) The environmental implications of grocery home delivery. Centre for Logistics and Supply Chain Management, Cranfield University, ELA doctorate workshop

  • Pearn WL, Assad A, Golden BL (1987) Transforming arc routing into node routing problems. Comput Oper Res 14:285–288

    Article  Google Scholar 

  • Peirce JJ, Davidson GM (1982) Linear programming in hazardous waste management. J Environ Eng 108(EE5):1014–1026

    Google Scholar 

  • Pronello C, André M (2000) Pollutant emissions estimation in road transport models. INRETS-LTE report, vol 2007

  • Rogers DS, Tibben-Lembke RS (1999) Going backwards: reverse logistics trends and practices. Reverse Logistics Executive Council (RLEC), Pittsburgh

  • Sahoo S, Kim S, Kim B, Kraas B, Popov A (2005) Routing optimization for waste management. Interfaces 35(1):24–36

    Article  Google Scholar 

  • Sarkis J (2001) Greener manufacturing and operations from design to delivery and back. Greenleaf Publishing, Sheffield

  • Shih LH, Lin YT (2003) Multicriteria optimization for infectious medical waste collection system planning. Pract Period Hazard Toxic Radioactive Waste Manag 7:78–85

    Article  Google Scholar 

  • 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–74

    Google Scholar 

  • Silver EA, Pyke DF, Peterson R (1996) Inventory management and production planning and scheduling, 3rd edn (1998). Wiley, New York

  • Spengler T, Piichert H, Penkuhn T, Rentz O (1997) Environmental integrated production and recycling management. Eur J Oper Res 97(2):308–326

    Article  Google Scholar 

  • Teixeira J, Antunes AP, de Sousa JP (2004) Recyclable waste collection planning: a case study. Eur J Oper Res 158:543–554

    Article  Google Scholar 

  • Teunter RH, Bayindir ZP, Van Den Heuvel W (2006) Dynamic lot sizing with product returns and remanufacturing. Int J Prod Res 44(20):4377–4400

    Article  Google Scholar 

  • Toth P, Vigo D (eds) (2001) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia

    Google Scholar 

  • Ulusoy G (1985) The fleet size and mix problem for capacitated arc routing. Eur J Oper Res 22:329–337

    Article  Google Scholar 

  • 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

  • Wagner HM, Whitin TM (1958) A dynamic version of the economic lot size model. Manag Sci 5:86–96

    Article  Google Scholar 

  • 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–458

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard W. Eglese.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sbihi, A., Eglese, R.W. Combinatorial optimization and Green Logistics. 4OR 5, 99–116 (2007). https://doi.org/10.1007/s10288-007-0047-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-007-0047-3

Keywords

MSC classification (2000)

Navigation