Hybrid metaheuristic techniques for optimising sugarcane rail operations

Masoud, Mahmoud; Kozan, Erhan; Kent, Geoff

doi:10.1080/00207543.2014.957870

Cited by 16 publications

(11 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hybrid Simulated Annealing/Genetic Algorithm: This research proposes an efficient genetic algorithm (GA) to solve the bi-objective cane transport scheduling problem. The results show that the performance of the proposed GA is effective and efficient to solve small and large-size instances (Yan et al, 2017;Liu et al, 2017a p11;Liu et al, 2017b p10;Masoud et al, 2010 p8;Masoud, 2013 p29;Masoud et al, 2015Masoud et al, 2012 p9). The following subsections present how the implementation of the proposed GA to solve the proposed model works out.…”

Section: Hybrid Simulated Annealing /Genetic Algorithmmentioning

confidence: 99%

“…Given the importance of devising faster methods to obtain near-optimal solutions to the transport cane scheduling problems, a lot of works have been accomplisged into developing such techniques using tools like Tabu Search and Simulated Annealing (Masoud et al, 2015Masoud et al, 2016 p211). In this research, a hybrid Simulated Annealing/Genetic Algorithm is developed to optimise stochastic biomass supply chain using multi objective functions (minimizing total waiting times for bin and minimizing total operating time for all transport systems (road/rail)).…”

Section: Hybrid Simulated Annealing /Genetic Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Developing a versatile simulation, scheduling and economic model framework for bioenergy production systems

Matindi¹,

Hobson²,

Masoud³

et al. 2019

10.5267/j.ijiec

Self Cite

View full text Add to dashboard Cite

Modelling is an effective way of designing, understanding, and analysing bio-refinery supply chain systems. The supply chain is a complex process consisting of many systems interacting with each other. It requires the modelling of the processes in the presence of multiple autonomous entities (i.e. biomass producers, bio-processors and transporters), multiple performance measures and multiple objectives, both local and global, which together constitute very complex interaction effects. In this paper, simulation models for recovering biomass from the field of the biorefinery are developed and validated using some industry data and the minimum biomass recovery cost is established based on different strategies employed for recovering biomass. Energy densification techniques are evaluated for their net present worth and the technologies that offer greater returns for the industry are recommended. In addition, a new scheduling algorithm is also developed to enhance the process flow of the management of resources and the flow of biomass. The primary objective is to investigate different strategies to reach the lowest cost delivery of sugarcane harvest residue to a sugar factory through optimally located bio-refineries. A simulation /optimisation solution approach is also developed to tackle the stochastic variables in the bioenergy production system based on different statistical distributions such as Weibull and Pearson distributions. In this approach, a genetic algorithm is integrated with simulation to improve the initial solution and search the near-optimal solution. A case study is conducted to illustrate the results and to validate the applicability for the real world implementation using ExtendSIM Simulation software using some real data from Australian Mills.

show abstract

Section: Hybrid Simulated Annealing /Genetic Algorithmmentioning

confidence: 99%

Section: Hybrid Simulated Annealing /Genetic Algorithmmentioning

confidence: 99%

Developing a versatile simulation, scheduling and economic model framework for bioenergy production systems

Matindi¹,

Hobson²,

Masoud³

et al. 2019

10.5267/j.ijiec

Self Cite

View full text Add to dashboard Cite

show abstract

“…A detailed description and the literature review on the ASPs can be found in the recent publications (D'Ariano et al, 2015; Samà et al, 2017Samà et al, , 2014Samà et al, , 2013. The theoretic footstone of the ASPs methodology is actually based on the extensions of job shop scheduling models (D'Ariano et al, 2015; Liu et al, 2018; Liu and Kozan, 2017, 2016Masoud et al 2016bMasoud et al , 2013Masoud et al , 2015Samà et al, 2017). In terms of this main idea, we will report a detailed literature review in another journal paper which is being under preparation.…”

Section: Aircraft Scheduling Problemsmentioning

confidence: 99%

A classification and literature survey on aviation management

Liu

D’Ariano

Kozan

et al. 2019

EasyChair Preprints

Self Cite

View full text Add to dashboard Cite

Aviation or air transportation refers to the activities surrounding mechanical flights in the airlines and the aircraft industries. In this paper, we present a recent literature survey on aviation management. The literature review is classified into the following main categories: Airline Capacity Analysis; Air Traffic Flow Management; Airline Fleet Assignment; Tail Assignment with Aircraft Maintenance Routing; Airline Crew Pairing; Airline Recovery and Rescheduling; Airline Revenue Management; Collaborative Decision Making; Aircraft Scheduling. This classification aims to motivate the researchers and practitioners in aviation management to develop more applicable, realistic and wide-ranging optimization methodologies for meeting the current needs of aviation industry.

show abstract

“…Many publications have discussed and solved problems in this sector to improve the efficiency of the system's performance. The scheduling of locomotive movements on cane railways has proven to be a very complex task (Masoud et al, 2015). Various optimisation methods (Li et al, 2014), have been used over the years to try to produce an optimised schedule that eliminates or minimises bin supply delays to harvesters and the factory, while minimising the number of locomotives, locomotive shifts and cane bins, and also the cane age.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, the initial temperature, T0=100, and the SA parameter, α =0.95, were used as the SA parameters benchmark to produce the SA solution. The SA parameter, α =0.95, was selected by comparing the makespan value under this value and other common values such as 90, 92 and 98 values, Masoud et. al.(2015).…”

mentioning

confidence: 99%

A near optimal cane rail scheduler under limited and unlimited capacity constraints

Masoud

Kozan

Kent

2015

Weber, T., McPhee, M.J. And Anderssen, R.S. (Eds) MODSIM2015, 21st International Congress on Modelling and Simulation

View full text Add to dashboard Cite

Australia is the world's third largest exporter of raw sugar after Brazil and Thailand, with around $2.0 billion in export earnings. Transport systems play a vital role in the raw sugar production process by transporting the sugarcane crop between farms and mills. In 2013, 87 per cent of sugarcane was transported to mills by cane railway. The total cost of sugarcane transport operations is very high. Over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. A cane railway network mainly involves single track sections and multiple track sections used as passing loops or sidings. The cane railway system performs two main tasks: delivering empty bins from the mill to the sidings for filling by harvesters; and collecting the full bins of cane from the sidings and transporting them to the mill. A typical locomotive run involves an empty train (locomotive and empty bins) departing from the mill, traversing some track sections and delivering bins at specified sidings. The locomotive then, returns to the mill, traversing the same track sections in reverse order, collecting full bins along the way. In practice, a single track section can be occupied by only one train at a time, while more than one train can use a passing loop (parallel sections) at a time. The sugarcane transport system is a complex system that includes a large number of variables and elements. These elements work together to achieve the main system objectives of satisfying both mill and harvester requirements and improving the efficiency of the system in terms of low overall costs. These costs include delay, congestion, operating and maintenance costs. An effective cane rail scheduler will assist the traffic officers at the mill to keep a continuous supply of empty bins to harvesters and full bins to the mill with a minimum cost. This paper addresses the cane rail scheduling problem under rail siding capacity constraints where limited and unlimited siding capacities were investigated with different numbers of trains and different train speeds. The total operating time as a function of the number of trains, train shifts and a limited number of cane bins have been calculated for the different siding capacity constraints. A mathematical programming approach has been used to develop a new scheduler for the cane rail transport system under limited and unlimited constraints. The new scheduler aims to reduce the total costs associated with the cane rail transport system that are a function of the number of bins and total operating costs. The proposed metaheuristic techniques have been used to find near optimal solutions of the cane rail scheduling problem and provide different possible solutions to avoid being stuck in local optima. A numerical investigation and sensitivity analysis study is presented to demonstrate that high quality solutions for large scale cane rail scheduling problems are obtainable in a reasonable time.

show abstract

Hybrid metaheuristic techniques for optimising sugarcane rail operations

Cited by 16 publications

References 29 publications

Developing a versatile simulation, scheduling and economic model framework for bioenergy production systems

Developing a versatile simulation, scheduling and economic model framework for bioenergy production systems

A classification and literature survey on aviation management

A near optimal cane rail scheduler under limited and unlimited capacity constraints

Contact Info

Product

Resources

About