{"type":"ScholarlyArticle","title":"Improved Approximation Algorithms for Capacitated Location Routing","authors":[{"name":"Jingyang Zhao","slug":"jingyang-zhao","given":"Jingyang","family":"Zhao","affiliation":"University of Electronic Science and Technology of China , Chengdu , China"},{"name":"Mingyu Xiao","slug":"mingyu-xiao","given":"Mingyu","family":"Xiao","affiliation":"University of Electronic Science and Technology of China , Chengdu , China"},{"name":"Shunwang Wang","slug":"shunwang-wang","given":"Shunwang","family":"Wang","affiliation":"University of Electronic Science and Technology of China , Chengdu , China"}],"abstract":"The Capacitated Location Routing Problem is an important planning and routing problem in logistics, which generalizes the capacitated vehicle routing problem and the uncapacitated facility location problem. In this problem, we are given a set of depots and a set of customers where each depot has an opening cost and each customer has a demand, and we need to use minimum cost to open some depots and route capacitated vehicles in the opened depots to satisfy all customers' demand. In this paper, we propose a 4.169-approximation algorithm for this problem, improving the best-known 4.38-approximation ratio (Transportation Science 2013). Moreover, if the demand of each customer is allowed to be delivered by multiple tours, we propose a more refined 4.092-approximation algorithm. Experimental study on benchmark instances shows that the quality of our computed solutions is better than that of previous algorithms and is also much closer to optimality than the provable approximation factor.","doi":"10.24963/ijcai.2024/752","url":"https://ijcai.org/proceedings/2024/752","pdf":"https://ijcai.org/proceedings/2024/0752.pdf","markdown":"https://ijcai.org/proceedings/2024/752.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/752","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Planning and Scheduling","track":"Main Track","number":752,"pages":{"first":6805,"last":6813},"keywords":["Planning and Scheduling: PS: Planning algorithms","Planning and Scheduling: PS: Theoretical foundations of planning","Planning and Scheduling: PS: Routing"],"videos":[],"references":[{"position":1,"raw":"[Altinkemer and Gavish, 1987] Kemal Altinkemer and Bezalel Gavish. Heuristics for unequal weight delivery problems with a fixed error guarantee. Operations Research Letters, 6(4):149-158, 1987.","title":"Heuristics for unequal weight delivery problems with a fixed error guarantee","authors":"Gavish Altinkemer, Kemal Altinkemer, Bezalel Gavish","year":"1987","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[An et al., 2017] Hyung-Chan An, Mohit Singh, and Ola Svensson. LP-based algorithms for capacitated facility location. SIAM Journal on Computing, 46(1):272-306, 2017.","title":"LP-based algorithms for capacitated facility location","authors":"Mohit Hyung-Chan An, Ola Singh, Svensson","year":"2017","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baldacci et al., 2009] R Baldacci, A Mingozzi, and R Wolfer-Calvo. The capacitated location routing problem. Presented at ROUTE 2009, 2009.","title":"The capacitated location routing problem","authors":"Baldacci, R Mingozzi, Wolfer-Calvo","year":"2009","venue":"Presented at ROUTE 2009","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baldacci et al., 2011] Roberto Baldacci, Aristide Mingozzi, and Roberto Wolfler Calvo. An exact method for the ca- pacitated location-routing problem. Operations research, 59(5):1284-1296, 2011.","title":"An exact method for the capacitated location-routing problem","authors":"Roberto Baldacci, Aristide Mingozzi, Roberto Wolfler, Calvo","year":"2011","venue":"Operations research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Barreto et al., 2007] Sérgio Barreto, Carlos Ferreira, Jose Paixao, and Beatriz Sousa Santos. Using clustering anal- ysis in a capacitated location-routing problem. European journal of operational research, 179(3):968-977, 2007.","title":"Using clustering analysis in a capacitated location-routing problem","authors":"Sérgio Barreto, Carlos Ferreira, Jose Paixao, Beatriz Sousa, Santos","year":"2007","venue":"European journal of operational research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Blauth et al., 2022] Jannis Blauth, Vera Traub, and Jens Vy- gen. Improving the approximation ratio for capacitated vehicle routing. Mathematical Programming, pages 1-47, 2022.","title":"Improving the approximation ratio for capacitated vehicle routing","authors":"Jannis Blauth, Vera Traub, Jens Vygen","year":"2022","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Byrka and Aardal, 2010] Jaroslaw Byrka and Karen I. Aardal. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput., 39(6):2212-2231, 2010.","title":"An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem","authors":"Jaroslaw Byrka, Karen I","year":"2010","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Christofides, 1976] Nicos Christofides. Worst-case analy- sis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University, 1976.","title":"Worst-case analysis of a new heuristic for the travelling salesman problem","authors":"Nicos Christofides","year":"1976","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chudak and Shmoys, 2003] Fabián A. Chudak and David B. Shmoys. Improved approximation algo- rithms for the uncapacitated facility location problem. SIAM J. Comput., 33(1):1-25, 2003.","title":"Improved approximation algorithms for the uncapacitated facility location problem","authors":"Fabián A Chudak, David B Shmoys","year":"2003","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Contardo et al., 2014] Claudio Contardo, Jean-Franc ¸ois Cordeau, and Bernard Gendron. An exact algorithm based on cut-and-column generation for the capaci- tated location-routing problem. INFORMS Journal on Computing, 26(1):88-102, 2014.","title":"An exact algorithm based on cut-and-column generation for the capacitated location-routing problem","authors":"Claudio Contardo, Jean-Franc ¸ois Cordeau, Bernard Gendron","year":"2014","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Deppert et al., 2023] Max Deppert, Matthias Kaul, and Matthias Mnich. A (3/2 + ε)-approximation for multiple TSP with a variable number of depots. In ESA 2023, vol- ume 274 of LIPIcs, pages 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","title":"A (3/2 + ε)-approximation for multiple TSP with a variable number of depots","authors":"Deppert","year":"2023","venue":"ESA 2023","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Drexl and Schneider, 2015] Michael Drexl and Michael Schneider. A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res., 241(2):283- 308, 2015.","title":"A survey of variants and extensions of the location-routing problem","authors":"Schneider Drexl, Michael Drexl, Michael Schneider","year":"2015","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Friggstad et al., 2022] Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, and Mohammad R. Salavatipour. Improved approximations for capacitated vehicle routing with unsplittable client demands. In IPCO 2022, volume 13265 of Lecture Notes in Computer Science, pages 251- 261. Springer, 2022.","title":"Improved approximations for capacitated vehicle routing with unsplittable client demands","authors":"Friggstad","year":"2022","venue":"IPCO 2022","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Haimovich and Kan, 1985] Mordecai Haimovich and Alexander H. G. Rinnooy Kan. Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research, 10(4):527-542, 1985.","title":"Bounds and heuristics for capacitated routing problems","authors":"Kan Haimovich, Mordecai Haimovich, Alexander H G Rinnooy Kan","year":"1985","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Harks et al., 2013] Tobias Harks, Felix G. König, and Jan- nik Matuschke. Approximation algorithms for capaci- tated location routing. Transportation Science, 47(1):3- 22, 2013.","title":"Approximation algorithms for capacitated location routing","authors":"Harks","year":"2013","venue":"Transportation Science","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Heine et al., 2023] Felipe Carrasco Heine, Antonia Dem- leitner, and Jannik Matuschke. Bifactor approximation for location routing with vehicle and facility capacities. Euro- pean Journal of Operational Research, 304(2):429-442, 2023.","title":"Bifactor approximation for location routing with vehicle and facility capacities","authors":"Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke","year":"2023","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Jain et al., 2003] Kamal Jain, Mohammad Mahdian, Evan- gelos Markakis, Amin Saberi, and Vijay V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM, 50(6):795-824, 2003.","title":"Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP","authors":"Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V Vazirani","year":"2003","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Karlin et al., 2021] Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. A (slightly) improved approxima- tion algorithm for metric TSP. In STOC 2021, pages 32- 45. ACM, 2021.","title":"A (slightly) improved approximation algorithm for metric TSP","authors":"Anna R Karlin, Nathan Klein, Shayan Oveis Gharan","year":"2021","venue":"STOC 2021","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Karlin et al., 2023] Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. A deterministic better-than-3/2 ap- proximation algorithm for metric TSP. In IPCO 2023, vol- ume 13904 of Lecture Notes in Computer Science, pages 261-274. Springer, 2023.","title":"A deterministic better-than-3/2 approximation algorithm for metric TSP","authors":"Anna R Karlin, Nathan Klein, Shayan Oveis Gharan","year":"2023","venue":"IPCO 2023","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Li and Simchi-Levi, 1990] Chung-Lun Li and David Simchi-Levi. Worst-case analysis of heuristics for mul- tidepot capacitated vehicle routing problems. INFORMS Journal on Computing, 2(1):64-73, 1990.","title":"Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems","authors":"Chung-Lun Li, David Simchi-Levi","year":"1990","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Li, 2013] Shi Li. A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput., 222:45-58, 2013.","title":"A 1.488 approximation algorithm for the uncapacitated facility location problem","authors":"Li Shi","year":"2013","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Maranzana, 1964] FE Maranzana. On the location of supply points to minimize transport costs. OR, pages 261-270, 1964.","title":"On the location of supply points to minimize transport costs","authors":"Fe Maranzana","year":"1964","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Montoya-Torres et al., 2015] Jairo R Montoya-Torres, Julián López Franco, Santiago Nieto Isaza, Heriberto Fe- lizzola Jiménez, and Nilson Herazo-Padilla. A literature review on the vehicle routing problem with multiple de- pots. Computers & Industrial Engineering, 79:115-129, 2015.","title":"A literature review on the vehicle routing problem with multiple depots","authors":"Julián López Jairo R Montoya-Torres, Santiago Franco, Heriberto Felizzola Nieto Isaza, Nilson Jiménez, Herazo-Padilla","year":"2015","venue":"Computers & Industrial Engineering","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Prins et al., 2007] Christian Prins, Caroline Prodhon, Angel Ruiz, Patrick Soriano, and Roberto Wolfler Calvo. Solv- ing the capacitated location-routing problem by a cooper- ative lagrangean relaxation-granular tabu search heuristic. Transportation science, 41(4):470-483, 2007.","title":"Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic","authors":"Prins","year":"2007","venue":"Transportation science","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Prodhon and Prins, 2014] Caroline Prodhon and Christian Prins. A survey of recent research on location-routing problems. Eur. J. Oper. Res., 238(1):1-17, 2014.","title":"Caroline Prodhon and Christian Prins. A survey of recent research on location-routing problems","authors":"Prins Prodhon","year":"2014","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rathinam et al., 2007] Sivakumar Rathinam, Raja Sen- gupta, and Swaroop Darbha. A resource allocation al- gorithm for multivehicle systems with nonholonomic con- straints. IEEE Transactions on Automation Science and Engineering, 4(1):98-104, 2007.","title":"A resource allocation algorithm for multivehicle systems with nonholonomic constraints","authors":"Sivakumar Rathinam, Raja Sengupta, Swaroop Darbha","year":"2007","venue":"IEEE Transactions on Automation Science and Engineering","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Serdyukov, 1978] Anatolii Ivanovich Serdyukov. Some ex- tremal bypasses in graphs. Upravlyaemye Sistemy, 17:76- 79, 1978.","title":"Some extremal bypasses in graphs","authors":"Anatolii Ivanovich, Serdyukov","year":"1978","venue":"Upravlyaemye Sistemy","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Toth and Vigo, 2014] Paolo Toth and Daniele Vigo. Vehi- cle routing: problems, methods, and applications. SIAM, 2014.","title":"Vehicle routing: problems, methods, and applications","authors":"Paolo Toth, Daniele Vigo","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Traub et al., 2022] Vera Traub, Jens Vygen, and Rico Zen- klusen. Reducing path TSP to TSP. SIAM Journal on Computing, 51(3):20-24, 2022.","title":"Vera Traub, Jens Vygen, and Rico Zenklusen. Reducing path TSP to TSP","authors":"Traub","year":"2022","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Tuzun and Burke, 1999] Dilek Tuzun and Laura I Burke. A two-phase tabu search approach to the location rout- ing problem. European journal of operational research, 116(1):87-99, 1999.","title":"A two-phase tabu search approach to the location routing problem","authors":"Dilek Tuzun, Laura I Burke","year":"1999","venue":"European journal of operational research","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Von Boventer, 1961] Edwin Von Boventer. The relationship between transportation costs and location rent in trans- portation problems. Journal of Regional Science, 3(2):27- 40, 1961.","title":"Edwin Von Boventer. The relationship between transportation costs and location rent in transportation problems","authors":"Von Boventer","year":"1961","venue":"Journal of Regional Science","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Webb, 1968] MHJ Webb. Cost functions in the location of depots for multiple-delivery journeys. OR, pages 311-320, 1968.","title":"Cost functions in the location of depots for multiple-delivery journeys","authors":"; Mhj Webb, Webb","year":"1968","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Williamson and Shmoys, 2011] David P Williamson and David B Shmoys. The design of approximation algo- rithms. Cambridge university press, 2011.","title":"The design of approximation algorithms","authors":"P David, David B Williamson, Shmoys","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Xin et al., 2021] Liang Xin, Wen Song, Zhiguang Cao, and Jie Zhang. Multi-decoder attention model with embedding glimpse for solving vehicle routing problems. In AAAI 2021, pages 12042-12049. AAAI Press, 2021.","title":"Multi-decoder attention model with embedding glimpse for solving vehicle routing problems","authors":"Wen Liang Xin, Zhiguang Song, Jie Cao, Zhang","year":"2021","venue":"AAAI 2021","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Xu and Rodrigues, 2015] Zhou Xu and Brian Rodrigues. A 3/2-approximation algorithm for the multiple tsp with a fixed number of depots. INFORMS Journal on Computing, 27(4):636-645, 2015.","title":"A 3/2-approximation algorithm for the multiple tsp with a fixed number of depots","authors":"Rodrigues Xu, Zhou Xu, Brian Rodrigues","year":"2015","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Xu et al., 2011] Zhou Xu, Liang Xu, and Brian Rodrigues. An analysis of the extended christofides heuristic for the k- depot TSP. Operations Research Letters, 39(3):218-223, 2011.","title":"An analysis of the extended christofides heuristic for the kdepot TSP","authors":"Zhou Xu, Liang Xu, Brian Rodrigues","year":"2011","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Zhang et al., 2015] Zizhen Zhang, Huang He, Zhixing Luo, Hu Qin, and Songshan Guo. An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem. In AAAI 2015, pages 3432-3438. AAAI Press, 2015.","title":"An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem","authors":"Zhang","year":"2015","venue":"AAAI 2015","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Zhao and Xiao, 2023] Jingyang Zhao and Mingyu Xiao. Improved approximation algorithms for multidepot capac- itated vehicle routing. In COCOON 2023, volume 14423 of Lecture Notes in Computer Science, pages 378-391. Springer, 2023.","title":"Improved approximation algorithms for multidepot capacitated vehicle routing","authors":"Jingyang Zhao, Mingyu Xiao","year":"2023","venue":"COCOON 2023","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Zhou et al., 2023] Jianan Zhou, Yaoxin Wu, Wen Song, Zhiguang Cao, and Jie Zhang. Towards omni- generalizable neural methods for vehicle routing prob- lems. In ICML 2023, volume 202 of Proceedings of Machine Learning Research, pages 42769-42789.","title":"Towards omnigeneralizable neural methods for vehicle routing problems","authors":"Jianan Zhou, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang","year":null,"venue":"Proceedings of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"PMLR, 2023.","title":null,"authors":"Pmlr","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}