Skip to main content

Abstract

Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization technologies. This paper proposes a solution method based on constraint programming and mathematical programming for a log-truck scheduling problem. The problem consists of scheduling the transportation of logs between forest areas and woodmills, as well as routing the fleet of vehicles to satisfy these transportation requests. The objective is to minimize the total cost of non-productive activities such as waiting time of trucks and forest log-loaders and the empty driven distance of vehicles. We propose a constraint programming model to address the combined scheduling and routing problem and an integer programming model to deal with the optimization of deadheads.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baptiste, P., LePape, C., Nuijten, W.: Constraint-Based Scheduling. Kluwer Academic Publishers, Dordrecht (2001)

    MATH  Google Scholar 

  2. Gronalt, M., Hirsch, P.: Log-Truck Scheduling with Tabu Search Strategy. Metaheuristics 39 (2007)

    Google Scholar 

  3. Linnainmaa, S., Savalo, J., Jokinen, O.: EPO: A knowledge based system for wood procurement management. In: The 7th Annual Conference on Artifical Intelligence, Montreal (1995)

    Google Scholar 

  4. Palmgren, M., Rönnqvist, M., Värbrand, P.: A near-exact method for solving the log-truck scheduling problem. International Transactions in Operational Research 11, 447–464 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Rönnqvist, M.: Optimization in forestry. Mathematical Programming 97, 267–284 (2003)

    MathSciNet  MATH  Google Scholar 

  6. Ropke, S., Cordeau, J.-F., Laporte, G.: Models and Branch-and-Cut Algorithm for Pick-up and Delivery Problems with Time Windows. Networks 49(4), 258–272 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)

    Google Scholar 

  8. Simonis, H., Charlier, P., Kay, P.: Constraint Handling in an Integrated Transportation Problem. IEEE Intelligent Systems and their Applications 15(1) (January 2000)

    Google Scholar 

  9. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Laurent Perron Michael A. Trick

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

El Hachemi, N., Gendreau, M., Rousseau, LM. (2008). Solving a Log-Truck Scheduling Problem with Constraint Programming. In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68155-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68154-0

  • Online ISBN: 978-3-540-68155-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics