scispace - formally typeset
Search or ask a question
Author

André Langevin

Bio: André Langevin is an academic researcher from École Polytechnique de Montréal. The author has contributed to research in topics: Arc routing & Vehicle routing problem. The author has an hindex of 37, co-authored 141 publications receiving 3901 citations. Previous affiliations of André Langevin include École Normale Supérieure & École Polytechnique.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, an overview of continuous approximation models for freight distribution problems is presented and a taxonomy of six classes is used to differentiate the problems and a brief review of each paper is provided.
Abstract: We present an overview of continuous approximation models that have been developed for freight distribution problems. A taxonomy of six classes is used to differentiate the problems and a brief review of each paper is provided. This paper stresses important principles and key results from the continuous approximation models. This paper also seeks to highlight gaps in the literature and areas for future work.

188 citations

BookDOI
01 Jan 2005
TL;DR: In this article, the authors present the design, planning, and optimisation of reverse logistic networks in the context of reverse Logistics Networks (RNLNs) for the transportation of high value consumer products.
Abstract: Foreword.- Contributing Authors.- Preface.- The Network of Logistics Decisions.- Facility Location in Supply Chain Design.- Distribution Centres in Supply Chain Operations.- Operational Research Methods for Efficient Warehousing.- Models and Methods for Facilities Layout Design from an Applicability to Real-World Perspective.- The Design, Planning, and Optimization of Reverse Logistics Networks.- Models and Methods for Operations in Port Container Terminals.- Strategic Network Design for Motor Carriers.- New Heuristics for the Vehicle Routing Problem.- Routing Propane Deliveries.- Synchronized Production-Distribution Planning in the Pulp and Paper Industry.- Production Planning Optimization Modeling in Demand and Supply Chains of High-Value Consumer Products.

165 citations

Journal ArticleDOI
TL;DR: A hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS) with a decomposition method where the master problem is modelled with constraint programming and the subproblem (conflict free routing) with mixed integer programming.

146 citations

Journal ArticleDOI
TL;DR: The computational results indicate that the three-stage algorithm is effective for finding high-quality solutions and can efficiently solve large problems.

129 citations

Journal ArticleDOI
TL;DR: This paper provides a comprehensive survey of optimization models and solution methodologies for the routing of vehicles for plowing and snow disposal operations and reviews models for the fleet sizing and fleet replacement problems.

116 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: An integrated and fresh look into the area of GrSCM is taken, using the rich body of available literature, including earlier reviews that had relatively limited perspectives, on the basis of the problem context in supply chain's major influential areas.
Abstract: 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.

3,344 citations

Journal ArticleDOI
TL;DR: Basic features that facility location models must capture to support decision-making involved in strategic supply chain planning are identified and applications ranging across various industries are presented.

1,770 citations

Book
01 Jan 2006
TL;DR: 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.
Abstract: 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)

1,527 citations

Journal ArticleDOI
TL;DR: A GA without trip delimiters, hybridized with a local search procedure is proposed, which outperforms most published TS heuristics on the 14 classical Christofides instances and becomes the best solution method for the 20 large-scale instances generated by Golden et al.

974 citations

Journal ArticleDOI
TL;DR: Some of the main known algorithms for the traveling salesman problem are surveyed and the definition and applications of these algorithms are explained.

856 citations