Skip to main content
Log in

A new constraint programming approach for optimising a coal rail system

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Because of the bottlenecking operations in a complex coal rail system, millions of dollars are costed by mining companies. To handle this issue, this paper investigates a real-world coal rail system and aims to optimise the coal railing operations under constraints of limited resources (e.g., limited number of locomotives and wagons). In the literature, most studies considered the train scheduling problem on a single-track railway network to be strongly NP-hard and thus developed metaheuristics as the main solution methods. In this paper, a new mathematical programming model is formulated and coded by optimization programming language based on a constraint programming (CP) approach. A new depth-first-search technique is developed and embedded inside the CP model to obtain the optimised coal railing timetable efficiently. Computational experiments demonstrate that high-quality solutions are obtainable in industry-scale applications. To provide insightful decisions, sensitivity analysis is conducted in terms of different scenarios and specific criteria.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Abdekhodaee, A., Dunstall, S., Ernst, A.T., Lam, L.: Long term capacity planning at hunter valley coal chain: models and algorithms. In: The Fifth Asia Pacific Industrial Engineering and Management Systems Conference, Gold Coast (2004)

  2. Abril, M., Salido, M.A., Barber, F.: Distributed search in railway scheduling problems. Eng. Appl. Artif. Intell. 21, 744–755 (2008)

    Article  Google Scholar 

  3. Albrecht, A., Panton, D.M., Lee, D.H.: Rescheduling rail networks with maintenance disruptions using problem space search. Comput. Oper. Res. 40(3), 703–712 (2013)

  4. Anthony, F., Elvis, C.H.: A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system. Ann. Oper. Res. 223(1), 173–193 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Australian Government.: Office of the Chief Economists: Resources and energy quarterly Commonw Australia 4(2), 1–71 (2014)

  6. Bersani, C., Qiu, S., Sacile, R., Sallak, M., Schön, W.: Rapid, robust, distributed evaluation and control of train scheduling on a single line track. Control Eng. Pract. 35, 12–21 (2015)

    Article  Google Scholar 

  7. Burdett, R.L., Kozan, E.: Determining operations affected by delay in predictive train timetables. Comput. Oper. Res. 41, 150–166 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cacchiani, V., Caprara, A., Toth, P.: A column generation approach to train timetabling on a corridor. Q. J. Oper. Res. 6, 125–142 (2008)

  9. Corman, F., D’Ariano, A., Pacciarelli, D., Pranzo, M.: A tabu search algorithm for rerouting trains during rail operations. Transp. Res. Part B 44, 175–192 (2010)

    Article  Google Scholar 

  10. D’Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183, 643–657 (2007)

    Article  MATH  Google Scholar 

  11. D’Ariano, A., Pacciarelli, D., Pranzo, M.: Assessment of flexible timetables in real-time traffic management of a railway bottleneck. Transp. Res. Part C 16, 232–245 (2008)

    Article  Google Scholar 

  12. Fischetti, M., Salvagnin, D.S., Zanette, A.: Fast approaches to improve the robustness of a railway timetable. Transp. Sci. 43, 321–335 (2009)

    Article  Google Scholar 

  13. Gholami, O., Sotskov, Y.N., Werner, F.: Fast edge-orientation heuristics for job-shop scheduling problems with applications to train scheduling. Int. J. Oper. Res. 2, 19–32 (2013)

    Google Scholar 

  14. Henz, M., Müller, T., Thiel, S.: Global constraints for round-robin tournament scheduling. Eur. J. Oper. Res. 153(1), 92–101 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Her, J.H., Ramakrishna, R.S.: An external-memory depth-first search algorithm for general grid graphs. Theor. Comput. Sci. 374, 170–180 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Janiak, A., Kovalyov, Y., Kozan, E., Pesch, E.: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224, 109–117 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ke, B.R., Lin, C.L., Chien, H.H., Chiu, H.W., Chen, N.: A new approach for improving the performance of freight train timetabling of a single-track railway system. Transp. Plan. Technol. 38(2), 238–264 (2015)

  18. Kelsey, T., Kotthoff, L., Jefferson, C., Linton, S., Miguel, I., Nightingale, P., Gent, I.: Qualitative modelling via constraint programming. Constraints 19, 163–173 (2014)

    Article  Google Scholar 

  19. Kozan, E., Liu, S.Q.: A demand-responsive decision support system for coal transportation. Decis. Support Syst. 54(1), 665–680 (2012)

    Article  Google Scholar 

  20. Kozan, E., Liu, S.Q.: A new open-pit multi-stage mine production timetabling model for drilling, blasting and excavating operations. Min. Technol. (2015). doi:10.1179/1743286315Y.0000000031

  21. Kozan, E., Liu, S.Q.: An operational-level multi-stage mine production timetabling model for optimally synchronising drilling, blasting and excavating operations. Int. J. Min. Reclam. Environ. (2016). doi:10.1080/17480930.2016.1160818

  22. Kuo, A., Miller, E., Mahmassani, H.S.: Freight train scheduling with elastic demand. Transp. Res. Part E 46, 1057–1070 (2010)

    Article  Google Scholar 

  23. Liebchen, C.: The first optimized railway timetable in practice. Transp. Sci. 42(4), 420–435 (2008)

    Article  Google Scholar 

  24. Liu, S.Q., Kozan, E.: Scheduling trains as a blocking parallel-machine job shop scheduling problem. Comput. Oper. Res. 36, 2840–2852 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  25. Liu, S.Q., Kozan, E.: Scheduling trains with priorities: a no-wait blocking parallel-machine job-shop scheduling model. Transp. Sci. 45(2), 175–198 (2011a)

    Article  Google Scholar 

  26. Liu, S.Q., Kozan, E.: Optimising a coal rail network under capacity constraints. Flex. Serv. Manuf. J. 23, 90–110 (2011b)

    Article  MATH  Google Scholar 

  27. Liu, S.Q., Kozan, E.: New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems. Expert Syst. Appl. 43, 59–65 (2016)

    Article  Google Scholar 

  28. Manli, Z., Youxi, L., Guoquan, S., Fengfeng, Z.: Constraint programming based biomarker optimization. Hindawi Publ. Corp. BioMed Res. Int. 2015(2015), 1–5 (2015)

    Article  Google Scholar 

  29. Masoud, M., Kozan, E., Kent, G.: Scheduling techniques to optimise sugarcane rail systems. ASOR Bull. 29, 25–34 (2010)

    Google Scholar 

  30. Masoud, M., Kozan, E., Kent, G.A.: A job-shop scheduling approach for optimising sugarcane rail operations. Flex. Serv. Manuf. J. 23(2), 181–196 (2011)

    Article  MATH  Google Scholar 

  31. Masoud, M., Kozan, E., Kent, G.A.: Hybrid metaheuristic techniques for optimising sugarcane rail operations. Int. J. Prod. Res. 53(9), 2569–2589 (2015)

    Article  Google Scholar 

  32. Patterson, S.R., Kozan, E., Hyland, P.: An integrated model of an open-pit coal mine?: improving energy efficiency decisions. Int. J. Prod. Res. (2015). doi:10.1080/00207543.2015.1117150

  33. Russell, R.A., Urban, T.L.: A constraint programming approach to the multiple-venue sport scheduling problem. Comput. Oper. Res. 33, 1895–1906 (2006)

    Article  MATH  Google Scholar 

  34. Sierra, M.R., Varela, R.: Pruning by dominance in best-first search for the job shop scheduling problem with total flow time. J. Intell. Manuf. 21(1), 111–119 (2008)

    Article  Google Scholar 

  35. Singh, G., Sier, D., Ernst, A.T., Gavriliouk, O., Oyston, R., Giles, T., Welgama, P.: A mixed integer programming model for long term capacity expansion planning: a case study from The Hunter Valley Coal Chain. Eur. J. Oper. Res. 220, 210–224 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  36. Singh, G., Sier, D., Ernst, A.T., Oyston, R., Welgama, P.: Long term capacity planning at hunter valley coal chain: models and algorithms. In: The 20th National Conference of Australian Society for Operations Research Incorporating the 5th International Intelligent Logistics System Conference, Gold Coast (2009)

  37. Talebian, A., Zou, B.: Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US. Transp. Res. Part B Methodol. 82, 114–140 (2015)

    Article  Google Scholar 

  38. Thomas, A., Singh, G., Krishnamoorthy, M., Venkeswaran, J.: Distributed optimisation method for multi-resource constrained scheduling in coal supply chains. Int. J. Prod. Res. 51(9), 2740–2759 (2012)

    Article  Google Scholar 

  39. Yuan, J., Hansen, I.A.: Optimizing capacity utilization of stations by estimating knock-on train delays. Transp. Res. Part B 41, 202–217 (2007)

    Article  Google Scholar 

  40. Zhou, X., Zhong, M.: Bicriteria train scheduling for high-speed passenger railroad planning applications. Eur. J. Oper. Res. 167, 752–771 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mahmoud Masoud.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Masoud, M., Kozan, E., Kent, G. et al. A new constraint programming approach for optimising a coal rail system. Optim Lett 11, 725–738 (2017). https://doi.org/10.1007/s11590-016-1041-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1041-5

Keywords

Navigation