Skip to main content
SpringerLink
Log in

A hybrid constraint programming approach to the log-truck scheduling problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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 the non-productive activities such as the 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. Both of these models are combined through the exchange of global constraints. Finally the whole approach is validated on real industrial data.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Andersson, G., Flisberg, P., Liden, P., & Rönnqvist, M. (2008). RuttOpt—a decision support system for routing of logging trucks. Canadian Journal of Forest Research, 38, 1784–1796.

    Article  Google Scholar 

  • Bredström, D., & Rönnqvist, M. (2008). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research, 191(1), 19–31.

    Article  Google Scholar 

  • Baptiste, P., LePape, C., & Nuijten, W. (1995). Constraint-based optimization and approximation for job-shop scheduling. In AAAI-SIGMAN workshop on intelligent manufacturing systems, IJCAI’95 (pp. 5–16). Montreal, Canada.

  • Baptiste, P., LePape, C., & Nuijten, W. (2001). Constraint-based scheduling. Dordrecht: Kluwer Academic.

    Google Scholar 

  • Fahle, T., & Sellmann, M. (2000). Constraint programming based column generation with knapsack subproblems. In Proceeding of the international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR’00) (pp. 33–43).

  • Freling, R., Huisman, D., & Wagelmans, A. P. M. (2003). Models and algorithms for integration of vehicle and crew scheduling. Journal of Scheduling, 6, 63–85.

    Article  Google Scholar 

  • Flisberg, P., Liden, B., & Rönnqvist, M. (2010, in press). A hybrid method based on linear programming and tabu search for routing of logging trucks. Computers and Operations Research.

  • Gronalt, M., & Hirsch, P. (2007). Log-truck scheduling with tabu search strategy. Metaheuristics, 39, 65–88.

    Article  Google Scholar 

  • Haase, K., Desaulniers, G., & Desrosiers, J. (2001). Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science, 35(3), 286–303.

    Article  Google Scholar 

  • Hooker, J. N. (2005). A hybrid method for the planning and scheduling. Constraints, 10(4), 385–401.

    Article  Google Scholar 

  • Linnainmaa, S., Savalo, J., & Jokinen, O. (1995). EPO: A knowledge based system for wood procurement management. Paper presented at the 7th Annual Conference on Artifical Intelligence, Montreal.

  • Michaelsen, J. (1994). Productivité des chargeuses de bois courts (Communiqué Technique N: Chargement et Camionnage-37 Sommaire de rapport interne de FERIC).

  • Milano, M. (2004). Constraint and integer programming. Dordrecht: Kluwer Academic.

    Google Scholar 

  • Murphy, G. (2003). Reducing trucks on the road through optimal route scheduling and shared log transport services. Southern Journal of Applied Forestry, 27(3), 198–205.

    Google Scholar 

  • Palmgren, M., Rönnqvist, M., & Värbrand, P. (2003). A solution approach for log truck scheduling based on composite pricing and branch and bound. International Transactions in Operational Research, 10, 433–447.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Régin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of AAAI/IAAI (Vol. 1, pp. 209–215). Menlo Park: AAAI Press/The MIT Press.

    Google Scholar 

  • Rönnqvist, M. (2003). Optimization in forestry. Mathematics Programming, 97, 267–284.

    Google Scholar 

  • Rönnqvist, M., & Ryan, D. (1995). Solving truck dispatch problem in real time. In Proceedings of the 31st annual conference of the Operational Research Society of New Zealand (pp. 165–172). Wellington, New Zealand, 31 August—1 September 1995. Auckland: The Operational Research Society of New Zealand.

    Google Scholar 

  • Rönnqvist, M., Sahlin, H., & Carlsson, D. (1998). Operative planning and dispatching of forestry transportation (Report LiTH-MAT-R-1998-18). Linköping, Sweden.

  • Ropke, S., Cordeau, J.-F., & Laporte, G. (2007). Models and branch-and-cut algorithm for pick-up and delivery problems with time windows. Networks, 4(49), 258–272.

    Article  Google Scholar 

  • Rousseau, L.-M., Gendreau, M., & Pesant, G. (2002). Solving small VRPTWs with constraint programming based column generation. In Proceeding of the fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR’02) (pp. 333–344).

  • Sakkout, H. E., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4), 359–388.

    Article  Google Scholar 

  • Sellmann, M., Zervoudakis, K., Stamatopoulos, P., & Fahle, T. (2002). Crew assignment via constraint programming: integrating column generation and heuristic tree search. Annals of Operations Research, 115, 207–225.

    Article  Google Scholar 

  • Simonis, H., Charlier, P., & Kay, P. (2000). Constraint handling in an integrated transportation problem. IEEE Intelligent Systems, 15(1), 26–32.

    Article  Google Scholar 

  • Van Hentenryck, P. (1989). Constraint satisfaction in logic programming. Cambridge: MIT Press.

    Google Scholar 

  • Van Hentenryck, P. (1999). The OPL optimization programming language. Cambridge: MIT Press.

    Google Scholar 

  • Van Hentenryck, P., Perron, L., & Puget, J.-F. (2000). Search and strategies in OPL. ACM Transactions on Computational Logic, 2(1), 285–320.

    Article  Google Scholar 

  • Weintraub, A., Epstein, R., Morales R, Seron J., & Traverso, P. (1996). A truck scheduling system improves efficiency in the forest industries. Interfaces, 4(26), 1–12.

    Article  Google Scholar 

  • Zweben, M., & Fox, M. (1994). Intelligent scheduling. San Mateo: Morgan Kaufman.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), C.P. 6128, succursale centre-ville, Montreal, Canada, H3C 3J7

    Nizar El Hachemi, Michel Gendreau & Louis-Martin Rousseau

Authors
  1. Nizar El Hachemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Louis-Martin Rousseau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Louis-Martin Rousseau.

Rights and permissions

Reprints and permissions

About this article

Cite this article

El Hachemi, N., Gendreau, M. & Rousseau, LM. A hybrid constraint programming approach to the log-truck scheduling problem. Ann Oper Res 184, 163–178 (2011). https://doi.org/10.1007/s10479-010-0698-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-010-0698-x

Keywords

Search

Navigation