Cahiers : GERAD

Mar 2018

Median and covering location problems with interconnected facilities

Marilène Cherkesly, Mercedes Landete, and Gilbert Laporte

G-2018-19

Jun 2017

The impact of synchronizing drivers breaks and recharging operations for electric vehicles

Maximilian Schiffer, Gilbert Laporte, Michael Schneider, and Grit Walther

G-2017-46

Jun 2017

Vehicle routing and location-routing with intermediate stops: A review

Maximilian Schiffer, Michael Schneider, Grit Walther, and Gilbert Laporte

G-2017-45

May 2017

A fast heuristic for very large-scale capacitated arc routing problems

Sanne Wøhlk and Gilbert Laporte

G-2017-36

Mar 2017

Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities

Maximilian Schiffer, Michael Schneider, and Gilbert Laporte

G-2017-21

Feb 2017

Computational comparison of several algorithms for the minimum cost perfect matching problem

Sanne Wøhlk and Gilbert Laporte

G-2017-11

Jan 2016

The pickup and delivery problem with time windows and handling operations

Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, and Gilbert Laporte

G-2016-06

Dec 2015

Scheduling identical parallel machines with tooling constraints

Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, and Horacio Hideki Yanasse

G-2015-134

Mar 2015

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, and Gilbert Laporte

G-2015-25

Sep 2014

A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

Marilène Cherkesly, Guy Desaulniers, and Gilbert Laporte

G-2014-66

Feb 2014

The Tube Challenge

Gilbert Laporte

G-2014-09

Feb 2014

The design of rapid transit networks

Gilbert Laporte and Juan A. Mesa

G-2014-08

May 2013

Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and LIFO Loading

Marilène Cherkesly, Guy Desaulniers, and Gilbert Laporte

G-2013-31

Oct 2012

Scheduling Issues in Vehicle Routing

Gilbert Laporte

G-2012-62

Aug 2010

Planning Rapid Transit Networks

Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, and Federico Perea

G-2010-43

Apr 2010

A Large Neighbourhood Search Heuristic for Ship Routing and Scheduling with Split Loads

Jarl Eirik Korsvik, Kjetil Fagerholt, and Gilbert Laporte

G-2010-25

Oct 2009

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

Gilbert Laporte

G-2009-57

Aug 2009

Fifty Years of Vehicle Routing

Gilbert Laporte

G-2009-43

Mar 2009

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows

Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, and Vladimir Marianov

G-2009-19

Dec 2008

Some Applications of the Generalized Vehicle Routing Problem

R. Baldacci, Enrico Bartolini, and Gilbert Laporte

G-2008-82

Oct 2008

Integration of Operational Policies into the Design Phase of a Material Handling Network

A. Asef-Vaziri and Gilbert Laporte

G-2008-69

Jul 2008

Managing Hopping Sequences in Frequency Hopping Cellular Network

Souheyl Touhami, Jean-Marie Bourjolly, and Gilbert Laporte

G-2008-51

Jun 2008

Scheduling Technicians and Tasks in a Telecommunications Company

Jean-François Cordeau, Gilbert Laporte, Federico Pasin, and Stefan Ropke

G-2008-45

May 2008

A Continuous Analysis Framework for the Solution of Location-Allocation Problems with Dense Demand

Alper Murat, Vedat Verter, and Gilbert Laporte

G-2008-42

May 2008

Designing Robust Rapid Transit Networks with Alternative Routes

Gilbert Laporte, Angel Marín, Juan A. Mesa, and Federico Perea

G-2008-44

Dec 2007

An Ant Colony Optimization Metaheuristic for the Undirected Rural Postman Problem

Demetrio Laganà, Gilbert Laporte, Francesco Mari, Roberto Musmanno, and Ornella Pisacane

G-2007-106

Oct 2007

Locating a Metro Line in a Historical City Centre: Application to Sevilla

Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, and Miguel Ángel Pozo

G-2007-76

Aug 2007

What You Should Know about the Vehicle Routing Problem

Gilbert Laporte

G-2007-59

May 2007

A Branch-and-Cut Algorithm for the Undirected Capacitated Arc Routing Problem

Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, and Roberto Musmanno

G-2007-39

Jan 2007

One-to-Many-to-One Single Vehicle Pickup and Delivery Problems

Irina Gribkovskaia and Gilbert Laporte

G-2007-04

Jan 2007

Horizontal Cooperation Among Freight Carriers: Request Allocation and Profit Sharing

Marta Anna Krajewska, Herbert Kopfer, Gilbert Laporte, Stefan Ropke, and Georges Zaccour

