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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
El Hachemi, N., Gendreau, M., & Rousseau, L. M. (2009). A hybrid LS/CP approach to solve the weekly log-truck scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5547 LNCS, pp. 319–320). https://doi.org/10.1007/978-3-642-01929-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
