Gilbert Laporte

Back

Cahiers du GERAD

146 results — page 1 of 8

, , , , and

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

BibTeX reference
and

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
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
and

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 reference
, , and

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

BibTeX reference
and

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
, , , and

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
, , , and

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 reference

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
, , and

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
, , and

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

BibTeX reference

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 reference
, , , and

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
, , and

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

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 reference

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
, , , and

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