# Gilbert Laporte

Back## Publications

### Cahiers du GERAD

**Gilbert Laporte**

In 1960, Ailsa Land and Alison Doig published the first linear programming-based branch-and-bound algorithm for the solution of mixed integer linear progra...

BibTeX reference**Gilbert Laporte**

The Network Design Problem with Vulnerability Constraints and Probabilistic Edge Reliability (NDPVC-PER) is an extension of the NDPVC obtained by additionall...

BibTeX reference**Gilbert Laporte**

In July 2022, I received the EURO Gold medal at the 32nd EURO Conference held in Espoo, Finland. On this occasion I was asked to deliver a 30-minute presenta...

BibTeX reference

In e-commerce warehouses, online retailers increase their efficiency by using a mixed-shelves (or scattered storage) concept, where unit loads are purposeful...

BibTeX referenceThe design of rapid transit networks

**Gilbert Laporte**and Juan A. Mesa

Metros and other rapid transit systems increase the mobility of urban populations while decreasing congestion and pollution. There are now 187 cities with a ...

BibTeX reference

This paper introduces two classes of location problems with interconnected facilities. These problems differ from classical location problems in the sense ...

BibTeX referenceThe impact of synchronizing drivers breaks and recharging operations for electric vehicles

Electric commercial vehicles (ECVs) are gaining importance as they are seen to provide a sustainable mean of transportation. However, practitioners still see...

BibTeX reference

This paper reviews the literature on vehicle routing problems and location-routing problems with intermediate stops. Besides providing concise paper excerpts...

BibTeX reference**Gilbert Laporte**

The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of very large-scale capacitated arc routing problems, with or witho...

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

Location-routing problems (LRPs) with intra-route facilities have recently gained the attention of researchers and practitioners. Intra-route facilities are ...

BibTeX referenceComputational comparison of several algorithms for the minimum cost perfect matching problem

**Gilbert Laporte**

The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected graph. Our work is moti...

BibTeX reference

This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is mod...

BibTeX reference

We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. D...

BibTeX reference

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...

BibTeX referenceThe Tube Challenge

**Gilbert Laporte**

The Tube Challenge consists of visiting all stations of the London Underground in the least possible time. The competition started in 1959 and the current r...

BibTeX reference

In this article, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloa...

BibTeX reference

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-first-out (LIFO) loading constr...

BibTeX referenceScheduling Issues in Vehicle Routing

**Gilbert Laporte**

Scheduling often plays an important role in vehicle routing. This paper describes several applications in which the author has been involved in recent years...

BibTeX referencePlanning Rapid Transit Networks

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

Le but de cet article est de décrire et de résoudre un nouveau et important problème auquel font face les compagnies maritimes spécialisées dans le transport...

BibTeX reference**Gilbert Laporte**

The purpose of this paper is to present and solve a new, important planning problem faced by many shipping companies dealing with the transport of bulk produ...

BibTeX reference**Gilbert Laporte**

The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose ...

BibTeX referenceFifty Years of Vehicle Routing

**Gilbert Laporte**

The <i>Vehicle routing Problem</i> (VRP) was introduced 50 years ago by Dantzig and Ramser under the title "The Truck Dispatching Problem". The study of the ...

BibTeX reference

In the <i>Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows</i>, the set of customers is the union of <i>delivery customers</i> and...

BibTeX reference**Gilbert Laporte**

The <i>Generalized Vehicle Routing Problem</i> (GVRP) is an extension of the classical <i>Vehicle Routing Problem</i> (VRP) in which the vertex set is partit...

BibTeX reference**Gilbert Laporte**

We compare the effectiveness and efficiency of alternative operational dispatching policies that are integrated into the design phase of a circular material ...

BibTeX reference

Frequency hopping is a feature in GSM (Global System for Mobile Communications) cellular systems in which a frequency carrying the communication rapidly chan...

BibTeX reference

This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a ...

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

**Gilbert Laporte**

Location-allocation problems arise in several contexts, including supply chain and data mining. In its most common interpretation, the basic problem consists...

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

The aim of this paper is to propose a model for the design of a robust rapid transit network. In this paper, a network is said to be robust when the effect o...

BibTeX reference**Gilbert Laporte**, Francesco Mari, Roberto Musmanno, and Ornella Pisacane

