Skip to main content
SpringerLink
Log in

Cane Railway Scheduling via Constraint Logic Programming: Labelling Order and Constraints in a Real-Life Application

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

Abstract

In Australia, cane transport is the largest unit cost in the manufacturing of raw sugar, making up around 35% of the total manufacturing costs. Producing efficient schedules for the cane railways can result in significant cost savings. This paper presents a study using Constraint Logic Programming (CLP) to solve the cane transport scheduling problem. Tailored heuristic labelling order and constraints strategies are proposed and encouraging results of application to several test problems and one real-life case are presented. The preliminary results demonstrate that CLP can be used as an effective tool for solving the cane transport scheduling problem, with a potential decrease in development costs of the scheduling system. It can also be used as an efficient tool for rescheduling tasks which the existing cane transport scheduling system cannot perform well.

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

  1. D. Abel, A solution technique for the cane railway routing and scheduling problem, Ph. D. thesis, James Cook University of North Queensland (1978).

  2. C. Bisiere, Sd-Solver: Towards a multidirectional CLP-based simulation tool, CEFI, Les Milles (1994).

    Google Scholar 

  3. S. Breitinger and H. Lock, Using constraint logic programming for industrial scheduling problems, in: Logic Programming: Formal Methods and Practical Applications, eds. C. Beirle and L. Plumer (Elsevier, 1994).

  4. A. Chamard, A. Fischler, D. Guinaudeau and A. Guillaud, CHIC lessons on CLP methodology, CHIC deliverable report D2.1.2.3 (1995).

  5. N. Christodoulou, M. Wallace and V. Kuchenhoff, Constraint logic programming and its application to fleet scheduling, Information and Decision Technologies 19 (1994) 135–144.

    Google Scholar 

  6. J. Cohen, Constraint logic programming languages, Communications of the ACM33(7) (1990) 52-68.

  7. M. Dincbas, H. Simonis and P. Van Hentenryck, Solving large combinatorial problems in logic programming, The Journal of Logic Programming 8 (1990) 75–93.

    Google Scholar 

  8. ECRC, ECLiPSe 3.5 User Manual (1995).

  9. J. Jaffar and M. Maher, Constraint logic programming: a survey, The Journal of Logic Programming 19 & 20 (1994) 503–581.

    Google Scholar 

  10. R.A. James, Rail transport within the Australian sugar industry, Sugar Research Institute Technical Circular No. 19/93 (1993).

  11. J. Jourdan and R.E. Valdez-Perez, CLP applied to hypothetical reasoning in chemistry, in: Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas (1990).

  12. J. Le Dizes and C. Guimaraes, CONTRALTO: Constraint reasoning applied to logistics for transport organisations, in: Second International OECD Workshop on Knowledge-Based Expert Systems in Transportation, Montreal, Canada (1992).

  13. G.A. Narboni, Optimization of concentrator positioning in the design of private data networks, in: The Practical Application of Prolog, London (1994).

  14. A.J. Pinkney, An automatic cane railway scheduling system, Masters thesis, James Cook University of North Queensland (1988).

  15. A.J. Pinkney and C. Camilleri, Computer based traffic officer tools, in: Proceedings Australian Society Sugar Cane Technologists 1996 Conference (1996).

  16. A.J. Pinkney and W. McWhinney, Automatic cane railway scheduling system a boon, Central Queensland Journal of Regional Development 2(2) (1993) 113–117.

    Google Scholar 

  17. M. Rueher and B. Legeard,Which role for CLP in software engineering? An investigation on the basis of first applications, in: Proceedings of the First International Conference on the Practical Application of Prolog, London (1992).

  18. H. El Sakkout, Modelling and solving fleet assignment in a flexible environment, in: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP96), Lecture Notes in Computer Science (Springer, 1996).

  19. R. Simons, How BA swaps its aircraft around, OR Newsletter (1996).

  20. B.M. Smith, S.C. Brailsford, P.M. Hubbard and H.P. Williams, The progressive party problem: Integer linear programming and constraint programming compared, in: International ILOG Solver Users Conference Proceedings (1995).

  21. P. Van Hentenryck, Constraint Satisfaction in Logic Programming (MIT Press, Cambridge, MA, 1989).

    Google Scholar 

  22. M. Wallace, Applying constraints for scheduling, in: Constraint Programming, eds. B. Mayoh and J. Penjaam, NATO ASI Series (Springer, 1994).

  23. M. Wallace, Survey: Practical applications of constraint programming, Constraints Journal 1(1) (1996).

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics & Communication, Central Queensland University, Mackay, QLD 4741, Australia

    Fae Martin & Arthur Pinkney

Authors
  1. Fae Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arthur Pinkney
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinghuo Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martin, F., Pinkney, A. & Yu, X. Cane Railway Scheduling via Constraint Logic Programming: Labelling Order and Constraints in a Real-Life Application. Annals of Operations Research 108, 193–209 (2001). https://doi.org/10.1023/A:1016067230126

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016067230126

Search

Navigation