{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T03:13:22Z","timestamp":1777086802195,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-025-00599-7","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T12:06:20Z","timestamp":1767614780000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Supply Chains in Agriculture Through Cluster-Based Route Optimization"],"prefix":"10.1007","volume":"7","author":[{"given":"Bhavik","family":"Bharambe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nishant","family":"Patil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naman","family":"Kothari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Shingade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushila","family":"Shingade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"issue":"2","key":"599_CR1","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2020.01.053","volume":"285","author":"P Baniasadi","year":"2020","unstructured":"Baniasadi P, Foumani M, Smith-Miles K, Ejov V (2020) A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. Eur J Oper Res 285(2):444\u2013457","journal-title":"Eur J Oper Res"},{"key":"599_CR2","doi-asserted-by":"crossref","unstructured":"Wu D, Cui J, Li D et al (2022) A new route optimization approach of fresh agricultural logistics distribution. Intell Autom Soft Comput 34(3)","DOI":"10.32604\/iasc.2022.028780"},{"issue":"11","key":"599_CR3","first-page":"1174","volume":"51","author":"E Balugani","year":"2018","unstructured":"Balugani E, Lolli F, Gamberini R, Rimini B, Regattieri A (2018) Clustering for inventory control systems IFAC-PapersOnLine 51(11):1174\u20131179","journal-title":"Clustering for inventory control systems IFAC-PapersOnLine"},{"key":"599_CR4","doi-asserted-by":"crossref","unstructured":"Geiger A (2024) Enhancing supply chain coordination: a comparative analysis of clustering techniques for the production routing problem. Comput Ind Eng 196","DOI":"10.1016\/j.cie.2024.110455"},{"issue":"2","key":"599_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2021.07.040","volume":"299","author":"TE Goltsos","year":"2022","unstructured":"Goltsos TE, Syntetos AA, Glock CH, Ioannou G (2022) Inventory-forecasting: mind the gap. Eur J Oper Res 299(2):397\u2013419","journal-title":"Eur J Oper Res"},{"key":"599_CR6","doi-asserted-by":"crossref","unstructured":"Balugani E, Lolli F, Gamberini R, Rimini B, Regattieri A (2018) Clustering for inventory control systems","DOI":"10.1016\/j.ifacol.2018.08.431"},{"key":"599_CR7","doi-asserted-by":"crossref","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints","DOI":"10.1016\/j.ejor.2011.07.037"},{"key":"599_CR8","doi-asserted-by":"crossref","unstructured":"Baniasadi P, Foumani M, Smith-Miles K, Ejov V (2020) A transformation technique for the clustered generalized traveling salesman problem with applications to logistics","DOI":"10.1016\/j.ejor.2020.01.053"},{"issue":"8","key":"599_CR9","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1016\/j.trb.2011.02.004","volume":"45","author":"T Bekta\u015f","year":"2011","unstructured":"Bekta\u015f T, Laporte G (2011) The pollution-routing problem. Transp Res Part B Methodol 45(8):1232\u20131250","journal-title":"Transp Res Part B Methodol"},{"key":"599_CR10","doi-asserted-by":"crossref","unstructured":"Ahmed Z, Sadjadpour H (2021) Constrained resource allocation problems in communications: an information-assisted approach","DOI":"10.1109\/MILCOM52596.2021.9652917"},{"key":"599_CR11","doi-asserted-by":"crossref","unstructured":"Ford B, Aggarwal R, Kumar M (2022) Backtracking hybrid a* for resource constrained path planning","DOI":"10.2514\/6.2022-1592"},{"key":"599_CR12","unstructured":"Lattanzi S, Svensson O, Vassilvitskii S (2023) Speeding up bellman ford via minimum violation permutations. In: International conference on machine learning, PMLR, pp 18584\u201318598"},{"key":"599_CR13","doi-asserted-by":"crossref","unstructured":"Yusuf MR, Nurwan N, Wungguli D, Yahya L (2023) Implementation of the Floyd-Warshall algorithm and Bellman-Ford algorithm to determine the shortest path in the distribution of LPG gas. In: E3S Web of Conferences. vol 400. EDP Sciences, p 03004","DOI":"10.1051\/e3sconf\/202340003004"},{"key":"599_CR14","unstructured":"Chmeiss A, Sais L (2001) Constraint satisfaction problems: backtrack search revisited"},{"key":"599_CR15","unstructured":"Krokhin A, Zivny S (2017) The constraint satisfaction problem: complexity and approximability. Schloss Dagstuhl"},{"issue":"3","key":"599_CR16","first-page":"155","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Netw Intl J 51(3):155\u2013170","journal-title":"Netw Intl J"},{"key":"599_CR17","doi-asserted-by":"crossref","unstructured":"Risald AEM (2017) Suyoto: best routes selection using Dijkstra and Floyd-Warshall algorithm. In: 2017 11th international conference on information & communication technology and system (ICTS)","DOI":"10.1109\/ICTS.2017.8265662"},{"key":"599_CR18","doi-asserted-by":"crossref","unstructured":"Azis H, Mallongi R, Lantara D, Salim Y (2018) Comparison of Floyd-Warshall algorithm and greedy algorithm in determining the shortest route. In: 2018 2nd East indonesia conference on computer and information technology (EIConCIT)","DOI":"10.1109\/EIConCIT.2018.8878582"},{"key":"599_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.58443\/IJREX.10.11.2022.46-57","volume":"10","author":"S Barkund","year":"2022","unstructured":"Barkund S, Sharma A, Bhapkar H (2022) Survey of shortest path algorithms. Intl J Renew Energy Exchange 10:46\u201357","journal-title":"Intl J Renew Energy Exchange"},{"key":"599_CR20","doi-asserted-by":"crossref","unstructured":"Szcze\u015bniak I, Jajszczyk A, Wo\u017ana-Szcze\u015bniak B (2019) Generic Dijkstra for optical networks. J Opt Commun Netw 11(11):568","DOI":"10.1364\/JOCN.11.000568"},{"key":"599_CR21","doi-asserted-by":"crossref","unstructured":"Lusiani A, Sartika E, Binarto A, Habinuddin E, Azis I (2021) Determination of the fastest path on logistics distribution by using Dijkstra algorithm. In: 2nd international seminar of science and applied technology (ISSAT), Atlantis Press, pp 246\u2013250","DOI":"10.2991\/aer.k.211106.039"},{"key":"599_CR22","doi-asserted-by":"crossref","unstructured":"Gunawan RD, Napianto R, Borman RI, Hanifah I (2019) Implementation of Dijkstra\u2019s algorithm in determining the shortest path (case study: specialist doctor search in Bandar Lampung). Int J Inf Syst Comput Sci 3(3):98\u2013106","DOI":"10.56327\/ijiscs.v3i3.768"},{"key":"599_CR23","doi-asserted-by":"crossref","unstructured":"Basuki YW, A, et al (2015) The extended Dijkstra\u2019s-based load balancing for openflow network. Intl J Electr Comput Eng 5(2):2088\u20138708","DOI":"10.11591\/ijece.v5i2.pp289-296"},{"key":"599_CR24","doi-asserted-by":"crossref","unstructured":"Pramudita R, Heryanto H, Handayanto RT, Setiyadi D, Arifin RW, Safitri N (2019) Shortest path calculation algorithms for geographic information systems. 2019 4th international conference on informatics and computing (ICIC)","DOI":"10.1109\/ICIC47613.2019.8985871"},{"key":"599_CR25","unstructured":"Mohammad A (2016) An approach to geographic information system (GIS) modeling and determination of the quickest route for vegetable delivery\/mohammad abousaeidi. PhD thesis University of Malaya"},{"key":"599_CR26","unstructured":"Patel V, Baggar PC (2014) A survey paper of Bellman-Ford algorithm and Dijkstra algorithm for finding shortest path in gis application"},{"key":"599_CR27","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez-Puente R, Lazo-Cort\u00e9s M (2013) Algorithm for shortest path search in geographic information systems by using reduced graphs. Springerplus 2(1). https:\/\/doi.org\/10.1186\/2193-1801-2-291","DOI":"10.1186\/2193-1801-2-291"},{"key":"599_CR28","doi-asserted-by":"crossref","unstructured":"Toroslu IH (2023) The Floyd-Warshall all-pairs shortest paths algorithm for disconnected and very sparse graphs. Software: Pract Exper 53(6):1287\u20131303","DOI":"10.1002\/spe.3188"},{"issue":"2","key":"599_CR29","doi-asserted-by":"publisher","first-page":"453","DOI":"10.55927\/fjst.v2i2.2858","volume":"2","author":"MA Samosir","year":"2023","unstructured":"Samosir MA (2023) Application of the Dijkstra and Floyd-Warshall algorithms in determining the shortest route to tourist attractions in Toba. Formosa J Sci Technol 2(2):453\u201374","journal-title":"Formosa J Sci Technol"},{"key":"599_CR30","doi-asserted-by":"crossref","unstructured":"Habib S, Majeed A, Akram M, Ali\u00a0Al-Shamiri MM (2023) Floyd-Warshall algorithm based on picture fuzzy information. CMES-Comput Model Eng Sci 136(3)","DOI":"10.32604\/cmes.2023.026294"},{"key":"599_CR31","doi-asserted-by":"crossref","unstructured":"Marpaung F, Harliana P (2023) Floyd-Warshall algorithm for web-based route optimization for a road network study in Medan city. Jurnal Multidisiplin Madani (MUDIMA) 3(11)","DOI":"10.55927\/mudima.v3i11.6674"},{"key":"599_CR32","doi-asserted-by":"crossref","unstructured":"Takaoka T, Hashim M (2010) A simpler algorithm for the all pairs shortest path problem with o (n 2log n) expected time. In: International conference on combinatorial optimization and applications, Springer, pp 195\u2013206","DOI":"10.1007\/978-3-642-17461-2_16"},{"key":"599_CR33","doi-asserted-by":"crossref","unstructured":"Ajayi A.D, Boiarskii B, Aoyagi K, Hasegawa H (2024) Utilizing MapBox API, Java and ICT in the creation of agricultural interactive maps for improved farm management and decision-making","DOI":"10.3934\/agrfood.2024023"},{"key":"599_CR34","doi-asserted-by":"crossref","unstructured":"Cachon GP, Netessine S (2006) Game theory in supply chain analysis. Models, methods and applications for innovative decision making, pp 200\u2013233","DOI":"10.1287\/educ.1063.0023"},{"key":"599_CR35","doi-asserted-by":"crossref","unstructured":"Liu S, Chen Y, Li N, Qu L (2008) Cost allocation based on game theory in supply chain coordination. In: 2008 international workshop on modelling, simulation and optimization, IEEE, pp 233\u2013236","DOI":"10.1109\/WMSO.2008.17"},{"key":"599_CR36","unstructured":"Sood S.K et al (2025) A multifaceted analysis of intelligent vehicle route optimization. IEEE Trans Intell Transp Syst"},{"key":"599_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.clscn.2023.100137","volume":"10","author":"WM Fernando","year":"2024","unstructured":"Fernando WM, Thibbotuwawa A, Perera HN, Nielsen P, Kilic DK (2024) An integrated vehicle routing model to optimize agricultural products distribution in retail chains. Clean Logist Supply Chain 10:100137","journal-title":"Clean Logist Supply Chain"},{"key":"599_CR38","doi-asserted-by":"crossref","unstructured":"De A, Tocco B, Gorton M (2025) Optimizing short food supply chain logistics to lower carbon emissions and enhance operational efficiency for small-scale rural producers. Transp Res Part D 146","DOI":"10.1016\/j.trd.2025.104855"},{"issue":"1","key":"599_CR39","doi-asserted-by":"publisher","first-page":"122","DOI":"10.30574\/wjarr.2024.24.1.3023","volume":"24","author":"OB Arowosegbe","year":"2024","unstructured":"Arowosegbe OB, Ballali C, Kofi KR, Adeshina MK, Agbelusi J, Adeshina MA (2024) Combating food waste in the agricultural supply chain: a systematic review of supply chain optimization strategies and their sustainability benefits. World J Adv Res Rev 24(1):122\u2013140","journal-title":"World J Adv Res Rev"},{"key":"599_CR40","volume":"23","author":"HM G\u00e1mez-Alb\u00e1n","year":"2024","unstructured":"G\u00e1mez-Alb\u00e1n HM, Guisson R, De Meyer A (2024) Optimizing the organization of the first mile in agri-food supply chains with a heterogeneous fleet using a mixed-integer linear model. Intell Syst Appl 23:200426","journal-title":"Intell Syst Appl"},{"issue":"23","key":"599_CR41","doi-asserted-by":"publisher","first-page":"3831","DOI":"10.3390\/math12233831","volume":"12","author":"H Sun","year":"2024","unstructured":"Sun H, He M, Gai Y, Cao J (2024) Optimization of fresh food logistics routes for heterogeneous fleets in segmented transshipment mode. Math 12(23):3831","journal-title":"Math"},{"issue":"1","key":"599_CR42","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10479-023-05769-6","volume":"335","author":"C Boonmee","year":"2024","unstructured":"Boonmee C, Akarawongsapat K, Wisittipanich W, Chattinnawat W, Khwanngern K (2024) Differential evolution for cleft lip and\/or cleft palate patient treatment scheduling problems: a Northern Thailand hospital case study. Ann Oper Res 335(1):563\u2013595","journal-title":"Ann Oper Res"},{"key":"599_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101245","volume":"77","author":"IP Souza","year":"2023","unstructured":"Souza IP, Boeres MCS, Moraes REN (2023) A robust algorithm based on differential evolution with local search for the capacitated vehicle routing problem. Swarm Evol Comput 77:101245","journal-title":"Swarm Evol Comput"},{"key":"599_CR44","doi-asserted-by":"crossref","unstructured":"Ahmed IZ, Sadjadpour H, Yousefi S (2021) Constrained resource allocation problems in communications: an information-assisted approach. In: MILCOM 2021-2021 IEEE military communications conference (MILCOM), IEEE, pp 243\u2013248","DOI":"10.1109\/MILCOM52596.2021.9652917"},{"key":"599_CR45","doi-asserted-by":"crossref","unstructured":"Ford BT, Aggarwal R, Kumar M, Manyam SG, Casbeer D, Grymin D (2022) Backtracking hybrid a* for resource constrained path planning. In: AIAA SCITECH 2022 Forum, p 1592","DOI":"10.2514\/6.2022-1592"},{"key":"599_CR46","unstructured":"Grama A (2008) An introduction to parallel computing: design and analysis of algorithms 2\/e. Pearson Education India"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-025-00599-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:20:48Z","timestamp":1774416048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-025-00599-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":46,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["599"],"URL":"https:\/\/doi.org\/10.1007\/s43069-025-00599-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"30 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"13"}}