Joint Districting and Transportation Lot-Sizing for A Sugarcane Management System using A Simulated Annealing Algorithm
Keywords:
districting problem, lot sizing problem, meta-heuristic, simulated annealing algorithmsAbstract
In this paper, we develop the model of the delivery management to transport sugarcane from the cane fields to sugar mill based on the right quantity and right demand for each period. The objective is to minimize the total expected cost. The assumptions of the model are to operate planning in cultivation, harvesting, and transportation. We formulated the decision model of districting and transportation lot sizing problems. In cultivation planning, we propose partitioning the entire sugarcane region by assigning the cane fields and the truck stations into two districts, an inside area, or an outside area. In harvesting, and transportation, we also make decisions of selecting the cane fields, truck stations used to transport, lot sizing during harvesting and transportation under the uncertainty of sugarcane yields for each period. In methodology, we propose the combined simulated annealing algorithm and heuristic (CSAH) to obtain near-optimal solutions. We compare the efficiency of our model with separated models (SM) of districting and transportation lot sizing. The numerical results show the benefits of our model over the separate model based on average total expected cost with 11.45%, savings amounting to 2,826,598 baht.
References
P. Pongpat, A. Mahmood, H. U. Ghani, T. Silalertruksa and S. H. Gheewala, “Optimization of food-fuel-fibre in biorefinery based on environmental and economic assessment: the case of sugarcane utilization in Thailand,” Sustainable Production and Consumption., vol. 37, pp. 398-411, 2023.
A. Aliano Filho, W. A. Oliveira and T. Melo, “Multi-objective optimization for integrated sugarcane cultivation and harvesting planning,” European Journal of Operational Research., vol. 309, no. 1, pp. 330-344, 2023.
S. Thuankaewsing, S. Khamjan, K. Piewthongngam and S. Pathumnakul, “Harvest scheduling algorithm to equalize supplier benefits: a case study from the Thai sugar cane industry”, Computers and Electronics in Agriculture., vol. 110, pp. 42-55, 2015.
U. Pongwanich-Anan, “Study of cost and benefit for sugar cane production, Tambon Don Chedi, Amphur Phanomthuan, Karnchanaburi Province, crop year 2007/2008,” Master of Economics Degree, Managerial Economics, Srinakharinwirot Universty., Bangkok, 2009.
S. W. Hess, J. B. Weaver, H. J. Siegfeldt, J. N. Whelan and P. A. Zitlau, “Nonpartisan political redistricting by computer,” Operations Research., vol. 13, no. 6, pp. 998-1006, 1965.
S. I. Gass, “On the Division of Police Districts into Patrol Beats,” In 23rd ACM National Conference., New York, United States, 1968.
M. Hojati, “Optimal political districting,” Computers & Operations Research., vol. 23, no. 12, pp. 1147-1161, 1996.
W. Khamjan, S. Khamjan and S. Pathumnakul, “Determination of the locations and capacities of sugar cane loading stations in Thailand.” Computers & Industrial Engineering., vol. 66, no. 4, pp. 663-674, 2013.
S. Kirkpatrick, C. D. Gelatt Jr and M. P. Vecchi, “Optimization by simulated annealing,” Science., vol. 220, no. 4598, pp. 671-680, 1983.
E. G. Talbi, Metaheuristics: from design to implementation, New Jersey: John Wiley & Sons, 2009.
M. Á. Gutiérrez-Andrade, E. A. Rincón-García, S. G. de-los-Cobos-Silva, P. Lara-Velázquez, R. A. Mora-Gutiérrez and A. Ponsich, “Simulated annealing and artificial bee colony for the redistricting process in Mexico,” INFORMS Journal on Applied Analytics., vol. 49, no. 3, pp. 173-234, 2019.
N. Mishra, V. Kumar, N. Kumar, M. Kumar and M. K. Tiwari, “Addressing lot sizing and warehousing scheduling problem in manufacturing environment,” Expert Systems with Applications., vol. 38, no. 9, pp. 11751-11762, 2011.
Y. Cheng and Y. Li, “Integrated optimization of multiproduct multiperiod transportation and inventory under a carbon cap constraint for online retailers,” Transportation Safety and Environment., vol. 3, no. 3, pp. 1-13, 2021.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