This paper describes a new heuristic for the well-known <i>Undirected Rural Postman Problem</i>. It consists of two steps: it first constructs a partial so...

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

When constructing a metro alignment under a historical city centre, it is important to generate a cost effective path while maintaining a minimum distance be...

BibTeX reference**Gilbert Laporte**

In the <i>Vehicle Routing Problem </i> (VRP), the aim is to design a set of <i>m</i> minimum cost vehicle routes through <i>n</i> customer locations, so that...

BibTeX reference**Gilbert Laporte**, and Roberto Musmanno

The <i>Capacitated Arc Routing Problem</i> (CARP) consists of determining a set of least cost capacitated vehicle routes servicing a set of arcs. In this p...

BibTeX reference**Gilbert Laporte**

In One-to-Many-to-One Single Vehicle Pickup and Delivery Problems a vehicle based at the depot must make deliveries and pickups at customers locations befor...

BibTeX reference

In modern transportation systems, the potential for further decreasing the costs of fulfilling customer requests is severely limited while market competitio...

BibTeX reference**Gilbert Laporte**

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pickup and delivery requests between...

BibTeX reference

In one-to-one <i>Pickup and Delivery Problems</i> (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in o...

BibTeX referenceA Review and Comparative Analysis of Several Asymmetric Travelling Salesman Problem Formulations

**Gilbert Laporte**

In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxation...

BibTeX reference**Gilbert Laporte**

This paper considers the swapping problem on a tree. In this problem at most one object of some type is available at each vertex, and each vertex also reque...

BibTeX reference

Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the requ...

BibTeX reference

This paper examines the plant location problem under the objective of maximizing return-on-investment. However, in place of the standard assumption that all...

BibTeX reference**Gilbert Laporte**

Several variants and generalizations of the Or-opt heuristic for the <i>Symmetric Traveling Salesman Problem</i> are developed and compared on random and pla...

BibTeX reference

This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...

BibTeX reference**Gilbert Laporte**, and Mehdi Sharifyazdi

The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...

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

**Gilbert Laporte**, and Robert Ortiz

In this study we develop optimization, decomposition, and heuristic procedures to design a unidirectional loop flow pattern along with the pickup and delive...

BibTeX reference**Gilbert Laporte**

A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...

BibTeX reference**Gilbert Laporte**, and Frédéric Semet

In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...

BibTeX reference**Gilbert Laporte**

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

BibTeX reference**Gilbert Laporte**, and Tolga Bektas

Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

BibTeX reference**Gilbert Laporte**

This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...

BibTeX reference**Gilbert Laporte**

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...

BibTeX reference**Gilbert Laporte**

In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...

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

The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...

BibTeX reference**Gilbert Laporte**

This article considers the (1|<i>X<sub>p</sub></i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...

BibTeX reference**Gilbert Laporte**, and Silvano Martello

In the <i>Maximum Cardinality Bin Packing Problem</i>, we are given <i>m</i> bins of capacity <i>c</i> and <i>n</i> items of weights <i>w<sub>i</sub></i> (...

BibTeX reference**Gilbert Laporte**

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...

BibTeX reference**Gilbert Laporte**and U Palekar

The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...

BibTeX reference**Gilbert Laporte**, and Francisco A. Ortega

This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...

BibTeX referenceA General Multi-Shift Scheduling System

**Gilbert Laporte**and Gilles Pesant

Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...

BibTeX referenceAmbulance Location and Relocation Models

**Gilbert Laporte**, and Frédéric Semet

This article traces the evolution of ambulance location and relocation models proposed over the past thirty years. The models are classified in two main ca...

BibTeX reference**Gilbert Laporte**

The Esau-Williams algorithm is one of the best known heuristics for the Capacitated Minimum Spanning Tree Problem. This research note describes a simple en...

BibTeX reference

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

BibTeX referenceLocation-Arc Routing Problems

**Gilbert Laporte**

<i>Location-Arc Routing Problems</i> (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversal of a subset of edges ...

BibTeX reference

In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a trans...

BibTeX reference

In this paper, we prove that the maximum <i>k</i>-club problem defined on an undirected graph is NP-hard. We also give an integer programming formulation f...

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

This article is a survey of heuristics for the <i>Vehicle Routing Problem</i>. It is divided into two parts: classical and modern heuristics. The first pa...

BibTeX reference**Gilbert Laporte**and Frédéric Semet

Over the last thirty-five years several heuristics have been proposed for the <i>Vehicle Routing problem</i>. This article reviews the main classical heuris...

BibTeX reference**Gilbert Laporte**, and Jean-Yves Potvin

In recent years several <i>metaheuristics</i> have been proposed for the <i>Vehicle Routing Problem</i>. This article reviews the main metaheuristics for th...

BibTeX reference**Gilbert Laporte**

The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties ...

BibTeX reference**Gilbert Laporte**

Il est généralement reconnu que le processus de découpage électoral doit être à l'abri du gerrymandering et de l'intervention politique. L'utilisation de mé...

BibTeX reference**Gilbert Laporte**, and Chelliah Sriskandarajah

The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. Th...

BibTeX reference

In a graph <i>G</i>, a <i>k-club</i> is a vertex set inducing a subgraph of diameter <i>k</i>. These structures play an important role in several applicati...

BibTeX reference**Gilbert Laporte**

Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...

BibTeX reference**Gilbert Laporte**

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These incl...

BibTeX reference**Gilbert Laporte**and François V. Louveaux

In recent years, several advances have been made towards the solution of stochastic vehicle routing problems (SVRPs). In particular, the Integer <i>L</i>-Sh...

BibTeX reference**Gilbert Laporte**

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacita...

BibTeX reference

This article describes the results of a study aimed at improving linen delivery operations in a large teaching hospital in Montreal. Improvements over the p...

BibTeX reference

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a fl...

BibTeX referencePath, Tree and Cycle Location

**Gilbert Laporte**, and Inmaculada Rodriguez-Martin

<i>Extensive facilities</i> are structures that are too large to be considered as single points. In the first part of this paper we propose integer program...

BibTeX referenceCovering a Graph with Cycles

This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...

BibTeX reference**Gilbert Laporte**

This paper contains some 80 annotated references on the vehicle routing problem. The titles are organized as follows: 1) the classical VRP with capacity an...

BibTeX reference**Gilbert Laporte**

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These inclu...

BibTeX reference

The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...

BibTeX reference**Gilbert Laporte**, A. Asef-Vaziri, and Chelliah Sriskandarajah

In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertic...

BibTeX reference

In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...

BibTeX reference**Gilbert Laporte**

Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...

BibTeX reference**Gilbert Laporte**

In 1986, Carter published a survey of papers on practical examination timetabling. In the intervening years, there have been a number of new applications, ...

BibTeX reference

The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems su...

BibTeX reference**Gilbert Laporte**, and Sau Yan Lee

Examination timetabling is an important operational problem in many schools, colleges and universities. The authors have developed a computerized examinatio...

BibTeX reference

This paper describes strip sequencing models for large scale traveling salesman problems arising in flexible manufacturing operations in two or three discre...

BibTeX reference

It is well known that several combinatorial optimization problems can be nicely and readily modeled as an appropriate quadratic 0-1 function to be optimized...

BibTeX reference**Gilbert Laporte**, and Silvano Martello

In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to ...

BibTeX reference

The purpose of this paper is to formulate and solve an optimization problem arising in the operations of a numerical control machine such as a punch press. ...

BibTeX reference

Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...

BibTeX reference**Gilbert Laporte**, and John W. Chinneck

The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...

BibTeX reference

In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufac...

BibTeX reference

In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...

BibTeX reference**Gilbert Laporte**, and John W. Chinneck

Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...

BibTeX reference

The purpose of this paper is to describe a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algori...

BibTeX reference**Gilbert Laporte**

This paper describes a domain criterion for a multicriteria problem, given a single decision maker. It then outlines possibilities for aggregating individua...

BibTeX reference**Gilbert Laporte**

In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under diffe...

BibTeX reference

This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...

BibTeX reference**Gilbert Laporte**

This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...

BibTeX reference**Gilbert Laporte**and François V. Louveaux

In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...

BibTeX reference**Gilbert Laporte**and Silvano Martello

Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...

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

This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...

BibTeX reference**Gilbert Laporte**

In this paper we analyze the problem of finding the trading area for a facility on a linear market. Given the objective of maximizing profit, we first build...

BibTeX reference**Gilbert Laporte**, Y Nobert, and S Taillefer

This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. ...

BibTeX reference**Gilbert Laporte**

In this paper, an extension of the classical scheduling problem is considered. It is assumed that tasks are processed on parallel processors, available at d...

BibTeX referenceLocation-Routing Problems

**Gilbert Laporte**

Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in ...

BibTeX referenceVehicle Routing with Full Loads

This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling sale...

BibTeX reference**Gilbert Laporte**and Hélène Mercure

Hydraulic turbine runners are used in electricity generation. These consist of a cylinder around which are welded, at regular spacings, a number of blades w...

BibTeX reference**Gilbert Laporte**

In this paper the authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how...

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

Post box collection constitutes a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this opera...

BibTeX reference**Gilbert Laporte**and Y Nobert

This paper describes a vehicle flow model for a two-echelon location-routing problem involving deliveries from primary to secondary facilities and from secon...

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

**Gilbert Laporte**, Y Nobert, and S Taillefer

The aim of this paper is to develop an exact algorithm for the asymmetrical distance constrained vehicle routing problem. The problem is solved by means of ...

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

This paper describes an exact algorithm for a general class of asymmetrical vehicle routing problems. Vehicle routes start and end at a central depot. Visi...

BibTeX reference**Gilbert Laporte**and S Taillefer

This paper considers the archeological seriation problem defined over incidence matrices. Two procedures adapted from interchange algorithms for the travell...

BibTeX reference**Gilbert Laporte**, and G Pederzoli

Let n facilities be located on a bounded linear market and assume that demand for a homogenous commodity is uniformly distributed along that market. Initial...

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

This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian cirnui...

BibTeX referenceAn Optimal Flow Circulation Algorithm for the Asymmetrical Multiple Travelling Salesman Problem

**Gilbert Laporte**, Y Nobert, and KN Trinh

This paper describes an exact algorithm for the asymmetrical multiple travelling salesman problem. The problem is solved by branch and bound and a flow circ...

BibTeX reference**Gilbert Laporte**

This paper deals with the optimal location of post boxes in an urban or in a rural environment. The problem consists of selecting sites for post boxes which...

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

This paper presents an integer linear programming formulation for the symmetrical capacitated vehicle routing problem (CVRP). This formulation includes degr...

BibTeX reference**Gilbert Laporte**and Y Nobert

Cet article décrit dive3rs types d'horaires de travail en vigueur dans les entreprises et les services publics, ainsi que les principales méthodes de recherc...

BibTeX reference**Gilbert Laporte**

This paper examines a family of permutation problems on 0-1 matrices. These problems arise in scheduling and in archaeological seriation. Three exact algor...

BibTeX reference**Gilbert Laporte**and Y Nobert

This paper presents a survey of exact algorithms for various types of vehicle routing problems. Algorithms are divided into three main categories: direct s...

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

**Gilbert Laporte**and Horst A. Eiselt

Le présent article décrit des méthodes algorithmiques de traitement des exigences rigides et souples dans certains problèmes complexes d'optimisation combina...

BibTeX reference**Gilbert Laporte**

This paper examines some properties of generalized subtour elimination constraints and connectivity constraints used in a variety of routing problems.

BibTeX reference**Gilbert Laporte**

People who attend several meetings on the same day often have unusable pieces of free time between meetings. These can be reduced or eliminated through bett...

BibTeX reference**Gilbert Laporte**and S Desroches

In some universities, complete course schedules are made available to students at the time of registration. Typically these schedules give the room number, ...

BibTeX reference**Gilbert Laporte**, Y Nobert, and D Arpin

In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construc...

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

The aim of this paper is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e. the multiple travelling salesman proble...

BibTeX reference**Gilbert Laporte**, Jean-Marc Rousseau, and Jacques Roy

Ce rapport décrit un modèle de planification tactique pour l'amélioration de l'industrie du camionnage au Canada. après une brève description du problème, o...

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

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

This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters,...

BibTeX reference**Gilbert Laporte**

This paper describes algorithmic approaches for dealing with fuzziness in some highly structured combinatorial problems. A general framework is described an...

BibTeX reference**Gilbert Laporte**and Jean-Marie Bourjolly

**Gilbert Laporte**, Y Nobert, and Martin Desrochers

This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance constraints. The method uses const...

BibTeX reference**Gilbert Laporte**, Y Nobert, and D Arpin

This paper provides an integer linear programming formulation and an exact algorithm for a class of multidepot vehicle routing problems. This formulation co...

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

This paper provides integer linear programming formulations for three types of vehicle routing problems. Appropriate relaxations of these formulations lend ...

BibTeX reference**Gilbert Laporte**and Y Nobert

This paper provides an integer linear programming formulation for a class of multidepot vehicle routing problems. This formulation contains degree constrain...

BibTeX reference**Gilbert Laporte**and Y Nobert

Le problème du voyageur de commerce (PVC) symétrique consiste à déterminer le cycle le plus court passant exactement une fois par chacun des noeuds d'un grap...

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

This paper consider the problem of determining the shortest circuit or cycle in a graph containing n nodes and such that (i) each of k nodes (k ≤ n) i...

BibTeX reference**Gilbert Laporte**and Y Nobert

This paper shows the existence of a class of valid inequalities for two types of vehicle routing problems. These inequalities constitute a generalization of...

BibTeX reference**Gilbert Laporte**and Y Nobert

Let G = (N,E) be an undirected graph where N is the set of nodes and E, the set of edges. Let C be a symmetrical distance matrix defined on N<sup>2</sup> an...

BibTeX reference**Gilbert Laporte**and S Desroches

This paper describes an automatic procedure for constructing examination timetables in universities. The program produces schedules in which there are no co...

BibTeX reference**Gilbert Laporte**

This paper considers a version of the vehicle scheduling problem (VSP) in which a non-negative weight is assigned to each city to be visited and where all ve...

BibTeX reference**Gilbert Laporte**and Y Nobert

This paper considers a version of the vehicle routing problem in which a non-negative weight is assigned to each city to be visited and where all vehicles ar...

BibTeX reference**Gilbert Laporte**, Y Nobert, and Martin Desrochers

This paper considers a version of the vehicle routing problem in which all vehicles are identical and where the distance travelled by any vehicle may not exc...

BibTeX reference**Gilbert Laporte**, and Jean-Marc Rousseau

When an electoral map is set up, various socio-economical, political and geographical parameters are taken into consideration. To evaluate the importance of...

BibTeX reference### Articles

**Gilbert Laporte**

**Gilbert Laporte**, Sonja Rohmer, and Frans C.A.M. Cruijssen

**Gilbert Laporte**

**Gilbert Laporte**, and Maximilian Schiffer

**Gilbert Laporte**, and Ying Yang

**Gilbert Laporte**, Michèle Breton, Andrea Lodi, Georges Zaccour, and et al.

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Arild Hoff

**Gilbert Laporte**, and Xueting He

**Gilbert Laporte**, Zheyi Tan, and Kai Wang

**Gilbert Laporte**, Wen Yi, and Tianyi Fan

**Gilbert Laporte**, and Zheyi Tan

**Gilbert Laporte**

**Gilbert Laporte**, and R. Baldacci

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, R. Baldacci, and Chenghao Wang

**Gilbert Laporte**

**Gilbert Laporte**, and Andrea Spinosa

**Gilbert Laporte**

**Gilbert Laporte**, and Zheyi Tan

**Gilbert Laporte**, and Carlos Guedes Soares

**Gilbert Laporte**

**Gilbert Laporte**, Marie-Ève Rancourt, Jessica Rodríguez-Pereira, and Selene Silvestri

**Gilbert Laporte**, and Andrea Lodi

**Gilbert Laporte**

**Gilbert Laporte**, and Marco Pavone

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Marco Formentini

**Gilbert Laporte**

**Gilbert Laporte**, and Carmela Piccolo

**Gilbert Laporte**, and Grit Walther

**Gilbert Laporte**, and Francesca Vocaturo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Argyris Kanellopoulos, Jacqueline M. Bloemhof, and Behzad Behdani

**Gilbert Laporte**, and Christophe Wilbaut

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Carman Ka Man Lee

**Gilbert Laporte**

**Gilbert Laporte**, and Maria Grazia Speranza

**Gilbert Laporte**, and Piotr Matl

**Gilbert Laporte**, and Ilknur Tükenmez

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Christophe Wilbaut

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Juan A. Mesa

**Gilbert Laporte**

**Gilbert Laporte**, Enrique Benavent, and Antonio Martínez-Sykora

**Gilbert Laporte**

**Gilbert Laporte**, Francesca Guerriero, and Luigi Di Puglia Pugliese

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Jessica Rodríguez-Pereira

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Bülent Çatay

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Juan A. Mesa

**Gilbert Laporte**

**Gilbert Laporte**, and Wencheng Wang

**Gilbert Laporte**, and Yi He

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Yiwei Wu

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Yingwu Chen, and Yingguo Chen

**Gilbert Laporte**, Frans C.A.M. Cruijssen, Argyris Kanellopoulos, and Jacqueline M. Bloemhof

**Gilbert Laporte**, Frédéric Meunier, and Roberto Wolfler-Calvo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Tom Van Woensel

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Jessica Rodríguez-Pereira

**Gilbert Laporte**, Isaac Plana, and José M. Sanchis

**Gilbert Laporte**

**Gilbert Laporte**, Julie Paquette, and Marie-Ève Rancourt

**Gilbert Laporte**, and Vladimir Marianov

**Gilbert Laporte**

**Gilbert Laporte**, Panagiotis P. Repoussis, and Christos D. Tarantilis

**Gilbert Laporte**

**Gilbert Laporte**, Yingwu Chen, and Renjie He

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Marco Veneroni

**Gilbert Laporte**

**Gilbert Laporte**, Juan A. Mesa, and Federico Perea

**Gilbert Laporte**, and Mark Stobbe

**Gilbert Laporte**, and Raffaele Cerulli

**Gilbert Laporte**, Francisco A. Ortega, Miguel Ángel Pozo, and Justo Puerto

**Gilbert Laporte**, Anouar Jamali, and Driss Bouami

**Gilbert Laporte**

**Gilbert Laporte**, and Horacio Hideki Yanasse

**Gilbert Laporte**, and Juan A. Mesa

**Gilbert Laporte**, Vladimir Marianov, and Luigi Moccia

**Gilbert Laporte**, and André Langevin

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Tom Van Woensel, and Jan C. Fransoo

**Gilbert Laporte**, and Raffaele Cerulli

**Gilbert Laporte**

**Gilbert Laporte**, and Juan A. Mesa

**Gilbert Laporte**, and Francisco A. Ortega

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Antonio M. Rodríguez Chía

**Gilbert Laporte**, and Iris F.A. Vis

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Vedat Verter

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Frédéric Meunier, and Roberto Wolfler-Calvo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**and M.M.B. Pascoal

**Gilbert Laporte**

**Gilbert Laporte**, Yugang Yu, and René de Koster

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Ben Watkins

**Gilbert Laporte**, Yajie Liu, and Tao Zhang

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**, and Daniele Vigo

**Gilbert Laporte**, and Juan A. Mesa

**Gilbert Laporte**, and Emanuele Manni

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Oli B.G. Madsen, Anders V. Norrelund, and Allan Olsen

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Roberto Wolfler-Calvo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Dilson Lucas Pereira, and Adam Wojciechowski

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Juan A. Mesa

**Gilbert Laporte**

**Gilbert Laporte**, P Toth, and Daniele Vigo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and M.M.B. Pascoal

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Vladimir Marianov

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Daniele Vigo

**Gilbert Laporte**, and Bo Guo

**Gilbert Laporte**, Juan A. Mesa, and Federico Perea

**Gilbert Laporte**

**Gilbert Laporte**, and G.R. Mauri

**Gilbert Laporte**

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Bo Guo

**Gilbert Laporte**

**Gilbert Laporte**, and Øyvind Halskau

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**and M.M.B. Pascoal

**Gilbert Laporte**

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**, and Bo Guo

**Gilbert Laporte**, and Kjetil Fagerholt

**Gilbert Laporte**

**Gilbert Laporte**

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

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

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Federico Pasin

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**and M.M.B. Pascoal

**Gilbert Laporte**, Stefan Ropke, and M.P. Valentini

**Gilbert Laporte**, Luigi Moccia, and G. Sorrentino

**Gilbert Laporte**

**Gilbert Laporte**, and Bo Guo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Federico Pasin, and Stefan Ropke

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Vladimir Marianov

**Gilbert Laporte**

**Gilbert Laporte**, and Juan-José Salazar-González

**Gilbert Laporte**

**Gilbert Laporte**, Juan A. Mesa, and Federico Perea

**Gilbert Laporte**

**Gilbert Laporte**, Jacques Renaud, and Fayez F. Boctor

**Gilbert Laporte**, Roberto Musmanno, and Francesca Vocaturo

**Gilbert Laporte**, and Francesco Mari

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, T. Melo, and Stefan Nickel

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and I. Norstad

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and J. Larsen

**Gilbert Laporte**

**Gilbert Laporte**, and Daniele Vigo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Jacques Roy

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**

**Gilbert Laporte**, and Arne Løkketangen

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

**Gilbert Laporte**

**Gilbert Laporte**, and P.R. Harper

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Fayez F. Boctor, and Jacques Renaud

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Federico Pasin

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Federico Pasin

**Gilbert Laporte**, Nenad Mladenović, and Dragan Urosević

**Gilbert Laporte**

**Gilbert Laporte**, and Robert Ortiz

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Vincent Raymond

**Gilbert Laporte**, and M.F. Monaco

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Stefan Ropke, and Georges Zaccour

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Luigi Moccia

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Luigi Moccia

**Gilbert Laporte**, and Silvano Martello

**Gilbert Laporte**

**Gilbert Laporte**, Reza Zanjirani Farahani, and Elnaz Miandoabchi

**Gilbert Laporte**, and Jacques Roy

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Mehdi Sharifyazdi

**Gilbert Laporte**

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, Inmaculada Rodriguez-Martin, and Juan-José Salazar-González

**Gilbert Laporte**

**Gilbert Laporte**, Juan A. Mesa, Francisco A. Ortega, and I. Sevillano

**Gilbert Laporte**, Pasquale Legato , and Luigi Moccia

**Gilbert Laporte**, E. Selvarajah, and Chelliah Sriskandarajah

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, and Francisco A. Ortega

**Gilbert Laporte**

**Gilbert Laporte**and Gilles Pesant

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

**Gilbert Laporte**, and Tolga Bektas

**Gilbert Laporte**, and Zuo-Jun Shen

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**, and Anne Mercier

**Gilbert Laporte**

**Gilbert Laporte**, and Jacques Renaud

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Inmaculada Rodríguez Martin, and Juan-José Salazar-González

**Gilbert Laporte**

**Gilbert Laporte**, and Silvano Martello

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**, J. Riera-Ledesma, and Juan-José Salazar-González

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Frédéric Semet

**Gilbert Laporte**, and Jacques Renaud

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, E. Selvarajah, and Chelliah Sriskandarajah

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and Sau Yan Lee

**Gilbert Laporte**and S Desroches

### Books

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, Stefan Nickel, and Francisco Saldanha da Gama

**Gilbert Laporte**, Stefan Nickel, and Francisco Saldanha da Gama

**Gilbert Laporte**

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, and Roberto Musmanno

**Gilbert Laporte**, and S. Neuman

**Gilbert Laporte**

**Gilbert Laporte**, and Vedat Verter

**Gilbert Laporte**

### Book chapters

**Gilbert Laporte**and Juan A. Mesa

**Gilbert Laporte**, Stefan Nickel, and Francisco Saldanha da Gama

**Gilbert Laporte**, and Juan A. Mesa

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

**Gilbert Laporte**

**Gilbert Laporte**, Stefan Nickel, and Francisco Saldanha da Gama

**Gilbert Laporte**and Juan A. Mesa

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Stefan Ropke, and Thibaut Vidal

**Gilbert Laporte**, François V. Louveaux, Frédéric Semet, and A. Thirion

**Gilbert Laporte**

**Gilbert Laporte**, and Stefan Ropke

**Gilbert Laporte**, Jean-Yves Potvin, and Martin W.P. Savelsbergh

**Gilbert Laporte**, Martin W.P. Savelsbergh, and Daniele Vigo

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, and JS Sormany

**Gilbert Laporte**

**Gilbert Laporte**, Martin W.P. Savelsbergh, and Daniele Vigo

**Gilbert Laporte**, Jean-Yves Potvin, and Martin W.P. Savelsbergh

### Proceedings

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**

**Gilbert Laporte**, Juan A. Mesa, and Federico Perea

**Gilbert Laporte**

**Gilbert Laporte**, Angel Marín, Juan A. Mesa, and Francisco A. Ortega