Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 211-220 |
| Number of pages | 10 |
| Journal | Computers and Industrial Engineering |
| Volume | 98 |
| DOIs | |
| State | Published - 1 Aug 2016 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2016 Elsevier Ltd. All rights reserved.
Keywords
- Constraint programming
- Job shop scheduling
- Metaheuristics
- Sugarcane transport
- Train scheduling
ASJC Scopus subject areas
- General Computer Science
- General Engineering
Fingerprint
Dive into the research topics of 'An integrated approach to optimise sugarcane rail operations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver