Laporte G.

G. Laporte

Information about the author G. Laporte will soon be added to the site.
Found 25 papers in total
The maximum return-on-investment plant location problem with market share
The maximum return-on-investment plant location problem with market share
2008
This paper examines the plant location problem under the objective of maximizing...
An exact algorithm for the petrol station replenishment problem
An exact algorithm for the petrol station replenishment problem
2008
In the petrol station replenishment problem (PSRP), the aim is to deliver petroleum...
Solving a vehicle-routing problem arising in soft-drink distribution
Solving a vehicle-routing problem arising in soft-drink distribution
2006
The problem studied in this article arises from the distribution of soft drinks and...
The maximal expected coverage relocation problem for emergency vehicles
The maximal expected coverage relocation problem for emergency vehicles
2006
In the Maximal Expected Coverage Relocation Problem the aim is to provide a dynamic...
An analytical approach to the facility location and capacity acquisition problem under demand uncertainty
An analytical approach to the facility location and capacity acquisition problem under demand uncertainty
2005
This article presents an analysis of facility location and capacity acquisition under...
Efficient heuristics for Median Cycle Problems
Efficient heuristics for Median Cycle Problems
2004
This article proposes a number of efficient heuristics for two versions of the Median...
A general multi-shift scheduling system
A general multi-shift scheduling system
2004
Rotating work schedules are encountered in several industries and public sector...
The Dial-a-Ride Problem (DARP): Variants, modelling issues and algorithms
The Dial-a-Ride Problem (DARP): Variants, modelling issues and algorithms
2003
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for...
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
2004
This note introduces a refinement to a previously proposed tabu search algorithm for...
Models and algorithms for the dynamic-demand joint replenishment problem
Models and algorithms for the dynamic-demand joint replenishment problem
2004
This paper considers the problem of coordinated ordering of items having deterministic...
Exact solution of the generalized routing problem through graph transformations
Exact solution of the generalized routing problem through graph transformations
2003
In the general routing problem, the aim is to determine a least cost traversal of a...
A unified tabu search heuristic for vehicle routing problems with time windows
A unified tabu search heuristic for vehicle routing problems with time windows
2001
This paper presents a unified tabu search heuristic for the vehicle routing problem...
A branch-and-cut algorithm for the undirected rural postman problem
A branch-and-cut algorithm for the undirected rural postman problem
2000
The well-known Undirected Rural Postman Problem is considered and a binary linear...
Optimal sequencing of skip collections and deliveries
Optimal sequencing of skip collections and deliveries
1997
The purpose of this paper is to model and solve a complex routing problem associated...
Optimal tool partitioning rules for numerically controlled punch press operations
Optimal tool partitioning rules for numerically controlled punch press operations
1994
The purpose of this paper is to formulate and solve an optimization problem arising in...
Vehicle routing with stochastic demands and restricted failures
Vehicle routing with stochastic demands and restricted failures
1993
This paper considers a class of stochastic vehicle routing problems (SVRPs) with...
Location of a new facility on a linear market in the presence of weights
Location of a new facility on a linear market in the presence of weights
1988
In this paper, the authors study the trading areas of n facilities with unequal...
Maximizing pedestrian flow in shopping center layout
Maximizing pedestrian flow in shopping center layout
1993
A problem frequently faced by shopping center planners is how to locate the shops in...
Tracking down elusive customers
Tracking down elusive customers
1992
Transferable pedestrian flow models are a useful tool for the planning of shopping...
A branch and bound algorithm for a class of asymmetrical vehicle routeing problems
A branch and bound algorithm for a class of asymmetrical vehicle routeing problems
1992
This paper describes a branch and bound algorithm for a general class of asymmetrical...
A combinatorial optimization problem arising in dartboard design
A combinatorial optimization problem arising in dartboard design
1991
In this paper, the problem of optimally locating the numbers around a dartboard is...
Trading areas of facilities with different sizes
Trading areas of facilities with different sizes
1988
In this paper the authors analyze the problem of finding the trading area for a...
Surveys in Combinatorial Optimization
Surveys in Combinatorial Optimization
1987
What is nowadays referred to as ‘Combinatorial Optimization, derives from the...
Competitive spatial models
Competitive spatial models
1989
A large number of decision situations can be modeled as spatial problems. Whereas the...
Papers per page: