PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Czasopismo
2024 | 20 | nr 1 | 23--37
Tytuł artykułu

Optimizing Fresh-cut Flower Distribution Using Vehicle Routing Problem for Perishable Goods

Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Background: Achieving optimization in complex distribution operations necessitates significant attention to the distinctive operating procedures and features of various distribution systems. One particularly challenging distribution operation is the transportation of fresh-cut flowers. This process demands that a required quality be maintained at every stage, spanning from the flower growers, wholesalers, and retailers to the end customer. Failure to uphold the required level of freshness can lead to adverse outcomes such as decreased profits, customer attrition, and a tarnished reputation. To investigate this complex distribution process, fresh flower distribution was studied using data from a reputed floral company in Sri Lanka with the aim of finding the optimal set of routes for the distribution of fresh-cut flowers. Methods: Vehicle Routing Problem (VRP) variants were employed and the 'Capacitated Vehicle Routing Problem with Time Windows for Perishable Goods with Single Depot' (CVRPTWfPGSD) was introduced. A hybrid method combining both heuristics and metaheuristics was selected as the methodology by considering several factors such as complexity, solution type, and execution time. The initial solution construction phase adopted the Path Cheapest Arc (PCA) heuristic. To further improve solution quality, the Guided Local Search (GLS) metaheuristic was applied. Results: This CVRPTWfPGSD model is validated for real-world scenarios, as it does not violate the maximum allowable perishability time provided for each vehicle. Three experiments were conducted by varying the vehicle fleet to measure the applicability of the model under different circumstances to decide on a better vehicle combination while minimizing total distribution time. Based on this analysis, it can be concluded that the composition of the vehicle fleet has a substantial influence on freshness levels and distribution times. Conclusions: Optimizing the distribution of fresh-cut flowers using VRP assists in reducing spoilage and waste by ensuring that flowers are transported under the best possible conditions. The application of this model holds immense value for floral companies as it offers assistance when planning their distribution network. Specifically, it can assist in identifying optimal routes that maximize freshness with minimum distribution time and an optimal set of vehicles.(original abstract)
Czasopismo
Rocznik
Tom
20
Numer
Strony
23--37
Opis fizyczny
Twórcy
autor
  • University of Moratuwa, Sri Lanka
  • University of Moratuwa, Sri Lanka
  • University of Moratuwa, Sri Lanka
  • Aalborg University Copenhagen, Denmark
  • University of Moratuwa, Sri Lanka
Bibliografia
  • Ahumada, O., & Villalobos, J. R. (2011). A tactical model for planning the production and distribution of fresh produce. Annals of Operations Research, 190(1), 339-358. https://doi.org/10.1007/s10479-009-0614-4
  • Calvete, H. I., Galé, C., Oliveros, M. J., & Sánchez-Valverde, B. (2004). Vehicle routing problems with soft time windows: an optimization based approach. Monografías Del Seminario Matemático García de Galdeano, 31(January 2014), 295-304.
  • Esmaili, M. H., & Mousavi, S. M. (2020). An integrated perishable inventory routing problem with consistent driver services and fresh product delivery using possibility and necessity measures. International Journal of Industrial Engineering and Production Research, 31(2), 231-242. https://doi.org/10.22068/ijiepr.31.2.231
  • Fernando, M., D. D. DHANANJAYA, J.A MUNASINGHE, Amal S. KUMARAGE, T. SIVAKUMAR, & A.S. PERERA. (2021). Post-Processing of GPS Data for Bus Link Speed Determination based on GIS. Journal of the Eastern Asia Society for Transportation Studies, 14(January 2022), 1179-1192.
  • Fernando, M., Thibbotuwawa, A., Perera, H. N., & Chandima Ratnayake, R. M. (2022). Applying a Capacitated Heterogeneous Fleet Vehicle Routing Problem with Multiple Depots Model to Optimize a Retail Chain Distribution Network. IEEE International Conference on Industrial Engineering and Engineering Management, 2022-Decem, 588-592. https://doi.org/10.1109/IEEM55944.2022.9989636
  • Fernando, M., Thibbotuwawa, A., Perera, H. N., & Ratnayake, R. M. C. (2022). Close-Open Mixed Vehicle Routing Optimization Model with Multiple Collecting Centers to Collect Farmers' Perishable Produce. 2022 International Conference for Advancement in Technology, ICONAT 2022, 1-8. https://doi.org/10.1109/ICONAT53423.2022.9725977
  • FloraLife. (2023). Care and Handling Best Practices (p. 0). LivRio Magazine.
  • Galarcio Noguera, J. D., Hernández Riaño, H. E., & López Pereira, J. M. (2018). Hybrid PSO-TS-CHR Algorithm Applied to the Vehicle Routing Problem for Multiple Perishable Products Delivery. Communications in Computer and Information Science, 916, 61-72. https://doi.org/10.1007/978-3-030-00353-1_6
  • Gupta, J., & Dubey, R. K. (2018). Factors Affecting Post-Harvest Life of Flower Crops. International Journal of Current Microbiology and Applied Sciences, 7(1), 548-557. https://doi.org/10.20546/ijcmas.2018.701.065
  • Halevy, A. H., & Mayak, S. (2011). Senescence and Postharvest Physiology of Cut Flowers-Part 2. Horticultural Reviews, 59-143. https://doi.org/10.1002/9781118060766.ch3
  • Malindretos, G. (2018). Cut-flowers supply chain. September 2016.
  • Perron, L., & Furnon, V. (2023). OR-Tools.
  • Ruiz-Garcia, L., & Lunadei, L. (2010). Monitoring Cold Chain Logistics by Means of RFID. In C. Turcu (Ed.), Sustainable Radio Frequency Identification Solutions. IntechOpen. https://doi.org/10.5772/8006
  • Shaabani, H. (2022). A literature review of the perishable inventory routing problem. Asian Journal of Shipping and Logistics, 38(3), 143-161. https://doi.org/10.1016/j.ajsl.2022.05.002
  • Sirisaranlak, P. (2017). The Cool Supply Chain Management for Cut Flowers oncordance for Self- English Writing of. 2004.
  • Taillard, Eric; Badeau, P; Gendreau, M. (1997). A tabu search heuristic for the VRP with soft TW. In Transportation Science (Vol. 31, Issue 2, pp. 170-186).
  • Toth, P., & Vigo, D. (2001). THE VEHICLE ROUTING PROBLEM. Society for Industrial and Applied Mathematics Philadelphia.
  • Van Rijswick, C. (2015). World Floriculture Map 2015. Rabobank Industry Note,
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.ekon-element-000171685154

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.