Vol. 9 Issue 1 pp. 000‐000 There is a growing need for integrating environmentally sound choices into supply-chain management research and practice. Perusal of the literature shows that a broad frame of reference for green supply-chain management (GrSCM) is not adequately developed. Regulatory bodies that formulate regulations to meet societal and ecological concerns to facilitate growth of business and economy also suffer from its absence. A succinct classification to help academicians, researchers and practitioners in understanding integrated GrSCM from a wider perspective is needed. Further, sufficient literature is available to warrant such classification. This paper takes an integrated and fresh look into the area of GrSCM. The literature on GrSCM is covered exhaustively from its conceptualization, primarily taking a ‘reverse logistics angle’. Using the rich body of available literature, including earlier reviews that had relatively limited perspectives, the literature on GrSCM is classified on the basis of the problem context in supply chain’s major influential areas. It is also classified on the basis of methodology and approach adopted. Various mathematical tools/techniques used in literature vis-a-vis the contexts of GrSCM are mapped. A timeline indicating relevant papers is also provided as a ready reference. Finally, the findings and interpretations are summarized, and the main research issues and opportunities are highlighted.

Green supply‐chain management: A state‐of‐the‐art literature review

Facility location and supply chain management - A review

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.

The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.

The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.

The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.

- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications

Table of Contents

Foreword (Ugo Montanari) 
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh) 
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth) 
Chapter 3. Constraint Propagation (Christian Bessiere) 
Chapter 4. Backtracking Search Algorithms (Peter van Beek) 
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang) 
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons) 
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex) 
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith) 
Part II : Extensions, Languages, and Applications

Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace) 
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson) 
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker) 
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers) 
Chapter 17. Constraints over Structured Domains
(Carmen Gervet) 
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings) 
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw) 
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)

/pdf/handbook-of-constraint-programming-53srutguo2.pdf

Handbook of Constraint Programming

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.3.7230&rep=rep1&type=pdf

A simple and effective evolutionary algorithm for the vehicle routing problem

http://web.ist.utl.pt/~ist11038/CD_Casquilho/TSP1992EJOR_Laporte.pdf

The traveling salesman problem: An overview of exact and approximate algorithms

Roadway snow and ice control (RSIC) is one of the most complex and fascinating venues for arc routing applications. Arc routing problems occur in several different aspects of RSIC, including plowing roadways and sidewalks, spreading chemicals (salt and other de-icers) and abrasives (sand and stone), and in using snowblowers to load snow into trucks for hauling to disposal sites. The limited progress of computerized routing packages in this area (Office of the Legislative Auditor, 1995) highlights the difficulty of the problems and the weaknesses of theoretical arc routing models for snow and ice control. Part of the difficulty is due to the complex operational and infrastructure constraints, especially in urban areas. The dynamic nature of the problems also adds complexity, as conditions can vary dramatically over time and space. Furthermore, a wide variety of equipment with different operating characteristics can be deployed for RSIC.

Roadway Snow and Ice Control

This paper presents an optimal constraint programming approach for the open-shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized restart policies combined with nogood recording allow us to search diversification and learning from restarts. This approach is compared with the best-known metaheuristics and exact algorithms, and it shows better results on a wide range of benchmark instances.

/pdf/an-optimal-constraint-programming-approach-to-the-open-shop-5gu6h6ly6v.pdf

An Optimal Constraint Programming Approach to the Open-Shop Problem

We studied the following organization for the letter and parcel pick-up and delivery problem in an urban environment: the working day is divided in time periods during which each vehicle starts from a sorting center, travels to a precise area of the region, picks up and delivers letters and parcels, and then returns to the depot to have the collected material sorted out for delivery during the following period. The intent of this approach is to have each zone serviced by one vehicle only to facilitate the work of the dispatcher and the routing of each vehicle. We have developed a method of partitioning an urban region into zones so as to minimize the total number of vehicles used or the total distance traveled by all the vehicles. The first part of the method determines the zones and the average number of points to visit. Then, a first refinement of the method takes into account the daily variability of the demand in each zone, and a second refinement examines the advantage of allowing some overlapping of zones for the purpose of having an overloaded vehicle relieved by one from an adjacent zone.

Design of multiple-vehicle delivery tours satisfying time constraints

The synchronized arc and node routing problem: Application to road marking

In this paper, a special case of the vehicle routing problem in which the demands consist in a set of rectangular two-dimensional weighted items is considered. The vehicles have a two-dimensional loading surface and a maximum weight capacity. These problems have a routing and a packing component. A framework to handle the loading of a vehicle is proposed. A Constraint Programming loading model based on a scheduling approach is developed. It is also shown that the non-overlapping rectangle constraint can be extended to handle a practical constraint called sequential loading constraint.

/pdf/two-dimensional-pickup-and-delivery-routing-problem-with-vdki0m62ot.pdf

André Langevin

Papers

Roadway Snow and Ice Control

An Optimal Constraint Programming Approach to the Open-Shop Problem

Design of multiple-vehicle delivery tours satisfying time constraints

The synchronized arc and node routing problem: Application to road marking

Two-Dimensional Pickup and Delivery Routing Problem with Loading Constraints