{"type":"ScholarlyArticle","title":"Mean Payoff Optimization for Systems of Periodic Service and Maintenance","authors":[{"name":"David Klaška","slug":"david-klaska","given":"David","family":"Klaska","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Antonín Kučera","slug":"antonin-kucera","given":"Antonin","family":"Kucera","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Vít Musil","slug":"vit-musil","given":"Vit","family":"Musil","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Vojtěch Řehák","slug":"vojtech-rehak","given":"Vojtech","family":"Rehak","affiliation":"Masaryk University , Brno , Czech Republic"}],"abstract":"Consider oriented graph nodes requiring periodic visits by a service agent. The agent moves among the nodes and receives a payoff for each completed service task, depending on the time elapsed since the previous visit to a node. We consider the problem of finding a suitable schedule for the agent to maximize its long-run average payoff per time unit. We show that the problem of constructing an epsilon-optimal schedule is PSPACE-hard for every fixed non-negative epsilon, and that there exists an optimal periodic schedule of exponential length. We propose randomized finite-memory (RFM) schedules as a compact description of the agent's strategies and design an efficient algorithm for constructing RFM schedules. Furthermore, we construct deterministic periodic schedules by sampling from RFM schedules.","doi":"10.24963/ijcai.2023/598","url":"https://ijcai.org/proceedings/2023/598","pdf":"https://ijcai.org/proceedings/2023/0598.pdf","markdown":"https://ijcai.org/proceedings/2023/598.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/598","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Planning and Scheduling","track":"Main Track","number":598,"pages":{"first":5386,"last":5393},"keywords":["Planning and Scheduling: PS: Routing","Robotics: ROB: Motion and path planning","Planning and Scheduling: PS: Robot planning"],"videos":[],"references":[{"position":1,"raw":"[Basilico et al., 2009] N. Basilico, N. Gatti, and F. Amigoni. Leader-follower strategies for robotic patrolling in envi- ronments with arbitrary topologies. In Proceedings of AA- MAS 2009, pages 57-64, 2009.","title":"Leader-follower strategies for robotic patrolling in envi-ronments with arbitrary topologies","authors":"N Basilico, N Gatti, F Amigoni","year":"2009","venue":"Proceedings of AA-MAS 2009","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bertels and Fahle, 2006] S. Bertels and T. Fahle. A hybrid setup for a hybrid scenario: Combining heuristics for the home health care problem. Computers & Operations Re- search, 33(10):2866-2890, 2006.","title":"A hybrid setup for a hybrid scenario: Combining heuristics for the home health care problem","authors":"S Bertels, T Fahle","year":"2006","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bostel et al., 2008] N. Bostel, P. Dejax, P. Guez, and F. Tri- coire. Multiperiod planning and routing on a rolling hori- zon for field force optimization logistics. In The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, 2008.","title":"Multiperiod planning and routing on a rolling horizon for field force optimization logistics","authors":"N Bostel, P Dejax, P Guez, F Tricoire","year":"2008","venue":"The Vehicle Routing Problem: Latest Advances and New Challenges","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Boussier et al., 2007] S. Boussier, D. Feillet, and M. Gen- dreau. An exact algorithm for team orienteering problems. 4OR-Q J. Oper. Res., 5:211-230, 2007.","title":"An exact algorithm for team orienteering problems. 4OR-Q","authors":"S Boussier, D Feillet, M Gendreau","year":"2007","venue":"J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Castillo-Salazar et al., 2016] J. Arturo Castillo-Salazar, Dario Landa-Silva, and Rong Qu. Workforce scheduling and routing problems: Literature survey and computa- tional study. Ann. Oper. Res., 239:39-67, 2016.","title":"Workforce scheduling and routing problems: Literature survey and computational study","authors":"Castillo-Salazar","year":"2016","venue":"Ann. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen et al., 2016] Y. Chen, F. Polack, P. Cowling, P. Mour- djis, and S. Remde. Risk driven analysis of mainte- nance for a large-scale drainage system. In Proceedings of ICORES 2016, pages 296-303. SciTePress, 2016.","title":"Risk driven analysis of maintenance for a large-scale drainage system","authors":"Y Chen, F Polack, P Cowling, P Mourdjis, S Remde","year":"2016","venue":"Proceedings of ICORES 2016","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cordeau et al., 2010] J.-F. Cordeau, G. Laporte, F. Pasin, and S. Ropke. Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4):393-409, 2010.","title":"Scheduling technicians and tasks in a telecommunications company","authors":"J.-F Cordeau, G Laporte, F Pasin, S Ropke","year":"2010","venue":"Journal of Scheduling","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dahite et al., 2020] L. Dahite, A. Kadrani, R. Benmansour, R.N. Guibadj, and C. Fonlupt. Optimization of mainte- nance planning and routing problems. In R. Benmansour, A. Sifaleras, and N. Mladenović, editors, Variable Neigh- borhood Search. Springer, 2020.","title":"Optimization of maintenance planning and routing problems","authors":"L Dahite, A Kadrani, R Benmansour, R N Guibadj, C Fonlupt","year":"2020","venue":"Variable Neighborhood Search","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ehrenfeucht and Mycielski, 1979] A. Ehrenfeucht and J. Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory, 8:109-113, 1979.","title":"Positional strategies for mean payoff games","authors":"A Ehrenfeucht, J Mycielski","year":"1979","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Eveborn et al., 2006] P. Eveborn, P. Flisberg, and M. Rönnqvist. Laps Care -an operational system for staff planning of home care. European Journal of Operational Research, 171(3):962-976, 2006.","title":"Laps Care -an operational system for staff planning of home care","authors":"P Eveborn, P Flisberg, M Rönnqvist","year":"2006","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ho and Ouaknine, 2015] Hsi-Ming Ho and J. Ouaknine. The cyclic-routing UAV problem is PSPACE-complete. In Proceedings of FoSSaCS 2015, volume 9034 of LNCS, pages 328-342. Springer, 2015.","title":"The cyclic-routing UAV problem is PSPACE-complete","authors":"Hsi-Ming Ho, J Ouaknine","year":"2015","venue":"Proceedings of FoSSaCS 2015","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Jbili et al., 2018] S. Jbili, A. Chelbi, M. Radhoui, and M. Kessentini. Integrated strategy of vehicle routing and maintenance. Reliab. Eng. Syst. Saf., 170:202-214, 2018.","title":"Integrated strategy of vehicle routing and maintenance","authors":"S Jbili, A Chelbi, M Radhoui, M Kessentini","year":"2018","venue":"Reliab. Eng. Syst. Saf","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kallehauge et al., 2005] B. Kallehauge, J. Larsen, O.B. Madsen, and M.M. Solomon. Vehicle routing problem with time windows. In Column Generation. Springer.","title":"Vehicle routing problem with time windows","authors":"B Kallehauge, J Larsen, O B Madsen, M M Solomon","year":null,"venue":"Column Generation","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kingma and Ba, 2015] D. P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In Proceedings of ICLR 2015, 2015.","title":"Adam: A method for stochastic optimization","authors":"D P Kingma, Jimmy Ba","year":"2015","venue":"Proceedings of ICLR 2015","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Klaška et al., 2021] D. Klaška, A. Kučera, V. Musil, and V. Řehák. Regstar: Efficient strategy synthesis for adver- sarial patrolling games. In Proceedings of UAI 2021, pages 471-481, 2021.","title":"Regstar: Efficient strategy synthesis for adversarial patrolling games","authors":"D Klaška, A Kučera, V Musil, V Řehák","year":"2021","venue":"Proceedings of UAI 2021","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Klaška et al., 2023] D. Klaška, A. Kučera, V. Musil, and V. Řehák. Mean Payoff Optimization for Systems of Periodic Service and Maintenance. arXiv:2305.08555 [cs.GT], 2023.","title":"Mean Payoff Optimization for Systems of Periodic Service and Maintenance","authors":"D Klaška, A Kučera, V Musil, V Řehák","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kovacs et al., 2011] A.A. Kovacs, S.N. Parragh, K.F. Do- erner, and R.F. Hartl. Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling, 15(5):579-600, 2011.","title":"Adaptive large neighborhood search for service technician routing and scheduling problems","authors":"A A Kovacs, S N Parragh, K F Doerner, R F Hartl","year":"2011","venue":"Journal of Scheduling","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[López-Santana et al., 2016] E. López-Santana, R. Akhavan-Tabatabaei, L. Dieulle, N. Labadie, and A.L. Medaglia. On the combined maintenance and routing optimization problem. Reliab. Eng. Syst. Saf., 145:199-214, 2016.","title":"On the combined maintenance and routing optimization problem","authors":"López-Santana","year":"2016","venue":"Reliab. Eng. Syst. Saf","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Norris, 1998] J.R. Norris. Markov Chains. Cambridge Uni- versity Press, 1998.","title":"Markov Chains","authors":"J R Norris","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Paszke et al., 2019] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, Lu Fang, J. Bai, and S. Chintala. Pytorch: An imperative style, high- performance deep learning library. In Advances in Neu- ral Information Processing Systems 32, pages 8024-8035.","title":"Pytorch: An imperative style, highperformance deep learning library","authors":"A Paszke, S Gross, F Massa, A Lerer, J Bradbury, G Chanan, T Killeen, Z Lin, N Gimelshein, L Antiga, A Desmaison, A Kopf, E Yang, Z Devito, M Raison, A Tejani, S Chilamkurthy, B Steiner, Lu Fang, J Bai, S Chintala","year":null,"venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"Curran Associates, Inc., 2019.","title":null,"authors":"Curran Associates, Inc","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pillac et al., 2013] V. Pillac, C. Guéret, and A.L. Medaglia. A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett., 7:1525-1535, 2013.","title":"A parallel matheuristic for the technician routing and scheduling problem","authors":"V Pillac, C Guéret, A L Medaglia","year":"2013","venue":"Optim. Lett","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Souffriau et al., 2013] W. Souffriau, P. Vansteenwegen, G. Vanden Berghe, and D. Van Oudheusden. The mul- ticonstraint team orienteering problem with multiple time windows. Transportation Science, 47(1):53-63, 2013.","title":"The multiconstraint team orienteering problem with multiple time windows","authors":"W Souffriau, P Vansteenwegen, G Vanden, D Berghe, Van Oudheusden","year":"2013","venue":"Transportation Science","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Tang et al., 2007] H. Tang, E. Miller-Hooks, and R. Tomas- tik. Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Research Part E: Logistics and Transportation Review, 43(5):591-609, 2007.","title":"Scheduling technicians for planned maintenance of geographically distributed equipment","authors":"H Tang, E Miller-Hooks, R Tomastik","year":"2007","venue":"Transportation Research Part E: Logistics and Transportation Review","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Tarjan, 1972] R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2), 1972.","title":"Depth-first search and linear graph algorithms","authors":"R Tarjan","year":"1972","venue":"SIAM Journal of Computing","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Toth and Vigo, 2001] P. Toth and D. Vigo. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathe- matics and Applications. SIAM, 2001.","title":"The Vehicle Routing Problem","authors":"P Toth, D Vigo","year":"2001","venue":"SIAM Monographs on Discrete Mathematics and Applications","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Vorobeychik et al., 2012] Y. Vorobeychik, B. An, and M. Tambe. Adversarial patrolling games. In Proceedings of AAAI 2012, pages 91-98, 2012.","title":"Adversarial patrolling games","authors":"Y Vorobeychik, B An, M Tambe","year":"2012","venue":"Proceedings of AAAI 2012","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Xu and Chiu, 2001] J. Xu and S.Y. Chiu. Effective heuris- tic procedures for a field technician scheduling problem. Journal of Heuristics, 7:495-509, 2001.","title":"Effective heuristic procedures for a field technician scheduling problem","authors":"Chiu Xu, ] J Xu, S Y Chiu","year":"2001","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Zamorano and Stolletz, 2017] E. Zamorano and R. Stolletz. Branch-and-price approaches for the Multiperiod Techni- cian Routing and Scheduling Problem. European Journal of Operational Research, 257(1):55-68, 2017.","title":"Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem","authors":"E Zamorano, R Stolletz","year":"2017","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}