G-2007-06

Dec 2006

The Dial-a-Ride Problem: Models and Algorithms

Jean-François Cordeau and Gilbert Laporte

G-2006-78

Nov 2006

Recent Models and Algorithms for One-to-One Pickup and Delivery Problems

Jean-François Cordeau, Gilbert Laporte, and Stefan Ropke

G-2006-68

Oct 2006

A Review and Comparative Analysis of Several Asymmetric Travelling Salesman Problem Formulations

Temel Öncan, I. Kuban Altinel, and Gilbert Laporte

G-2006-55

Sep 2005

The Preemptive Swapping Problem on a Tree

Shoshana Anily, Michel Gendreau, and Gilbert Laporte

G-2005-69

May 2005

A Heuristic for the Management of Multiple-Orbit Earth Observation Satellites

Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, and Vincent Raymond

G-2005-45

Mar 2005

The Maximum Return-on-investment Plant Location Problem with Market Share

Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenović, and Dragan Urosević

G-2005-25

Jan 2005

Improvements to the Or-opt Heuristic for the Symmetric Traveling Salesman Problem

Gilbert Babin, Stéphanie Deneault, and Gilbert Laporte

G-2005-02

Apr 2004

New Heuristics for the Vehicle Routing Problem

Jean-François Cordeau, Michel Gendreau, Alain Hertz, Gilbert Laporte, and JS Sormany

G-2004-33

Mar 2004

Exact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem

A. Asef-Vaziri, Gilbert Laporte, and Robert Ortiz

G-2004-29

May 2003

A Practical Exact Algorithm for the Shortest Loop Design Problem in a Block Layout

RZ Farahani, Gilbert Laporte, and Mehdi Sharifyazdi

G-2003-28

Mar 2003

A Note on the Lifted Miller-Tucker-Zemlin Subtour Elimination Constraints for the Capacitated Vehicle Routing Problem

I Kara, Gilbert Laporte, and Tolga Bektas

G-2003-12

Jan 2003

Branch-and-Cut Algorithms for the Undirected m-Peripatetic Salesman Problem

Éric Duchenne, Gilbert Laporte, and Frédéric Semet

G-2003-02

Jul 2002

Exact Algorithms for the Job Sequencing and Tool Switching Problem

Gilbert Laporte, Juan-José Salazar-González, and Frédéric Semet

G-2002-40

Jun 2002

Modeling and Optimization of Vehicle Routing and Arc Routing Problems

Jean-François Cordeau and Gilbert Laporte

G-2002-30

Jun 2002

The Dial-a-Ride Problem: Variants, Modeling Issues and Algorithms

Jean-François Cordeau and Gilbert Laporte

G-2002-25

Jun 2002

Loop Based Facility Planning and Material Handling

A. Asef-Vaziri and Gilbert Laporte

G-2002-23

Apr 2002

A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem

Jean-François Cordeau and Gilbert Laporte

G-2002-18

Mar 2002

Tabu Search Heuristics for the Vehicle Routing Problem

Jean-François Cordeau and Gilbert Laporte

G-2002-15

Feb 2002

Location of p Facilities in a Multi-Storey Building

R. Arriola, Gilbert Laporte, and Francisco A. Ortega

G-2002-09

Dec 2001

A General Multi-Shift Scheduling System

Gilbert Laporte and Gilles Pesant

G-2001-52

Feb 2001

Location-Arc Routing Problems

Gianpaolo Ghiani and Gilbert Laporte

G-2001-12

Feb 2001

Solving the Hierarchical Chinese Postman Problem as a Rural Postman Problem

Edgar Alberto Cabral, Michel Gendreau, Gianpaolo Ghiani, and Gilbert Laporte

G-2001-10

Feb 2001

A Simple Enhancement of the Esau-Williams Heuristic for the Capacitated Minimum Spanning Tree Problem

G Bruno and Gilbert Laporte

G-2001-05

Nov 2000

On the (r|X_p)-Medianoid Problem on a Network with Vertex and Edge Demands

Abdullah Dasci, Horst A. Eiselt, and Gilbert Laporte

G-2000-61

Oct 2000

Ambulance Location and Relocation Models

Luce Brotcorne, Gilbert Laporte, and Frédéric Semet

G-2000-53

Sep 2000

Some Applications of the Clustered Traveling Salesman Problem

Gilbert Laporte and U Palekar

G-2000-49

Sep 2000

Recent Algorithmic Advances for Arc Routing Problems

