Desaulniers Guy

Guy Desaulniers

Information about the author Guy Desaulniers will soon be added to the site.
Found 30 papers in total
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
2017
The vehicle routing problem with time windows (VRPTW) consists of finding...
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem
2016
The inventory‐routing problem (IRP) integrates two well‐studied...
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...
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
2016
Effective route planning for battery electric commercial vehicle (ECV) fleets has to...
A column generation heuristic for districting the price of a financial product
A column generation heuristic for districting the price of a financial product
2015
This paper studies a districting problem that arises in the context of financial...
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...
Reaching the elementary lower bound in the vehicle routing problem with time windows
Reaching the elementary lower bound in the vehicle routing problem with time windows
2015
In this article, we present a comparative study of several strategies that can be...
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
2014
The min‐max k‐vehicles windy rural postman problem consists of...
Assigning Team Tasks and Multiple Activities to Fixed Work Shifts
Assigning Team Tasks and Multiple Activities to Fixed Work Shifts
2014
In the service industry, the multi‐activity and task assignment problem...
A two‐stage heuristic for multi‐activity and task assignment to work shifts
A two‐stage heuristic for multi‐activity and task assignment to work shifts
2012
The multi‐activity assignment problem consists of assigning interruptible...
Aircrew pairings with possible repetitions of the same flight number
Aircrew pairings with possible repetitions of the same flight number
2013
A crew pairing is a sequence of flights, connections and rests that starts and ends at...
Assigning multiple activities to work shifts
Assigning multiple activities to work shifts
2012
In some companies such as large retail stores, the employees perform different...
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation
2012
Traditionally, the airline crew scheduling problem has been decomposed into a crew...
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
2011
Since its appearance in 1947, the primal simplex algorithm has been one of the most...
Integrated airline crew scheduling: A bi‐dynamic constraint aggregation method using neighborhoods
Integrated airline crew scheduling: A bi‐dynamic constraint aggregation method using neighborhoods
2011
The integrated crew scheduling (ICS) problem consists of determining, for a set of...
European Driver Rules in Vehicle Routing with Time Windows
European Driver Rules in Vehicle Routing with Time Windows
2010
As of April 2007, the European Union has new regulations concerning driver working...
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
2010
The Dutch railway network experiences about three large disruptions per day on...
A branch-and-price method for a liquefied natural gas inventory routing problem
A branch-and-price method for a liquefied natural gas inventory routing problem
2010
We consider a maritime inventory routing problem in the liquefied natural gas (LNG)...
Path-reduced costs for eliminating arcs in routing and scheduling
Path-reduced costs for eliminating arcs in routing and scheduling
2010
In many branch-and-price algorithms, the column generation pricing problem consists of...
Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
2010
This paper addresses the split-delivery vehicle routing problem with time windows...
Lower bounds and a tabu search algorithm for the minimum deficiency problem
Lower bounds and a tabu search algorithm for the minimum deficiency problem
2009
An edge coloring of a graph G =( V , E ) is a function c : E ⇒ℕ that assigns...
Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches
Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches
2007
In a transit authority bus depot, buses of different types arrive in the evening to be...
Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation
Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation
2007
We consider vehicle routing and crew scheduling problems that involve a lexicographic...
Dynamic aggregation of set-partitioning constraints in column generation
Dynamic aggregation of set-partitioning constraints in column generation
2005
Column generation is often used to solve problems involving set-partitioning...
Papers per page: