English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Most public facilities in the European countries, including France, Germany,and the UK, were built during the reconstruction projects between 1950 and1980. Owing to the deteriorating state of such vital infrastructure has becomerelatively expensive in the recent decades. A significant part of themaintenance operation costs is spent on the technical staff. Therefore, theoptimal use of the available workforce is essential to optimize the operationcosts. This includes planning technical interventions, workload balancing,productivity improvement, etc. In this paper, we focus on the routing oftechnicians and scheduling of their tasks. We address for this purpose avariant of the workforce scheduling problem called the technician routing andscheduling problem (TRSP). This problem has applications in different fields,such as transportation infrastructure (rail and road networks),telecommunications, and sewage facilities. To solve the TRSP, we propose anenhanced iterated local search (eILS) approach. The enhancement of the ILSfirstly includes an intensification procedure that incorporates a set of localsearch operators and removal-repair heuristics crafted for the TRSP. Next, fourdifferent mechanisms are used in the perturbation phase. Finally, an elite setof solutions is used to extensively explore the neighborhood of local optima aswell as to enhance diversification during search space exploration. To measurethe performance of the proposed method, experiments were conducted based onbenchmark instances from the literature, and the results obtained were comparedwith those of an existing method. Our method achieved very good results, sinceit reached the best overall gap, which is three times lower than that of theliterature. Furthermore, eILS improved the best-known solution for $34$instances among a total of $56$ while maintaining reasonable computationaltimes.

Enhanced Iterated local search for the technician routing and scheduling problem