EconPapers    
Economics at your fingertips  
 

Tactical planning for dynamic technician routing and scheduling problems

Clara Chini Nielsen and David Pisinger

Transportation Research Part E: Logistics and Transportation Review, 2023, vol. 177, issue C

Abstract: We consider the tactical planning aspect of a dynamic technician routing and scheduling problem with a time horizon of several days. In this problem study, some tasks are known beforehand, while others arrive dynamically. The tactical planning is to schedule the known tasks, such that we minimize the overall driving distance while ensuring short service times for the dynamic tasks. Without tactical planning, the known tasks would be spread throughout the whole area as they are scheduled based on a first-come-first-serve principle. In this study, we partition the area into disjoint slices covering the full plane and then assign the slices to individual work days. The partitioning of the area will be constructed with a balanced sweep algorithm using two approaches: The first is based on a parallel sweep-line following a given angle, while the second is based on a rotating sweep-line around a given origin. To guide the partitioning, we aim to minimize the degree of dynamism, which in our case is defined by the number of dynamic tasks, the distance from known tasks to dynamic tasks, and the tightness of the time windows. The tactical planning is evaluated using real-life and synthetic clustered data, where some of the tasks are known beforehand, and some are dynamic. We benchmark the various partitioning approaches against the default strategy of serving all known tasks on a first-come-first-serve basis. Computational results are reported showing around a 10% reduction in driving distance when using tactical planning. Furthermore, we show that up to 70% of the technicians can have a non-dynamic work day, without a significant increase in driving distance.

Keywords: Technician Routing; Dynamic routing and scheduling; Tactical planning; Adaptive large neighbourhood search; Two-stage stochastic optimization; Degree of Dynamism (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554523002132
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:177:y:2023:i:c:s1366554523002132

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2023.103225

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:transe:v:177:y:2023:i:c:s1366554523002132