Location routing problem solving: A case study Thailand Royal Project

Article Sidebar

PDF
Published: Jan 27, 2023
Keywords:
Location routing problem Royal project Transportation Agriculture product

Main Article Content

Peerawat Luesak
Department of Industrial Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
Worapot Sirirak
Department of Industrial Engineering, Faculty of Engineering, Rajamangala University of Technology Lanna, Chiang Rai 57120, Thailand
Rapeepan Pitakaso
Department of Industrial Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
Thanatkij Srichok
Department of Industrial Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
Surajet Khonjun
Department of Industrial Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
Sarinya Sirisan
Department of Industrial Management Technology, Faculty of Liberal Arts and Sciences, Sisaket Rajabhat University, Sisaket 33000, Thailand
Sarayut Gonwirat
Department of Computer and Automation Engineering, Faculty of Engineering and Industrial Technology, Kalasin University, Kalasin 46000, Thailand

Abstract

This study presents a mathematical model for resolving the location routing problem of agricultural product transportation in royal projects in Thailand. This work aims to minimize the distance between pickup subcenter point locations and transport route links in each area. The difference in product amount in each area affects the product's capacity in the subcenter and its transport to the royal project's main center under the conditions of weight score classification depot, depot capacity, delivery demand, truck capacity, and transport distance. Due to the similar performance of each royal project, selecting a suitable subcenter is difficult. As a result, the mathematical model is created to solve the decision-making problem of selecting the subcenter for pickup and transportation. The mathematical model assumption is tested by the Lingo V16 program, which uses an exact method to find the appropriate subcenter point selection on the five instants in each size of the problem. The testing revealed that the mathematical model could choose an appropriate subcenter point in a small-scale problem effectively and quickly. However, it is not suitable for problem-solving in a medium or large-scale problem. The increasing number of data points influences solution generation speed and quality. The exact method of problem-solving with the Lingo program is unsuitable for problem-solving when the problem is complex and has several parameters that change depending on the current situation. In order to achieve faster algorithms, the best solution-finding method will be improved in the future with a meta-heuristics approach to algorithm design.

Article Details

How to Cite
Luesak, P., Sirirak, W. ., Pitakaso, R. ., Srichok, T. ., Khonjun, S. ., Sirisan, S. ., & Gonwirat, S. . (2023). Location routing problem solving: A case study Thailand Royal Project. Engineering and Applied Science Research, 50(1), 10–18. Retrieved from https://ph01.tci-thaijo.org/index.php/easr/article/view/250496
Issue
Vol. 50 No. 1 (2023)
Section
ORIGINAL RESEARCH
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

References

Berdegué JA, Balsevich F, Flores L, Reardon T. Central American supermarkets’ private standards of quality and safety in procurement of fresh fruits and vegetables. Food Policy. 2005;30(3):254-69.

Teece DJ. Business models, business strategy and innovation. Long Range Plann. 2010;43(2-3):172-94.

Schmidt CE, Silva AC, Darvish M, Coelho LC. The time-dependent location-routing problem. Transp Res E: Logist Transp Rev. 2019;128:293-315.

Belenguer JM, Benavent E, Prins C, Prodhon C, Calvo RW. A branch-and-cut method for the capacitated location-routing problem. Comput Oper Res. 2011;38(6):931-41.

Zhang C, Zhao Y, Zhang J, Leng L. Location and routing problem with minimizing carbon. Comp Integr Manuf Syst. 2017;23:2768-77.

Tang J, Ji S, Jiang L. The design of a sustainable location-routing-inventory model considering consumer environmental behavior. Sustainability. 2016;8(3):1-20.

Hansen P, Hegedahl B, Hjortkjær S, Obel B. A heuristic solution to the warehouse location-routing problem. Eur J Oper Res. 1994;76(1):111-27.

Karaoglan I, Altiparmak F, Kara I, Dengiz B. The location-routing problem with simultaneous pickup and delivery: formulations and a heuristic approach. Omega. 2012;40(4):465-77.

Salazar IA, Molina J, Ángel-Bello F, Gómez T, Caballero R. Solving a bi-objective transportation location routing problem by metaheuristic algorithms. Eur J Oper Res. 2014;234(1):25-36.

Saif-Eddine A, El-Beheiry M, El-Kharbotly A. An improved genetic algorithm for optimizing total supply chain cost in inventory location routing problem. Ain Shams Eng J. 2019;10(1):63-76.

Prodhon C, Prins C. A survey of recent research on location-routing problems. Eur J Oper Res. 2014;238(1):1-17.

Nagy G, Salhi S. Location-routing: issues models and methods. Eur J Oper Res. 2007;177(2):649-72.

Mehdi N, Abdelmoutalib M, Imad H. A modified ALNS algorithm for vehicle routing problems with time windows. J Phys: Conf Ser. 2021;1743:1-11.

Leng L, Zhao Y, Wang Z, Zhang J, Wang W, Zhang C. A Novel hyper-heuristic for the biobjective regional low-carbon location-routing problem with multiple constraints. Sustainability. 2019;11(6):1-31.

Asef H, Lim S, Maghrebi M, Shahparvari S. Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management. Ann Oper Res. 2019;273:75-110.

Wang Y, Peng S, Zhou X, Mahmoudi M, Zhen L. Green logistics location-routing problem with eco-packages. Transp Res E: Logist Transp Rev. 2020;143:1-33.

Karakostas P, Sifaleras A, Georgiadis MC. Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem. Optim Lett. 2022;16:211-35.

Chen C, Qiu R, Hu X. The location-routing problem with full truckloads in low carbon supply chain network designing. Math Probl Eng. 2018;2018:1-13.

Yu V, Lin SW, Lee W, Ting CJ. A simulated annealing heuristic for the capacitated location routing problem. Comput Ind Eng. 2010;58(2):288-99.

Yu V, Eka Normasari N, Chen WH. Location-routing problem with time dependent demands. Comput Ind Eng. 2021;151:1-20.

Theeraviriya C, Sirirak W, Praseeratasang N. Location and routing planning considering electric vehicles with restricted distance in agriculture. World Electr Veh J. 2020;11(4):1-22.

Sirirak W, Pitakaso R. Marketplace location decision making and tourism route planning. Adm Sci. 2018;8(4):1-25.

Theeraviriya C, Pitakaso R, Sethanan K, Kaewman S, Kosacka-Olejnik M. A new optimization technique for the location and routing management in agricultural logistics. J Open Innov Technol Mark Complex. 2020;6(1):1-21.

Rath S, Gutjahr WJ. A math-heuristic for the warehouse location–routing problem in disaster relief. Comput Oper Res. 2014;42:25-39.

Mo P, D’Ariano A, Yang L, Veelenturf LP, Gaoa Z. An exact method for the integrated optimization of subway lines operation strategies with asymmetric passenger demand and operating costs. Transp Res B: Methodol. 2021;149:283-321.

Prasanti N, Andriansyah A, Fitriadi F. Local search algorithm for solving periodic location routing problem. IOP Conf Ser: Mater Sci Eng. 2019;697:1-6.

Nataraj S, Ferone D, Quintero-Araujo C, Juan AA, Festa P. Consolidation centers in city logistics: a cooperative approach based on the location routing problem. Int J Ind Eng Comput. 2019;10:393-404.

Kiptum K. Logistic model for adherence to ministry of health protocols and guidelines by public transport vehicles in Kenya during COVID-19 pandemic. Eng Appl Sci Res. 2022;49(1):88-95.

Singh S, Kumar R, Panchal R, Tiwari M. Impact of COVID-19 on logistics systems and disruptions in food supply chain. Int J Prod Res. 2021;59(7):1993-2008.

Rinaldi M, Murino T, Bottani E. The impact of Covid-19 on logistic systems: an Italian case study. IFAC-PapersOnLine. 2021;54(1):1035-40.

Fahimnia B, Molaei R, Ebrahimi M. Integration in logistics planning and optimization. In: Farahani R, Rezapour S, Kardar L, editors. Logistics Operations and Management. London: Elsevier; 2011. p. 371-91.

Erdoğdu M. Development of logistics management and relationship with industry. Int J Eng Sci Technol. 2021;3(2):91-112.

Gandra V, Çalık H, Wauters T, Toffolo T, Carvalho M, Berghe G. The impact of loading restrictions on the two-echelon location routing problem. Comput Ind Eng. 2021;160:1-18.

Saif-Eddine AS, El-Beheiry MM, El-Kharbotly AK. An improved genetic algorithm for optimizing total supply chain cost in inventory location routing problem. Ain Shams Eng J. 2019;10(1):63-76.

Yu VF, Aloina G, Susanto H, Effendi MK, Lin SW. Regional location routing problem for waste collection using hybrid genetic algorithm-simulated annealing. Mathematics. 2022;10(12):1-23.

Khamsing N. Chindaprasert K, Pitakaso R, Sirirak W, Theeraviriya C. Modified ALNS algorithm for a processing application of family tourist route planning: a case study of Buriram in Thailand. Computation. 2021;9(2):1-30.

Sarasola B, Doerner K. Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location. Networks. 2020;75(1):64-85.

Gharavani M, Setak M. A capacitated location routing problem with semi soft time windows. Adv Comput Tech Electromagn. 2015;1:26-40.