Laporte Gilbert

Gilbert Laporte

Information about the author Gilbert Laporte will soon be added to the site.
Found 203 papers in total
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
2010
The aim of this paper is to introduce a new ant colony optimization procedure for the...
Dynamic transportation of patients in hospitals
2009
This study analyzes and solves a patient transportation problem arising in large...
A branch-and-cut algorithm for the nonpreemptive swapping problem
2009
In the Swapping Problem (SP), we are given a complete graph, a set of object types,...
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
2008
This article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in...
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
2007
This paper addresses a variation of the traveling salesman problem with pickup and...
Heuristics for the m–Peripatetic Salesman Problem
2009
The m –Peripatetic Salesman Problem ( m –PSP) is defined on a undirected...
The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan
2008
The integrated production and transportation scheduling problem (PTSP) with capacity...
A memetic heuristic for the generalized quadratic assignment problem
2006
In the generalized quadratic assignment problem (GQAP) we are given n weighted...
Heuristic and lower bound for a stochastic location–routing problem
2007
In this article a stochastic location–routing problem is defined and cast as a...
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
2007
Earth observation satellites are platforms equipped with optical instruments that...
The service allocation problem at the Gioia Tauro Maritime Terminal
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard...
Exact and heuristic procedures for the material handling circular flow path design problem
2007
In this study we develop optimization, decomposition, and heuristic procedures to...
The multi-depot vehicle routing problem with inter-depot routes
2007
This article addresses an extension of the multi-depot vehicle routing problem in...
The undirected m-peripatetic salesman problem: polyhedral results and new algorithms
2007
In the m-peripatetic salesman problem (m-PSP), the aim is to determine m edge disjoint...
A tabu search heuristic for the quay crane scheduling problem
2007
This paper proposes a tabu search heuristic for the Quay Crane Scheduling Problem...
The dial-a-ride problem: models and algorithms
2007
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for...
A covering tour model for planning mobile health care facilities in Suhum District, Ghana
1998
The provision of adequate primary health care in developing countries is often...
Designing an efficient method for tandem automated guided vehicle (AGV) network design problem using tabu search
2006
A tandem AGV configuration connects all cells of a manufacturing area by means of...
The black and white traveling salesman problem
2006
The black and white traveling salesman problem (BWTSP) is defined on a graph G whose...
Scheduling and lot streaming in flowshops with no-wait in process
2003
Lot streaming involves splitting a production lot into a number of sublots, in order...
A continuous model for multistore competitive location
2005
This paper presents a simple model to determine the location strategies of two retail...
Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
2007
Several variants and generalizations of the Or-opt heuristic for the Symmetric...
The pickup and delivery problem with time windows and transshipment
2006
Pickup and delivery problems with time windows are frequently encountered by courier...
Antenna positioning in mobile telecommunication networks
2006
This paper examines the Antenna Positioning Problem in cellular networks, involving...
Papers per page: