Laporte Gilbert

Gilbert Laporte

Information about the author Gilbert Laporte will soon be added to the site.
Found 203 papers in total
The Rainbow Cycle Cover Problem
The Rainbow Cycle Cover Problem
2016
We model and solve the Rainbow Cycle Cover Problem (RCCP). Given a connected and...
50th Anniversary Invited Article–Goods Distribution with Electric Vehicles: Review and Research Perspectives
50th Anniversary Invited Article–Goods Distribution with Electric Vehicles: Review and Research Perspectives
2016
Since the mid‐2000s, electric vehicles have gained popularity in several...
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines
2016
The purpose of this paper is to introduce, model, and solve a rich multiperiod...
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading
2015
This paper proposes models and algorithms for the pickup and delivery vehicle routing...
A short-turning policy for the management of demand disruptions in rapid transit systems
A short-turning policy for the management of demand disruptions in rapid transit systems
2016
Rapid transit systems timetables are commonly designed to accommodate passenger demand...
A general rapid network design, line planning and fleet investment integrated model
A general rapid network design, line planning and fleet investment integrated model
2016
Traditionally, network design and line planning have been studied as two different...
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
2016
This study considers a multi-objective dynamic stochastic districting and routing...
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
2015
In this paper, we solve the pickup and delivery problem with time windows and...
Path based algorithms for metro network design
Path based algorithms for metro network design
2015
We propose a flexible and modular heuristic for the planning of metro networks. Two...
Robust assembly line balancing with heterogeneous workers
Robust assembly line balancing with heterogeneous workers
2015
Assembly lines are manufacturing systems in which a product is assembled progressively...
A comparison of several enumerative algorithms for Sudoku
A comparison of several enumerative algorithms for Sudoku
2014
Sudoku is a puzzle played of an n × n grid where n is the square of a positive...
Locating replenishment stations for electric vehicles: application to Danish traffic data
Locating replenishment stations for electric vehicles: application to Danish traffic data
2014
Environment‐friendly electric vehicles have gained popularity and increased...
The traveling salesman problem with time-dependent service times
The traveling salesman problem with time-dependent service times
2016
This paper introduces a version of the classical traveling salesman problem with...
A comparison of several models for the hamiltonian p-median problem
A comparison of several models for the hamiltonian p-median problem
2014
The Hamiltonian p‐median problem consists of determining p disjoint cycles of...
Scheduling twin robots on a line
Scheduling twin robots on a line
2014
This article introduces the twin robots scheduling problem (TRSP), in which two robots...
The multi-district team orienteering problem
The multi-district team orienteering problem
2014
This paper introduces the multi‐district team orienteering problem. In this...
The static bicycle relocation problem with demand intervals
The static bicycle relocation problem with demand intervals
2014
This study introduces the Static Bicycle Relocation Problem with Demand Intervals...
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem
2014
Because most commercial passenger airlines operate on a hub‐and‐spoke...
A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations
A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations
2013
The periodic supply vessel planning problem arises in supply operations performed by a...
Rich routing problems arising in supply chain management
Rich routing problems arising in supply chain management
2013
The purpose of this paper is to provide basic models for highly relevant extensions of...
Exact Solution of Large‐Scale Hub Location Problems with Multiple Capacity Levels
Exact Solution of Large‐Scale Hub Location Problems with Multiple Capacity Levels
2012
This paper presents an extension of the classical capacitated hub location problem...
Long‐Haul Vehicle Routing and Scheduling with Working Hour Rules
Long‐Haul Vehicle Routing and Scheduling with Working Hour Rules
2013
Long‐haul carriers must comply with various safety rules which are rarely taken...
A continuous approximation model for the fleet composition problem
A continuous approximation model for the fleet composition problem
2012
This paper presents a continuous approximation model to determine the long‐term...
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
2012
This paper describes a generic branch‐and‐cut algorithm applicable to...
Papers per page: