Laporte Gilbert

Gilbert Laporte

Information about the author Gilbert Laporte will soon be added to the site.
Found 203 papers in total
The block layout shortest loop design problem
The block layout shortest loop design problem
2000
The purpose of this article is to formulate and solve a shortest loop problem...
Heuristics for minimizing tool switches when scheduling part types on a flexible machine
Heuristics for minimizing tool switches when scheduling part types on a flexible machine
1998
This article considers a tool loading problem whose objective is to minimize the...
A tabu search algorithm for the site dependent vehicle routing problem with time windows
A tabu search algorithm for the site dependent vehicle routing problem with time windows
2001
This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) can be viewed...
Location-arc routing problems
Location-arc routing problems
2001
Location-Arc Routing Problems (LARPs) are encountered in contexts where it is...
A tabu search algorithm for the capacitated shortest spanning tree problem
A tabu search algorithm for the capacitated shortest spanning tree problem
1997
The Capacitated Shortest Scanning Tree Problem consists of determining a shortest...
Solving arc routing problems with turn penalties
Solving arc routing problems with turn penalties
2001
In several arc routing problems, it is necessary to take turn penalties into account...
Classical and modern heuristics for the vehicle routing problem
Classical and modern heuristics for the vehicle routing problem
2000
This article is a survey of heuristics for the Vehicle Routing Problem. It is divided...
A tabu search heuristic for the capacitated arc routing problem
A tabu search heuristic for the capacitated arc routing problem
2000
The Capacitated Arc Routing Problem arises in several contexts where streets or roads...
Optimization methods for the planning of rapid transit systems
Optimization methods for the planning of rapid transit systems
2000
A central question when planning rapid transit systems is the determination of...
Heuristics for finding k-clubs in an undirected graph
Heuristics for finding k-clubs in an undirected graph
2000
In a graph G , a k -club is a vertex set inducing a subgraph of diameter k . These...
Heuristics for the location of inspection stations on a network
Heuristics for the location of inspection stations on a network
2000
This article considers the preventive flow interception problem (FIP) on a network....
Heuristics for the multi-vehicle covering tour problem
Heuristics for the multi-vehicle covering tour problem
2000
The multi-vehicle covering tour problem is defined on a graph G = ( V ∪ W, E ),...
An optimality cut for mixed integer linear programs
An optimality cut for mixed integer linear programs
1999
We derive the penalty cut, a simple optimality cut of general applicability in pure or...
The covering tour problem
The covering tour problem
1997
The Covering Tour Problem (CTP) is defined on a graph G = ( V ∪ W, E ),...
An approximation algorithm for the traveling salesman problem with backhauls
An approximation algorithm for the traveling salesman problem with backhauls
1997
The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G =...
The plant location problem: New models and research prospects
The plant location problem: New models and research prospects
1996
The plant location problem has been studied for many years. Yet, a number of important...
The art and science of designing rotating schedules
The art and science of designing rotating schedules
1999
Rotating schedules are commonly used in a number of industries and public services...
A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
1996
This paper considers a version of the stochastic vehicle routing problem where...
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
1996
The clustered traveling salesman problem is an extension of the classical traveling...
Heuristics for the traveling salesman problem with pickup and delivery
Heuristics for the traveling salesman problem with pickup and delivery
1999
We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), an...
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
1999
The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical...
An emergency vehicle dispatching system for an electric utility in Chile
An emergency vehicle dispatching system for an electric utility in Chile
1999
Chilean companies have only recently begun developing and implementing computerised...
Demand allocation functions
Demand allocation functions
1998
In this paper we formulate a customer choice model according to which customers...
Tour location problems
Tour location problems
1997
Several problems arising in distribution management, manufacturing and...
Papers per page: