A heuristic to solve the synchronized log-truck scheduling problem

Authors:
Nizar El Hachemi;Michel Gendreau;Louis-Martin Rousseau
Affiliations:
Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), C.P. 6128, succursale centre-ville, Montreal, Canada H3C 3J7;Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), C.P. 6128, succursale centre-ville, Montreal, Canada H3C 3J7;Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), C.P. 6128, succursale centre-ville, Montreal, Canada H3C 3J7
Venue:
Computers and Operations Research
Year:
2013

Citing 15
Cited 2

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Intelligent scheduling

Intelligent scheduling
The fleet assignment problem: solving a large-scale integer program

Mathematical Programming: Series A and B
The vehicle routing problem

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
VRP with Time Windows

The vehicle routing problem
Constraint-Based Scheduling

Constraint-Based Scheduling
Localizer

Constraints
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems

Transportation Science
Models and Algorithms for Integration of Vehicle and Crew Scheduling

Journal of Scheduling
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
Constraint-Based Local Search

Constraint-Based Local Search
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

Discrete Applied Mathematics
A hybrid method based on linear programming and tabu search for routing of logging trucks

Computers and Operations Research
Operations Research Improves Quality and Efficiency in Home Care

Interfaces

Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
Scheduling a log transport system using simulated annealing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a synchronized routing and scheduling problem that arises in the forest industry, as a variation of the log-truck scheduling problem. It combines routing and scheduling of trucks with specific constraints related to the Canadian forestry context. This problem includes aspects such as pick-up and delivery, multiple products, inventory stock, multiple supply points and multiple demand points. We developed a decomposition approach to solve the weekly problem in two phases. In the first phase we use a MIP solver to solve a tactical model that determines the destinations of full truckloads from forest areas to woodmills. In the second phase, we make use of two different methods to route and schedule the daily transportation of logs: the first one consists in using a constraint-based local search approach while the second one is a hybrid approach involving a constraint programming based model and a constraint-based local search model. These approaches have been implemented using COMET2.0. The method, was tested on two industrial cases from forest companies in Canada.