Gilbert Laporte
RetourCahiers du GERAD
149 résultats — page 2 de 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 ...
référence BibTeXFifty 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 ...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
We compare the effectiveness and efficiency of alternative operational dispatching policies that are integrated into the design phase of a circular material ...
référence BibTeX
Frequency hopping is a feature in GSM (Global System for Mobile Communications) cellular systems in which a frequency carrying the communication rapidly chan...
référence BibTeX
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a ...
référence BibTeXA 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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
In modern transportation systems, the potential for further decreasing the costs of fulfilling customer requests is severely limited while market competitio...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXA 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...
référence BibTeX
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...
référence BibTeX
Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the requ...
référence BibTeX