Gianpaolo Ghiani, Alain Hertz, and Gilbert Laporte

G-2000-40

Mar 2000

Solving Arc Routing Problems with Turn Penalties

J Clossey, Gilbert Laporte, and Patrick Soriano

G-2000-05

Nov 1999

An Exact Algorithm for the Maximum k-Club Problem in an Undirected Graph

Jean-Marie Bourjolly, Gilbert Laporte, and Gilles Pesant

G-99-47

Apr 1999

La confection automatique des cartes électorales

Gilbert Laporte

G-99-23

Mar 1999

Classical and Modern Heuristics for the Vehicle Routing Problem

Gilbert Laporte, Michel Gendreau, Jean-Yves Potvin, and Frédéric Semet

G-99-21

Oct 1998

Classical Heuristics for the Vehicle Routing Problem

Gilbert Laporte and Frédéric Semet

G-98-54

Sep 1998

Metaheuristics for the Vehicle Routing Problem

Michel Gendreau, Gilbert Laporte, and Jean-Yves Potvin

G-98-52

Aug 1998

The Block Layout Shortest Loop Design Problem

A. Asef-Vaziri, Gilbert Laporte, and Chelliah Sriskandarajah

G-98-46

Aug 1998

The Art and Science of Designing Rotating Schedules

Gilbert Laporte

G-98-43

Aug 1998

Heuristics for Finding k-Clubs in an Undirected Graph

Jean-Marie Bourjolly, Gilbert Laporte, and Gilles Pesant

G-98-41

Jul 1998

Exact Algorithms for the Traveling Salesman Problem and the Vehicle Routing Problem

Gilbert Laporte

G-98-37

Nov 1997

A Branch-and-Cut Algorithm for the Undirected Rural Postman Problem

Gianpaolo Ghiani and Gilbert Laporte

G-97-65

Sep 1997

Path, Tree and Cycle Location

Martine Labbé, Gilbert Laporte, and Inmaculada Rodriguez-Martin

G-97-62

Jul 1997

Scheduling Linen Deliveries in a Large Hospital

M Banerjea-Brodeur, Jean-François Cordeau, Gilbert Laporte, and A Lasry

G-97-50

May 1997

Recent Advances in Routing Algorithms

Gilbert Laporte

G-97-38

Apr 1997

Solving Stochastic Routing Problems with the Integer L-Shaped Method

Gilbert Laporte and François V. Louveaux

G-97-25

Feb 1997

Two Exact Algorithms for the Vehicle Routing Problem on Trees

P Mbaraga, André Langevin, and Gilbert Laporte

G-97-06

Jan 1997

Upper Bounds and Algorithms for the Maximum Cardinality Bin Packing Problem

Martine Labbé, Gilbert Laporte, and Silvano Martello

G-97-05

Jan 1997

Heuristics for Minimizing Tool Switches when Scheduling Part Types on a Flexible Machine

Alain Hertz, Gilbert Laporte, M Mittaz, and KE Stecke

G-97-03

Dec 1996

Covering a Graph with Cycles

Martine Labbé, Gilbert Laporte, and Patrick Soriano

G-96-57

Jan 1996

Selected Readings on Vehicle Routing

Gilbert Laporte

G-96-05

Nov 1995

Some Applications of the Generalized Traveling Salesman Problem

Gilbert Laporte, A. Asef-Vaziri, and Chelliah Sriskandarajah

G-95-49

Oct 1995

Perspectives on Multiobjective Transportation Planning

Gilbert Laporte

G-95-47

Aug 1995

Recent Developments in Practical Examination Timetabling

Michael W. Carter and Gilbert Laporte

G-95-37

May 1995

Optimal Sequencing Rules for Some Large Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics

Gilbert Laporte, L Lopes, and François Soumis

G-95-26

May 1995

Optimal Sequencing Rules for Some Large Scale Flexible Manufacturing Problems Under Four Different Metrics

Gilbert Laporte, L Lopes, and François Soumis

G-95-25

Jul 1994

A Combinatorial Column Generation Algorithm for the Maximum Clique and Stable Set Problems

Jean-Marie Bourjolly, Gilbert Laporte, and Hélène Mercure

G-94-33

Apr 1994

Examination Timetabling: Algorithmic Strategies and Application

Michael W. Carter, Gilbert Laporte, and Sau Yan Lee

G-94-18

Feb 1994

A Quadratic 0-1 Optimization Algorithm for the Maximum Clique and Stable Set Problems

Jean-Marie Bourjolly, P Gill, Gilbert Laporte, and Hélène Mercure

G-94-08

Sep 1993

Optimal Policies for Some Discrete Sequencing Problems Arising in Flexible Manufacturing

Jean-Marie Bourjolly, B Gaboune, Gilbert Laporte, and François Soumis

G-93-31

Sep 1993

A Generalized Insertion Algorithm for the Seriation Problem

Michel Gendreau, Alain Hertz, and Gilbert Laporte

G-93-29

Aug 1993

An Introduction to EXAMINE: A Flexible examination Scheduling System

Michael W. Carter, Gilbert Laporte, and John W. Chinneck

G-93-26

May 1993

An Exact Algorithm for the Dual Bin Packing Problem

Martine Labbé, Gilbert Laporte, and Silvano Martello

G-93-16

Apr 1992

A General Examination Scheduling System

Michael W. Carter, Gilbert Laporte, and John W. Chinneck

G-92-12

Feb 1992

Optimal Strip Sequencing Strategies for Flexible Manufacturing Operations in Two and Three Dimensions

B Gaboune, Gilbert Laporte, and François Soumis

G-92-06

Dec 1991

Expected Distances between Two Random Points in Rectangles and Rectangular Parallelepipeds

B Gaboune, Gilbert Laporte, and François Soumis

G-91-52

Nov 1991

Optimal Tool Partitioning Rules for Numerically Controlled Punch Press Operations

B Gaboune, Gilbert Laporte, and François Soumis

G-91-46

Jun 1991

A Tabu Search Heuristic for the Vehicle Routing Problem

Michel Gendreau, Alain Hertz, and Gilbert Laporte

G-91-31

Apr 1990

A Combinatorial Optimization Problem Arising in Dart Board Design

Horst A. Eiselt and Gilbert Laporte

G-90-19

Dec 1989

The Use of Domains in Multicriteria Decision Making

Horst A. Eiselt and Gilbert Laporte

G-89-42

Nov 1989

Branch and Bound Algorithms for the Multi-Product Assembly Line Balancing Problem

Ilana Berger, Jean-Marie Bourjolly, and Gilbert Laporte

G-89-41

Jan 1989

Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints

Martin Desrochers and Gilbert Laporte

G-89-03

Oct 1987

Formulations and Bounds for the Stochastic Capacitated Vehicle Routing Problem with Uncertain Supplies

Gilbert Laporte and François V. Louveaux

G-87-23

Jun 1987

Models and Exact Solutions for a Class of Stochastic Location-Routing Problems

Gilbert Laporte, François V. Louveaux, and Hélène Mercure

G-87-14

May 1987

The Selective Travelling Salesman Problem

Gilbert Laporte and Silvano Martello

G-87-15

Apr 1987

Trading Areas of Facilities with Different Sizes

Horst A. Eiselt and Gilbert Laporte

G-87-12

Mar 1987

Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems

Gilbert Laporte, Y Nobert, and S Taillefer

G-87-10

Mar 1987

Routing and Scheduling Within Job Shop Framework

Jacek Blazewicz and Gilbert Laporte

G-87-07

Feb 1987

Location-Routing Problems

Gilbert Laporte

G-87-05

Dec 1986

Balancing Hydraulic Turbine Runners: A Quadratic Assignment Problem

Gilbert Laporte and Hélène Mercure

G-86-20

Nov 1986

Combinatorial Optimization Problems Soft and Hard Requirements

Horst A. Eiselt and Gilbert Laporte

G-86-21

Nov 1986

Optimal Routing of Postal Trucks in Urban Areas

Gilbert Laporte, S Chapleau, Philippe-Eric Landry, and Hélène Mercure

G-86-18

Jun 1986

A Vehiche Flow Model for the Optimal Design of a Two-Echelon Distribution System

Gilbert Laporte and Y Nobert

G-86-15

May 1986

An Optimal Algorithm for a General Class of Asymmetrical Vehicle Routing Problems

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-86-14

May 1986

An Efficient Interchange Procedure for the Archaeological Seriation Problem

Gilbert Laporte and S Taillefer

G-86-13

May 1986

Optimal Sizes of Facilities on a Linear Market

Horst A. Eiselt, Gilbert Laporte, and G Pederzoli

G-86-12

Apr 1986

An Optimal Flow Circulation Algorithm for the Asymmetrical Multiple Travelling Salesman Problem

Gilbert Laporte, Y Nobert, and KN Trinh

G-86-11

Mar 1986

Cutting Planes Based on Bin Packing Solutions for the Capacitate Vehicle Routing Problem

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-86-10

Jan 1986

Maximizing User Convenience and Postal Service Efficiency in Post Box Location

Martine Labbé and Gilbert Laporte

G-86-03

Nov 1985

La construction d'horaires de travail

Gilbert Laporte and Y Nobert

G-85-22

Nov 1985

Vehicle Routing with Full Loads

Jacques Desrosiers, Gilbert Laporte, Michel Sauvé, François Soumis, and S Taillefer

G-85-21

Nov 1985

Solving a Family of Permutation Problems 0-1 Matrices

Gilbert Laporte

G-85-19

Oct 1985

Le traitement des exigences rigides et souples dans certains problèmes d'optimisation combinatoire

Gilbert Laporte and Horst A. Eiselt

G-85-17

Sep 1985

Generalized Subtour Elimination Constraints and Connectivity Constraints

Gilbert Laporte

G-85-15

Sep 1985

Meeting Scheduling, Orchestra Rehearsal and Archeology

Gilbert Laporte

G-85-14

Jun 1985

Exact Algorithms for the Vehicle Routing Problem

Gilbert Laporte and Y Nobert

G-85-11

Apr 1985

Un modèle de planification tactique pour l'amelioration de l'efficacité de l'industrie du camionnage au Canada

Gilbert Laporte, Jean-Marc Rousseau, and Jacques Roy

G-85-09

Mar 1985

Generalized Travelling Salesman Problem Through n Sets of Nodes: The Asymmetrical Case

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-85-07

Mar 1985

A Branch-and-Bound Algorithm for the Asymetrical Distance Constrained Vehicle Routing Problem

Gilbert Laporte, Y Nobert, and S Taillefer

G-85-05

Jan 1985

Finding the Shortest Hamiltonian Circuit Through n Clusters: A Lagrangean Relaxation Approach

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-85-01

Dec 1984

Dealing with Fuzziness in Some Highly Structured Combinatorial Problems

Gilbert Laporte

G-84-18

Nov 1984

Some Further Results on k-Star Constraints and Comb Inequalities

Gilbert Laporte and Jean-Marie Bourjolly

G-84-17

Sep 1984

The Problem of Assigning Students to Course Sections in a Large Engineering School

Gilbert Laporte and S Desroches

G-84-15

Mar 1984

Capacitated Location-Routing Problems

Gilbert Laporte, Y Nobert, and D Arpin

G-84-05

Feb 1984

An Exact Algorithm for the Asymetrical Capacitated Vehicle Routing Problem

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-84-04

Feb 1984

Optimal Solutions to Capacitated Multidepot Vehicle Routing Problems

Gilbert Laporte, Y Nobert, and D Arpin

G-84-02

Feb 1984

Network Models and Algorithms for Three Types of Vehicle Routing Problems

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-84-01

Nov 1983

The Generation of Chain Barring Constraints for Multidepot Vehicle Routing Problems

Gilbert Laporte and Y Nobert

G-83-34

Aug 1983

Optimal Routing Under Capacity and Distance Restrictions

Gilbert Laporte, Y Nobert, and Martin Desrochers

G-83-18

Jun 1983

Optimal Tour Planning with Specified Nodes

Gilbert Laporte, Hélène Mercure, and Y Nobert

G-83-14

Apr 1983

Finding the Shortest Cycle Through k Specified Nodes

Gilbert Laporte and Y Nobert

G-83-07

Feb 1983

Algorithmes de relaxation de contraintes pour le problème du voyageur de commerce symétrique et ses extensions

Gilbert Laporte and Y Nobert

G-83-02

Feb 1983

Comb Inequalities for the Vehicle Routing Problem

Gilbert Laporte and Y Nobert

G-83-01

Oct 1982

Integer Linear Programming Approach to the Vehicle Scheduling Problem

Gilbert Laporte

G-82-10

Sep 1982

A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem

Gilbert Laporte and Y Nobert

G-82-08

May 1982

Two Exact Algorithms for the Distance Constrained Vehicle Routing Problem

Gilbert Laporte, Y Nobert, and Martin Desrochers

G-82-05

Feb 1982

Examination Timetabling by Computer

Gilbert Laporte and S Desroches

G-82-03

May 1981

Elect: An Interactive Graphical System for the Automatic Generation of Electoral Maps

Nadia Thalmann, Yves Claude, Gilbert Laporte, and Jean-Marc Rousseau

G-81-06

Cahiers du GERAD

Gilbert Laporte

Annual Reports