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.
Similar content being viewed by others
References
Van Hentenryck, P., Michel, L.: Constraint Based Local Search. MIT Press, Cambridge (2001)
Van Hentenryck, P., Michel, L.: Differentiable invariants. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 604–619. Springer, Heidelberg (2006)
El Hachemi, N., Gendreau, M., Rousseau, L.-M.: Solving a log-ruck scheduling problem with constraint programming. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 293–297. Springer, Heidelberg (2008)
Weintraub, A., Epstein, R., Morales, R., Seron, J., Traverso, P.: A truck scheduling system improves efficiency in the forest industries. Interfaces 26(4), 1–12 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Hachemi, N., Gendreau, M., Rousseau, LM. (2009). A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-01929-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01928-9
Online ISBN: 978-3-642-01929-6
eBook Packages: Computer ScienceComputer Science (R0)