Gilbert Laporte
BackCahiers du GERAD
149 results — page 2 of 8
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
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
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
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
Location-allocation problems arise in several contexts, including supply chain and data mining. In its most common interpretation, the basic problem consists...
BibTeX reference
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
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
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
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
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
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
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
In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxation...
BibTeX reference
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