Skip to main content
SpringerLink
Log in

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

  • Original Research
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Barrera, D., Velasco, N., & Amaya, C.-A. (2012). A network-based approach to the multi-activity combined timetabling and crew scheduling problem: Workforce scheduling for public health policy implementation. Computers & Industrial Engineering, 63(4), 802–812.

    Article  Google Scholar 

  • Blakeley, F., Argüello, B., Cao, B., Hall, W., & Knolmajer, J. (2003). Optimizing periodic maintenance operations for schindler elevator corporation. Interfaces, 33(1), 67–79.

    Article  Google Scholar 

  • Bostel, N., Dejax, P., Guez, P., & Tricoire, F. (2008). Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In The vehicle routing problem: latest advances and new challenges, pp. 503–525. Springer.

  • Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1), 39–67.

    Article  Google Scholar 

  • Chen, X., Thomas, B. W., & Hewitt, M. (2016). The technician routing problem with experience-based service times. Omega, 61, 49–61.

    Article  Google Scholar 

  • Chen, X., Thomas, B. W., & Hewitt, M. (2017). Multi-period technician scheduling with experience-based service times and stochastic customers. Computers & Operations Research, 82, 1–14.

    Article  Google Scholar 

  • Cordeau, J.-F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4), 393–409.

    Article  Google Scholar 

  • Cortés, C. E., Gendreau, M., Rousseau, L. M., Souyris, S., & Weintraub, A. (2014). Branch-and-price and constraint programming for solving a real-life technician dispatching problem. European Journal of Operational Research, 238(1), 300–312.

    Article  Google Scholar 

  • Damm, R. B., Resende, M. G., & Ronconi, D. P. (2016). A biased random key genetic algorithm for the field technician scheduling problem. Computers & Operations Research, 75, 49–63.

    Article  Google Scholar 

  • Dohn, A., Kolind, E., & Clausen, J. (2009). The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers & Operations Research, 36(4), 1145–1157.

    Article  Google Scholar 

  • Eveborn, P., Flisberg, P., & Rönnqvist, M. (2006). Laps care-an operational system for staff planning of home care. European Journal of Operational Research, 171(3), 962–976.

    Article  Google Scholar 

  • Goel, A., & Meisel, F. (2013). Workforce routing and scheduling for electricity network maintenance with downtime minimization. European Journal of Operational Research, 231(1), 210–228.

    Article  Google Scholar 

  • Hashimoto, H., Boussier, S., Vasquez, M., & Wilbaut, C. (2011). A grasp-based approach for technicians and interventions scheduling for telecommunications. Annals of Operations Research, 183(1), 143–161.

    Article  Google Scholar 

  • Khalfay, A., Crispin, A., and Crockett, K. (2017). A review of technician and task scheduling problems, datasets and solution approaches. In 2017 Intelligent Systems Conference (IntelliSys), pp. 288–296. IEEE.

  • Kovacs, A. A., Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of scheduling, 15(5), 579–600.

    Article  Google Scholar 

  • Laporte, G., & Osman, I. H. (1995). Routing problems: A bibliography. Annals of operations research, 61(1), 227–262.

    Article  Google Scholar 

  • Lim, A., Rodrigues, B., & Song, L. (2004). Manpower allocation with time windows. Journal of the Operational Research Society, 55(11), 1178–1186.

    Article  Google Scholar 

  • López-Santana, E., Akhavan-Tabatabaei, R., Dieulle, L., Labadie, N., & Medaglia, A. L. (2016). On the combined maintenance and routing optimization problem. Reliability Engineering & System Safety, 145, 199–214.

    Article  Google Scholar 

  • Mehrabian, A. R., & Lucas, C. (2006). A novel numerical optimization algorithm inspired from weed colonization. Ecological informatics, 1(4), 355–366.

    Article  Google Scholar 

  • Mısır, M., Smet, P., & Vanden Berghe, G. (2015). An analysis of generalised heuristics for vehicle routing and personnel rostering problems. Journal of the Operational Research Society, 66(5), 858–870.

    Article  Google Scholar 

  • Mohammadi, M., Razmi, J., & Tavakkoli-Moghaddam, R. (2013). Multi-objective invasive weed optimization for stochastic green hub location routing problem with simultaneous pick-ups and deliveries. Economic Computation & Economic Cybernetics Studies & Research, 47(3).

  • Paraskevopoulos, D. C., Laporte, G., Repoussis, P. P., & Tarantilis, C. D. (2017). Resource constrained routing and scheduling: Review and research prospects. European Journal of Operational Research, 263(3), 737–754.

    Article  Google Scholar 

  • Pillac, V., Gueret, C., & Medaglia, A. L. (2013). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters, 7(7), 1525–1535.

    Article  Google Scholar 

  • Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219(3), 598–610.

    Article  Google Scholar 

  • Souyris, S., Cortés, C. E., Ordóñez, F., & Weintraub, A. (2013). A robust optimization approach to dispatching technicians under stochastic service times. Optimization Letters, 7(7), 1549–1568.

    Article  Google Scholar 

  • Tang, H., Miller-Hooks, E., & Tomastik, R. (2007). Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Research Part E: Logistics and Transportation Review, 43(5), 591–609.

    Article  Google Scholar 

  • Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7(5), 495–509.

    Article  Google Scholar 

  • Zamorano, E., & Stolletz, R. (2017). Branch-and-price approaches for the multiperiod technician routing and scheduling problem. European Journal of Operational Research, 257(1), 55–68.

    Article  Google Scholar 

  • Zhao, Y., Leng, L., Qian, Z., & Wang, W. (2016). A discrete hybrid invasive weed optimization algorithm for the capacitated vehicle routing problem. Procedia Computer Science, 91, 978–987.

    Article  Google Scholar 

  • Zhou, Y., Luo, Q., Chen, H., He, A., & Wu, J. (2015). A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing, 151, 1227–1236.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Business Administration, University of Regina, Regina, Canada

    Ehsan Pourjavad & Eman Almehdawe

Authors
  1. Ehsan Pourjavad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eman Almehdawe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eman Almehdawe.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pourjavad, E., Almehdawe, E. Optimization of the technician routing and scheduling problem for a telecommunication industry. Ann Oper Res 315, 371–395 (2022). https://doi.org/10.1007/s10479-022-04658-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-022-04658-8

Keywords

Search

Navigation