RETRACTED: An Efficient Metaheuristic Approach for the Multi-Period Technician Routing and Scheduling Problem
Abstract
This article has been retracted at the request of the Editor-in-Chief and of co authors W. R. Cherif-Khettaf and M. Mostefai, as the article is largely based on work presented previously at an international conference by the same authors.
The conference paper is:
A. Khattara, W. R. Cherif-Khettaf and M. Mostefai, "Variable neighborhood search procedures for the multi-period technician routing and scheduling problem", 4th International Conference on Control, Decision and Information Technologies (CoDIT), Spain, April 5-7, 2017
and the corresponding author of this submission was unaware of the publication of this conference's proceedings at the time of submission and review/publication of this paper.
Keywords:
technician routing and scheduling problem (TRSP), variable neighborhood search (VNS), variable neighborhood descent (VND)Downloads
References
V. Pillac, C. Gueret, A. L. Medaglia, “A parallel matheuristic for the technician routing and scheduling problem”, Optimization Letters, Vol. 7, No. 7, pp. 1525-1535, 2013 DOI: https://doi.org/10.1007/s11590-012-0567-4
J. Xu, S. Y. Chiu, “Effective heuristic procedures for a field technician scheduling problem”, Journal of Heuristics, Vol. 7, No. 5, pp. 495-509, 2001 DOI: https://doi.org/10.1023/A:1011377929184
E. Hadjiconstantinou, D. Roberts, “Routing under uncertainty: an application in the scheduling of field service engineers”, in: The vehicle Routing Problem, pp. 331-352, Society for Industrial and Applied Mathematics, 2001 DOI: https://doi.org/10.1137/1.9780898718515.ch13
E. Delage, Re-optimization of Technician Tours in Dynamic Environments with Stochastic Service Time, Ecole des Mines de Nantes, 2010
C. E. Cortes, F. Ordonez, S. Souyris, A. Weintraub, “Routing technicians under stochastic service times: a robust optimization approach”, TRISTAN VI: The Sixth Triennial Symposium on Transportation Analysis, Phuket Island, Thailand, June 10-15, 2007
V. Pillac, C. Gueret, A. Medaglia, “On the dynamic technician routing and scheduling problem”, 5th International Workshop on Freight Transportation and Logistics, Mykonos, Greece, May 21-25, 2012
X. Chen, B. W. Thomas, M. Hewitt, “Multi-Period Technician Scheduling with Experience-based Service Times and Stochastic Customers”, Computers and Operations Research, Vol. 82, No. C, pp. 1-14, 2017 DOI: https://doi.org/10.1016/j.cor.2016.12.026
W. Jaskowski, ROADEF Challenge 2007: Technicians and Interventions Scheduling for Telecommunications, Poznan University of Technology, 2007
F. Tricoire, Optimisation de Tournees de Vehicules et de Personnels de Maintenance: Application a la Distribution et au Traitement des Eaux, PhD Thesis, Universite de Nantes, 2006 (in French)
A. A. Kovacs, S. N. Parragh, K. F. Doerner, R. F. Hartl, “Adaptive large neighborhood search for service technician routing and scheduling problems”, Journal of Scheduling, Vol. 15, No. 5, pp. 579-600, 2012 DOI: https://doi.org/10.1007/s10951-011-0246-9
N. Bostel, P. Dejax, P. Guez, F. Tricoire, “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, 2008 DOI: https://doi.org/10.1007/978-0-387-77778-8_23
F. Tricoire, N. Bostel, P. Dejax, P. Guez, “Exact and hybrid methods for the multiperiod field service routing problem”, Central European Journal of Operations Research, Vol. 21, No. 2, pp. 359-377, 2013 DOI: https://doi.org/10.1007/s10100-011-0231-6
O. Braysy, “A reactive variable neighborhood search for the vehicle routing problem with time windows”, INFORMS Journal of Computing, Vol. 15, No. 4, pp. 347–368, 2003 DOI: https://doi.org/10.1287/ijoc.15.4.347.24896
M. Polacek, R. F. Hartl, K. Doerner, M. Reimann, “A variable neighborhood search for the multi depot vehicle routing problem with time windows”, Journal of Heuristics, Vol. 10, No. 6, pp. 613-627, 2004 DOI: https://doi.org/10.1007/s10732-005-5432-5
S. Salhi, A. Imran, N. A. Wassan, “The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation”, Computers & Operations Research, Vol. 52B, pp. 315-325, 2014 DOI: https://doi.org/10.1016/j.cor.2013.05.011
M. Elbek, S. Wohlk, “A variable neighborhood search for the multi-period collection of recyclable materials”, European Journal of Operational Research, Vol. 249, No. 2, pp. 540-550, 2016 DOI: https://doi.org/10.1016/j.ejor.2015.08.035
R. L. Pinheiro, D. Landa-Silva, J. Atkin, “A variable neighbourhood search for the workforce scheduling and routing problem”, in: Advances in Nature and Biologically Inspired Computing, pp. 247-259, Springer, 2016 DOI: https://doi.org/10.1007/978-3-319-27400-3_22
N. Mladenovic, P. Hansen, “Variable neighborhood search”, Computers & Operations Research, Vol. 24, No. 11, pp. 1097-1100, 1997 DOI: https://doi.org/10.1016/S0305-0548(97)00031-2
P. Hansen, N. Mladenovic, “Variable neighborhood search: Principles and applications”, European Journal of Operational Research, Vol. 130, No. 3, pp. 449-467, 2001 DOI: https://doi.org/10.1016/S0377-2217(00)00100-4
P. Hansen, N. Mladenovic, J. A. M. Perez, “Variable neighbourhood search: methods and applications”, Annals of Operations Research, Vol. 175, No. 1, pp. 367-407, 2010 DOI: https://doi.org/10.1007/s10479-009-0657-6
P. Hansen, N. Mladenovic, R. Todosijevic, S. Hanafi, “Variable neighborhood search: basics and variants”, EURO Journal on Computational Optimization, Vol. 5, No. 3, pp. 1-32, 2016 DOI: https://doi.org/10.1007/s13675-016-0075-x
A. Mjirda, R. Todosijevic, S. Hanafi, P. Hansen, N. Mladenovic, “Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem”, International Transactions in Operational Research, Vol. 24, No. 3, pp. 615-633, 2016 DOI: https://doi.org/10.1111/itor.12282
Downloads
How to Cite
License
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
