Abstract | ||
---|---|---|
An innovative mathematical model is presented to optimise a cane transport system.An integrated depth-first-search algorithm with constraint programming is presented.A hybrid metaheuristic technique is developed for finding more accurate solutions with less CPU time. In Australia, the railway system plays a vital role in transporting the sugarcane crop from farms to mills. The sugarcane transport system is complex as it routines a daily schedule, which consists of a set of train runs to satisfy the requirements of the mills and harvesters. A constrain programming approach is used to formulate this complicated system. Metaheuristic techniques and constraint programming are hybridised as an efficient solution approach. Thus, a better sugarcane transport scheduling system is achieved to maximise the throughput of sugarcane transport. A numerical investigation is presented and demonstrates that high-quality solutions are obtainable for industry-scale applications in a reasonable time. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1016/j.cie.2016.06.002 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Sugarcane transport,Train scheduling,Job shop scheduling,Constraint programming,Metaheuristics | Mathematical optimization,Job shop scheduling,Railway system,CPU time,Transport system,Constraint programming,Scheduling system,Engineering,Throughput,Operations management,Metaheuristic | Journal |
Volume | Issue | ISSN |
98 | C | 0360-8352 |
Citations | PageRank | References |
2 | 0.36 | 9 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mahmoud Masoud | 1 | 5 | 1.41 |
Erhan Kozan | 2 | 315 | 32.28 |
Geoff Kent | 3 | 6 | 1.51 |
Shi Qiang Liu | 4 | 64 | 5.40 |