Combinatorial optimization and Green Logistics

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.

[1]  M. Fleischmann,et al.  Quantitative models for reverse logistics , 2001 .

[2]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[3]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[4]  Philippe Lacomme,et al.  Evolutionary algorithms for periodic arc routing problems , 2005, Eur. J. Oper. Res..

[5]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[6]  Sudhir Kumar Gupta,et al.  Multiobjective Risk Analysis and Optimization of Regional Hazardous Waste Management System , 2003 .

[7]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[8]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[9]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[10]  Claudio Barbieri da Cunha,et al.  The logic of logistics: theory, algorithms and applications for logistics management , 1999 .

[11]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

[12]  Maria Grazia Speranza,et al.  A linear programming model for the separate refuse collection service , 1998, Comput. Oper. Res..

[13]  Roberto Baldacci,et al.  Exact methods based on node-routing formulations for undirected arc-routing problems , 2006 .

[14]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[15]  Leo Kroon,et al.  Returnable containers: an example of reverse logistics , 1995 .

[16]  Eric Masanet,et al.  Product recovery with some byte: an overview of management challenges and environmental consequences in reverse manufacturing for the computer industry , 2003 .

[17]  Harold Krikke,et al.  Recovery strategies and reverse logistic network design , 2001 .

[18]  Ioannis Giannikos,et al.  A multiobjective programming model for locating treatment sites and routing hazardous wastes , 1998 .

[19]  Jiuh-Biing Sheu,et al.  A REVERSE LOGISTICS COST MINIMIZATION MODEL FOR THE TREATMENT OF HAZARDOUS WASTES , 2002 .

[20]  Richard W. Eglese,et al.  Combinatorial optimization and Green Logistics , 2007 .

[21]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[22]  M. Czapaluk,et al.  Decyzje kapitałowe w małych przedsiębiorstwach we wczesnym okresie ich działalności , 2002 .

[23]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

[24]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..

[25]  M. Realff,et al.  Carpet Recycling: Determining the Reverse Production System Design , 1999 .

[26]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[27]  Rommert Dekker,et al.  A two-level network for recycling sand: A case study , 1998, Eur. J. Oper. Res..

[28]  M. Tartaglia,et al.  Linear Programming in Hazardous Waste Management , 1982 .

[29]  P. C. Schuur,et al.  Business case Océ: Reverse logistic network re-design for copiers , 1999 .

[30]  António Pais Antunes,et al.  Recyclable waste collection planning--a case study , 2004, Eur. J. Oper. Res..

[31]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[32]  Maria Cândida Mourão,et al.  Lower-bounding and heuristic methods for a refuse collection vehicle routing problem , 2000, Eur. J. Oper. Res..

[33]  Susana V. Mondschein,et al.  Optimal Investment Policies for Pollution Control in the Copper Industry , 1997 .

[34]  Feng Chu,et al.  A Scatter Search for the periodic capacitated arc routing problem , 2006, Eur. J. Oper. Res..

[35]  Roberto Baldacci,et al.  The Rollon-Rolloff Vehicle Routing Problem , 2000, Transp. Sci..

[36]  Richard W. Eglese,et al.  A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..

[37]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[38]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

[39]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[40]  Ruud H. Teunter,et al.  Dynamic lot sizing with product returns and remanufacturing , 2006 .

[41]  Cristina Pronello,et al.  Pollutant emissions estimation in road transport models , 2000 .

[42]  L. Zurich,et al.  Operations Research in Production Planning, Scheduling, and Inventory Control , 1974 .

[43]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..

[44]  Richard W. Cuthbertson,et al.  The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management , 1998, J. Oper. Res. Soc..

[45]  B. Pelegrín,et al.  The return plant location problem: Modelling and resolution , 1998 .

[46]  Alexander Popov,et al.  Routing Optimization for Waste Management , 2005, Interfaces.

[47]  José-Manuel Belenguer,et al.  Lower and upper bounds for the mixed capacitated arc routing problem , 2006, Comput. Oper. Res..

[48]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[49]  Roberto Montemanni,et al.  Time Dependent Vehicle Routing Problem with an Ant Colony System , 2003 .

[50]  Richard W. Eglese,et al.  A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .

[51]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[52]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[53]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[54]  R. Dekker,et al.  Reverse logistics : quantitative models for closed-loop supply chains , 2004 .

[55]  Ronald S. Tibben-Lembke,et al.  Going Backwards: Reverse Logistics Trends and Practices , 1999 .

[56]  Erwin van der Laan,et al.  Quantitative models for reverse logistics: A review , 1997 .

[57]  Li-Hsing Shih,et al.  Multicriteria Optimization for Infectious Medical Waste Collection System Planning , 2003 .

[58]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[59]  L. De Meulemeester,et al.  Optimal sequencing of skip collections and deliveries , 1997 .

[60]  Rommert Dekker,et al.  A characterisation of logistics networks for product recovery , 2000 .

[61]  T. Spengler,et al.  Environmental integrated production and recycling management , 1997 .

[62]  Liping Fu,et al.  Estimation of time‐dependent, stochastic route travel times using artificial neural networks , 2000 .

[63]  Wen Lea Pearn,et al.  Transforming arc routing into node routing problems , 1987, Comput. Oper. Res..

[64]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[65]  Joseph Sarkis,et al.  Greener manufacturing and operations : from design to delivery and back /ed. by Joseph Sarkis , 2002 .

[66]  Shad Dowlatshahi,et al.  Developing a Theory of Reverse Logistics , 2000, Interfaces.

[67]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[68]  Richard W. Eglese,et al.  A constraint programming approach to the Chinese postman problem with time windows , 2006, Comput. Oper. Res..

[69]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[70]  Feng Chu,et al.  Heuristics for the periodic capacitated arc routing problem , 2005, J. Intell. Manuf..

[71]  Jully Jeunet,et al.  Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm , 2000 .

[72]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[73]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[74]  Arvind K. Nema,et al.  Optimization of regional hazardous waste management systems : an improved formulation , 1999 .

[75]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[76]  W. V. D. Heuvel,et al.  On the complexity of the economic lot-sizing problem with remanufacturing options , 2004 .

[77]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[78]  V D R Guide,et al.  A closed-loop logistics model for remanufacturing , 1999, J. Oper. Res. Soc..

[79]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[80]  Philippe Lacomme,et al.  Multiobjective Capacitated Arc Routing Problem , 2003, EMO.

[81]  Maria Grazia Speranza,et al.  Vehicle routing in the 1-skip collection problem , 2004, J. Oper. Res. Soc..

[82]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

[83]  M. BelenguerJ.,et al.  The Capacitated Arc Routing Problem , 1998 .