A near-exact method for solving the log-truck scheduling problem

International Transactions in Operational Research

Volumn 11, Issue 4, 2004, Pages 447-464

  Palmgren, M ^a   Ronnqvist M ^a   Varbrand P ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Forestry; Log transportation; Log truck scheduling; Shortest path

Indexed keywords

EID: 26244462310     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2004.00469.x     Document Type: Article

References (14)

1. Carlsson, D., Rönnqvist, M., 1999. Wood flow problems in Swedish forestry, Ed.G.FrumerieReport No. 1.The Forestry Research Institute of Sweden, Sweden.
2. Christiansen, M., Nygreen, B., 1998. A method for solving ship routing problems with inventory constraints. Annals of Operations Research, 81, 357-378.
3. Cordeau, J-F., Laporte, G., 2002. The dial-a-ride problem: variants, modeling issues and algorithms. Les Cahiers du GERARD, G-2002-25.
4. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F., 2000. The VRP with pickup and delivery. Les Cahiers du GERARD, G-2000-25.
5. Dumas, Y., Desrosiers, J., Soumis, F., 1991. The pickup and delivery problem with time windows. European Journal of Operational Research, 54, 7-22.
6. Jimenez, V.M., Marzal, A., 1999. Computing the k-shortest paths: a new algorithm and an experimental comparison. 3rd Workshop on Algorithm Engineering, London, July 1999. LNCS, vol. 1668. Springer.
7. Palmgren, M., 2001. Optimisation methods for log truck scheduling. Thesis No. 880, Linköpings Universitet, Sweden.
8. Ryan, D.M., Foster, B.A., 1981. An integer programming approach to scheduling. Computer Scheduling of Public Transport. North-Holland, Amsterdam, pp.269-280.
9. Rönnqvist, M., Ryan, D., 1995. Solving truck despatch problems in real time. Proceedings of the 31th Annual Conference of the Operational Research Society of New Zealand. August 31-September 1, Wellington, New Zealand, pp.165-172.
10. Savelsbergh, M.W.P., Sol, M., 1995. The general pickup and delivery problem. Available on the web.
11. Sigurd, M., Pisinger, D., Sig, M., 2000. The pickup and delivery problem with time windows and precedences. Technical Report 00/08, DIKU, University of Copenhagen, DK-2100 Copenhagen.
12. Vanderbeck, F., Wolsey, L.A., 1996. An exact algorithm for IP column generation. Opns. Res. Letters, 19, 151-160.
13. Weintraub, A., Epstein, R., Morales, R., Seron, J., Traverso, P., 1996. A truck scheduling system improves efficiency in the forest industries. Interfaces, 26, 4, 1-12.
14. Xu, H., Chen, Z-L., Rajagopal, S., Arunapuram, S., 2001. Solving a practical pickup and delivery problem paper. Available on the web.