A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem

Authors:
Nizar Hachemi;Michel Gendreau;Louis-Martin Rousseau
Affiliations:
Logistics and Transportation (CIRRELT), Interuniversity Research Centre on Enterprise Networks, Montreal, Canada H3C 3J7;Logistics and Transportation (CIRRELT), Interuniversity Research Centre on Enterprise Networks, Montreal, Canada H3C 3J7;Logistics and Transportation (CIRRELT), Interuniversity Research Centre on Enterprise Networks, Montreal, Canada H3C 3J7
Venue:
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2009

Citing 3
Cited 0

Constraint-Based Local Search

Constraint-Based Local Search
Solving a log-truck scheduling problem with constraint programming

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Differentiable invariants

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a hybrid approach to solve the log-truck scheduling problem (LTSP), which combines routing and scheduling of forest vehicles and includes aspects such as multiple products and inventory management. The LTSP is closely related to some routing problems encountered in other industries, in particular, so called "pick-up and delivery problems". In general, the LTSP are more complex than classical PDP, since in the LTSP we must synchronise trucks and log-loaders to avoid as much as possible waiting times.