IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v257y2017i1p55-68.html
   My bibliography  Save this article

Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem

Author

Listed:
  • Zamorano, Emilio
  • Stolletz, Raik

Abstract

This paper addresses a technician routing and scheduling problem motivated by the case of an external maintenance provider. Technicians are proficient in different skills and paired into teams to perform maintenance tasks. Tasks are skill constrained and have time windows that may span multiple days. The objective is to determine the daily assignment of technicians into teams, of teams to tasks, and of teams to daily routes such that the operation costs are minimized. We propose a mixed integer program and a branch-and-price algorithm to solve this problem. Exploiting the structure of the problem, alternative formulations are used for the column generation-phase of the algorithm. Using real-world data from an external maintenance provider, we conduct numerical studies to evaluate the performance of our proposed solution approaches.

Suggested Citation

  • Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.
    • Handle: RePEc:eee:ejores:v:257:y:2017:i:1:p:55-68
    DOI: 10.1016/j.ejor.2016.06.058
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716305173
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.06.058?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    2. A.T. Ernst & H. Jiang & M. Krishnamoorthy & B. Owens & D. Sier, 2004. "An Annotated Bibliography of Personnel Scheduling and Rostering," Annals of Operations Research, Springer, vol. 127(1), pages 21-144, March.
    3. Francis, Peter & Smilowitz, Karen, 2006. "Modeling techniques for periodic vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 872-884, December.
    4. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    5. Tang, Hao & Miller-Hooks, Elise & Tomastik, Robert, 2007. "Scheduling technicians for planned maintenance of geographically distributed equipment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(5), pages 591-609, September.
    6. A Lim & B Rodrigues & L Song, 2004. "Manpower allocation with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1178-1186, November.
    7. Wouter Souffriau & Pieter Vansteenwegen & Greet Vanden Berghe & Dirk Van Oudheusden, 2013. "The Multiconstraint Team Orienteering Problem with Multiple Time Windows," Transportation Science, INFORMS, vol. 47(1), pages 53-63, February.
    8. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    9. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.
    10. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    11. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
    12. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    13. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
    14. Eveborn, Patrik & Flisberg, Patrik & Ronnqvist, Mikael, 2006. "Laps Care--an operational system for staff planning of home care," European Journal of Operational Research, Elsevier, vol. 171(3), pages 962-976, June.
    15. Marius M. Solomon & Jacques Desrosiers, 1988. "Survey Paper---Time Window Constrained Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 22(1), pages 1-13, February.
    16. Moshe Dror, 1994. "Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW," Operations Research, INFORMS, vol. 42(5), pages 977-978, October.
    17. Dries Goossens & Sergey Polyakovskiy & Frits Spieksma & Gerhard Woeginger, 2012. "Between a rock and a hard place: the two-to-one assignment problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 223-237, October.
    18. Fred Blakeley & Burçin Argüello & Buyang Cao & Wolfgang Hall & Joseph Knolmajer, 2003. "Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation," Interfaces, INFORMS, vol. 33(1), pages 67-79, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Annear, Luis Mauricio & Akhavan-Tabatabaei, Raha & Schmid, Verena, 2023. "Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1109-1125.
    2. Si, Guojin & Xia, Tangbin & Li, Yaping & Wang, Dong & Chen, Zhen & Pan, Ershun & Xi, Lifeng, 2023. "Resource allocation and maintenance scheduling for distributed multi-center renewable energy systems considering dynamic scope division," Renewable Energy, Elsevier, vol. 217(C).
    3. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    4. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Nowak, Maciek & Szufel, Przemysław, 2024. "Technician routing and scheduling for the sharing economy," European Journal of Operational Research, Elsevier, vol. 314(1), pages 15-31.
    6. Vincent F. Yu & Yueh-Sheng Lin & Panca Jodiawan & Shih-Wei Lin & Yu-Chi Lai, 2023. "The Field Technician Scheduling Problem with Experience-Dependent Service Times," Mathematics, MDPI, vol. 11(21), pages 1-17, November.
    7. Zhen, Lu & Wang, Kai & Wang, Shuaian & Qu, Xiaobo, 2018. "Tug scheduling for hinterland barge transport: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 265(1), pages 119-132.
    8. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.
    9. Ehsan Pourjavad & Eman Almehdawe, 2022. "Optimization of the technician routing and scheduling problem for a telecommunication industry," Annals of Operations Research, Springer, vol. 315(1), pages 371-395, August.
    10. Voravee Punyakum & Kanchana Sethanan & Krisanarach Nitisiri & Rapeepan Pitakaso, 2022. "Hybrid Particle Swarm and Whale Optimization Algorithm for Multi-Visit and Multi-Period Dynamic Workforce Scheduling and Routing Problems," Mathematics, MDPI, vol. 10(19), pages 1-20, October.
    11. Chen, Xi & Li, Kaiwen & Lin, Sidian & Ding, Xiaosong, 2024. "Technician routing and scheduling with employees’ learning through implicit cross-training strategy," International Journal of Production Economics, Elsevier, vol. 271(C).
    12. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    13. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
    14. Si, Guojin & Xia, Tangbin & Zhu, Ying & Du, Shichang & Xi, Lifeng, 2019. "Triple-level opportunistic maintenance policy for leasehold service network of multi-location production lines," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    15. Ines Mathlouthi & Michel Gendreau & Jean-Yves Potvin, 2021. "Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem," SN Operations Research Forum, Springer, vol. 2(1), pages 1-35, March.
    16. Guastaroba, G. & Côté, J.-F. & Coelho, L.C., 2021. "The Multi-Period Workforce Scheduling and Routing Problem," Omega, Elsevier, vol. 102(C).
    17. Avraham, Edison & Raviv, Tal & Khmelnitsky, Eugene, 2017. "The decentralized field service routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 290-316.
    18. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
    19. Qie He & Stefan Irnich & Yongjia Song, 2019. "Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Transportation Science, INFORMS, vol. 53(5), pages 1409-1426, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.
    2. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.
    3. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
    4. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    5. Zhang, Zizhen & Qin, Hu & Wang, Kai & He, Huang & Liu, Tian, 2017. "Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 45-59.
    6. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
    7. Stefan Irnich & Daniel Villeneuve, 2006. "The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k (ge) 3," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 391-406, August.
    8. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
    9. Sanja Petrovic, 2019. "“You have to get wet to learn how to swim” applied to bridging the gap between research into personnel scheduling and its implementation in practice," Annals of Operations Research, Springer, vol. 275(1), pages 161-179, April.
    10. Christian Tilk & Ann-Kathrin Rothenbächer & Timo Gschwind & Stefan Irnich, 2016. "Asymmetry Helps: Dynamic Half-Way Points for Solving Shortest Path Problems with Resource Constraints Faster," Working Papers 1615, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Tilk, Christian & Rothenbächer, Ann-Kathrin & Gschwind, Timo & Irnich, Stefan, 2017. "Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster," European Journal of Operational Research, Elsevier, vol. 261(2), pages 530-539.
    12. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
    13. Asvin Goel & Stefan Irnich, 2017. "An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems," Transportation Science, INFORMS, vol. 51(2), pages 737-754, May.
    14. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    15. Ehsan Pourjavad & Eman Almehdawe, 2022. "Optimization of the technician routing and scheduling problem for a telecommunication industry," Annals of Operations Research, Springer, vol. 315(1), pages 371-395, August.
    16. Julie Poullet & Axel Parmentier, 2020. "Shift Planning Under Delay Uncertainty at Air France: A Vehicle-Scheduling Problem with Outsourcing," Transportation Science, INFORMS, vol. 54(4), pages 956-972, July.
    17. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    18. Jonathan F. Bard & George Kontoravdis & Gang Yu, 2002. "A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 36(2), pages 250-269, May.
    19. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    20. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:257:y:2017:i:1:p:55-68. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.