IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v315y2022i1d10.1007_s10479-022-04658-8.html
   My bibliography  Save this article

Optimization of the technician routing and scheduling problem for a telecommunication industry

Author

Listed:
  • Ehsan Pourjavad

    (University of Regina)

  • Eman Almehdawe

    (University of Regina)

Abstract

This paper proposes two models for the Technician Routing and Scheduling Problem (TRSP), which are motivated by a telecom provider based in Saskatchewan, Canada. The proposed TRSP models are distinguished from existing models by their ability to address two key issues: overnight and lunch break scheduling. The models aim to scheduling a set of technicians with homogeneous skill levels and different working hours for the purpose of providing services with different service times and time windows to a diverse set of widely spread communities. As the large-sized experiments of this problem categorized into NP-hard problems, a metaheuristic-based technique, Invasive Weed Optimization, is developed to solve them. A comparative analysis is performed to choose the optimum TRSP model based on two factors which are distance of communities to the main depot and balanced service times during planning horizon. The performance of the models is evaluated through the real-world data obtained from the telecom provider. The results prove that the overnight TRSP model is capable of substantially decreasing travel costs and the number of technicians that are required to perform the same set of services.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:annopr:v:315:y:2022:i:1:d:10.1007_s10479-022-04658-8
    DOI: 10.1007/s10479-022-04658-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04658-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-022-04658-8?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. 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.
    2. Rasmussen, Matias Sevel & Justesen, Tor & Dohn, Anders & Larsen, Jesper, 2012. "The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies," European Journal of Operational Research, Elsevier, vol. 219(3), pages 598-610.
    3. 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.
    4. 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.
    5. Cortés, Cristián E. & Gendreau, Michel & Rousseau, Louis Martin & Souyris, Sebastián & Weintraub, Andrés, 2014. "Branch-and-price and constraint programming for solving a real-life technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 300-312.
    6. Mustafa Misir & Pieter Smet & Greet Vanden Berghe, 2015. "An analysis of generalised heuristics for vehicle routing and personnel rostering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(5), pages 858-870, May.
    7. Hideki Hashimoto & Sylvain Boussier & Michel Vasquez & Christophe Wilbaut, 2011. "A GRASP-based approach for technicians and interventions scheduling for telecommunications," Annals of Operations Research, Springer, vol. 183(1), pages 143-161, March.
    8. 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.
    9. 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.
    10. Chen, Xi & Thomas, Barrett W. & Hewitt, Mike, 2016. "The technician routing problem with experience-based service times," Omega, Elsevier, vol. 61(C), pages 49-61.
    11. Goel, Asvin & Meisel, Frank, 2013. "Workforce routing and scheduling for electricity network maintenance with downtime minimization," European Journal of Operational Research, Elsevier, vol. 231(1), pages 210-228.
    12. 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.
    13. 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. 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.
    2. Nielsen, Clara Chini & Pisinger, David, 2023. "Tactical planning for dynamic technician routing and scheduling problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).

    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. 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.
    2. 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.
    3. 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.
    4. Guastaroba, G. & Côté, J.-F. & Coelho, L.C., 2021. "The Multi-Period Workforce Scheduling and Routing Problem," Omega, Elsevier, vol. 102(C).
    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. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    7. 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.
    8. 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.
    9. 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).
    10. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    11. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.
    12. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Parragh, Sophie N., 2024. "Synchronisation in vehicle routing: Classification schema, modelling framework and literature review," European Journal of Operational Research, Elsevier, vol. 313(3), pages 817-840.
    13. 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.
    14. Yadav, Niteesh & Tanksale, Ajinkya, 2022. "An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1100-1125.
    15. Isabel Méndez-Fernández & Silvia Lorenzo-Freire & Ignacio García-Jurado & Julián Costa & Luisa Carpente, 2020. "A heuristic approach to the task planning problem in a home care business," Health Care Management Science, Springer, vol. 23(4), pages 556-570, December.
    16. Cavada, Juan P. & Cortés, Cristián E. & Goic, Marcel & Weintraub, Andrés & Zambrano, Juan I., 2020. "Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 287(3), pages 820-831.
    17. 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.
    18. 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.
    19. López-Santana, Eduyn & Akhavan-Tabatabaei, Raha & Dieulle, Laurence & Labadie, Nacima & Medaglia, Andrés L., 2016. "On the combined maintenance and routing optimization problem," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 199-214.
    20. Gomes, Maria Isabel & Ramos, Tânia Rodrigues Pereira, 2019. "Modelling and (re-)planning periodic home social care services with loyalty and non-loyalty features," European Journal of Operational Research, Elsevier, vol. 277(1), pages 284-299.

    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:spr:annopr:v:315:y:2022:i:1:d:10.1007_s10479-022-04658-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.