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

Classification of travelling salesman problem formulations

Considering the effects of globalisation, the increase of production and energy costs, and the introduction of advanced technologies, companies need to change their way of doing business if they want to stay competitive. One way of doing this is to establish collaborations with suppliers, distributors and retailers, in order to exchange products efficiently and create value for customers. Nevertheless, the structure of the collaboration must be designed carefully and some coordination mechanisms must be implemented to support this way of doing business. In this article, we first analyse: why companies work together, how they should build their partnership, and which strategies they can implement to facilitate coordination of supply chain activities. We then report a case study of collaboration in the forest industry that shows the benefits of implementing coordination mechanisms as well as the necessity of using incentives to better share these benefits.

Inter-firm collaborations and supply chain coordination: review of key elements and case study

Winter road maintenance planning involves a variety of decisions related to the routing of vehicles for spreading chemicals and abrasives, plowing roadways and sidewalks, loading snow into trucks, and transporting snow to disposal sites. In this paper, we present a model and two heuristic solution approaches based on mathematical optimization for the routing of vehicles for snow plowing operations in urban areas. Given a district and a single depot where a number of plows are based, the problem is to determine a set of routes, each performed by a single vehicle that starts and ends at the district's depot, such that all road segments are serviced while satisfying a set of operational constraints and minimizing a time objective. The formulation models general precedence relation constraints with no assumption on class connectivity, different service and deadhead speed possibilities, separate pass requirements for multilane road segments, class upgrading possibilities, and vehicle road segment dependencies. Several extensions, such as turn restrictions, load balancing constraints, and tandem service requirements, which are required in a real-life application, are also discussed. Two objectives are considered: A hierarchical objective and a makespan objective. The resulting model is based on a multicommodity network flow structure to impose the connectivity of the route performed by each vehicle. The two solution strategies were tested on data from the City of Dieppe, New Brunswick, Canada.

Vehicle Routing for Urban Snow Plowing Operations

This article presents a new approach for planning the dispatching, conflict-free routing, and scheduling of automated guided vehicles in a flexible manufacturing system. The problem is solved optimally in an integrated manner, contrary to the traditional approach in which the problem is decomposed in three steps that are solved sequentially. The algorithm is based on dynamic programming and is solved on a rolling time horizon. Three dominance criteria are used to limit the size of the state space. The method finds the transportation plan minimizing the makespan (the completion time for all the tasks). Various results are discussed. A heuristic version of the algorithm is also proposed for an extension of the method to many vehicles.

André Langevin

Papers

Classification of travelling salesman problem formulations

Inter-firm collaborations and supply chain coordination: review of key elements and case study

Vehicle Routing for Urban Snow Plowing Operations

Dispatching, routing, and scheduling of two automated guided vehicles in a flexible manufacturing system

Vehicle Routing for Urban Snow Plowing Operations