DOI:
https://doi.org/10.14483/23448393.18482Published:
2022-01-04Issue:
Vol. 26 No. 3 (2021): September - DecemberSection:
Sección Especial: Mejores artículos extendidos - WEA 2021Proposal of a Dynamic Algorithm for the Maintenance and Vehicle Routing Problem with Time Windows
Propuesta de un algoritmo dinámico para el problema de mantenimiento y ruteo de vehículos con ventanas de tiempo
Keywords:
mantenimiento, algoritmo dinámico, ruteo de vehículos, eficiencia computacional (es).Keywords:
maintenance, dynamic algorithm, vehicle routing, computational efficiency (en).Downloads
References
O. Mack, A. Khare, A. Krämer, and T. Burgartz, Managing in a VUCA world, New York, NY, USA: Springer, 2015. https://doi.org/10.1007/978-3-319-16889-0 DOI: https://doi.org/10.1007/978-3-319-16889-0
E. López-Santana, R. Akhavan-Tabatabaei, L. Dieulle, N. Labadie, and A. L. Medaglia, “On the combined maintenance and routing optimization problem,” Reliab. Eng. Syst. Saf., vol. 145, pp. 199-214, Jan. 2016. https://doi.org/10.1016/j.ress.2015.09.016 DOI: https://doi.org/10.1016/j.ress.2015.09.016
J. A. Andrawus, J. Watson, and M. Kishk, “Wind Turbine Maintenance Optimisation: Principles of Quantitative Maintenance Optimisation,” Wind Eng., vol. 31, no. 2, pp. 101-110, Mar. 2007, https://doi.org/10.1260/030952407781494467 DOI: https://doi.org/10.1260/030952407781494467
N. M. de Souza and A. T. de Almeida Filho, “A systematic airport runway maintenance and inspection policy based on a delay time modeling approach,” Autom. Constr., vol. 110, 103039, Feb. 2020, https://doi.org/10.1016/j.autcon.2019.103039 DOI: https://doi.org/10.1016/j.autcon.2019.103039
R. Dekker, “Applications of maintenance optimization models: A review and analysis,” Reliab. Eng. Syst. Saf., vol. 51, no. 3, pp. 229-240, Mar. 1996. https://doi.org/10.1016/0951-8320(95)00076-3 DOI: https://doi.org/10.1016/0951-8320(95)00076-3
N. Zhang, M. Fouladirad, and A. Barros, “Maintenance of a two dependent component system: a case study,” IFAC-PapersOnLine, vol. 49, no. 12, pp. 793-798, Jan. 2016. https://doi.org/10.1016/j.ifacol.2016.07.871 DOI: https://doi.org/10.1016/j.ifacol.2016.07.871
R. Baldacci, A. Mingozzi, and R. Roberti, “New route relaxation and pricing strategies for the vehicle routing problem,” Oper. Res., vol. 59, no. 5, pp. 1269-1283, Oct. 2011. https://doi.org/10.1287/opre.1110.0975 DOI: https://doi.org/10.1287/opre.1110.0975
G. Desaulniers, “Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows,” Oper. Res., vol. 58, no. 1, pp. 179-192, Sep. 2010. https://doi.org/10.1287/opre.1090.0713 DOI: https://doi.org/10.1287/opre.1090.0713
R. Fukasawa et al., “Robust branch-and-cut-and-price for the capacitated vehicle routing problem,” Math. Program., vol 106, pp. 491-506, Oct. 2006. https://doi.org/10.1007/s10107-005-0644-x DOI: https://doi.org/10.1007/s10107-005-0644-x
B. Afshar-Nadjafi and A. Afshar-Nadjafi, “A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet,” J. King Saud Univ. - Eng. Sci., vol 29, no. 1, pp. 29-34, Jan. 2017. https://doi.org/10.1016/j.jksues.2014.04.007 DOI: https://doi.org/10.1016/j.jksues.2014.04.007
T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “Heuristics for multi-attribute vehicle routing problems: A survey and synthesis,” Eur. J. Oper. Res., vol. 23, no. 1, pp. 1-21., Nov. 2013. https://doi.org/10.1016/j.ejor.2013.02.053 DOI: https://doi.org/10.1016/j.ejor.2013.02.053
N. Azi, M. Gendreau, and J. Y. Potvin, “An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles,” Eur. J. Oper. Res., vol. 202, no. 3, 756-763, May 2010. https://doi.org/10.1016/j.ejor.2009.06.034 DOI: https://doi.org/10.1016/j.ejor.2009.06.034
J. E. Fontecha, O. O. Guaje, D. Duque, R. Akhavan-Tabatabaei, J. P. Rodríguez, and A. L. Medaglia, “Combined maintenance and routing optimization for large-scale sewage cleaning,” Ann. Oper. Res., vol. 286, no. 1-2, pp. 441-474, Aug. 2020. https://doi.org/10.1007/s10479-019-03342-8 DOI: https://doi.org/10.1007/s10479-019-03342-8
S. K. Goyal and A. Gunasekaran, “Determining economic maintenance frequency of a transport fleet,” Int. J. Syst. Sci., vol. 23, no. 4, pp. 655-659, Apr. 1992. https://doi.org/10.1080/00207729208949239 DOI: https://doi.org/10.1080/00207729208949239
J. Y. Huang and M. J. Yao, “On the coordination of maintenance scheduling for transportation fleets of many branches of a logistic service provider,” Comput. Math. with Appl., vol. 56, no. 5, pp. 1303 1313, Sept. 2008. https://doi.org/10.1016/j.camwa.2008.01.037 DOI: https://doi.org/10.1016/j.camwa.2008.01.037
F. Blakeley, B. Bozkaya, B. Cao, W. Hall, and J. Knolmajer, “Optimizing periodic maintenance operations for Schindler Elevator Corporation,” Interfaces (Providence)., vol. 33, no. 1, pp. 67-79, Feb. 2003. https://doi.org/10.1287/inte.33.1.67.12722 DOI: https://doi.org/10.1287/inte.33.1.67.12722
K. Bouvard, S. Artus, C. Bérenguer, and V. Cocquempot, “Condition-based dynamic maintenance operations planning & grouping. Application to commercial heavy vehicles,”rel. Eng. Sys. Saf., vol. 96, no. 6, pp. 601-610, Jun. 2011. https://doi.org/10.1016/j.ress.2010.11.009 DOI: https://doi.org/10.1016/j.ress.2010.11.009
C. A. Irawan, D. Ouelhadj, D. Jones, M. Stålhane, and I. B. Sperstad, “Optimisation of maintenance routing and scheduling for offshore wind farms,” Eur. J. Oper. Res., vol. 256, no. 1, pp. 76-89, Jan. 2017. https://doi.org/10.1016/j.ejor.2016.05.059 DOI: https://doi.org/10.1016/j.ejor.2016.05.059
A. Troudi, S. Dellagi, and S. A. Addouche, “An optimal maintenance policy for transport| vehicles in a supply chain under infrastructure/environment constraints,” in 45th Int. Conf. Comp. Ind. Eng., Metz, France, Oct. 28-30, 2015, 207.
J. E. Fontecha, R. Akhavan-Tabatabaei, D. Duque, A. L. Medaglia, M. N. Torres, and J. P. Rodríguez, “On the preventive management of sediment-related sewer blockages: A combined maintenance and routing optimization approach,” Water Sci. Technol., vol. 74, no. 2, pp. 302-308, mar. 2016. https://doi.org/10.2166/wst.2016.160 DOI: https://doi.org/10.2166/wst.2016.160
Y. Chen, P. Cowling, F. Polack, S. Remde, and P. Mourdjis, “Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system,” Eur. J. Oper. Res., vol. 257, no. 2, pp 494-510, Mar. 2017. https://doi.org/10.1016/j.ejor.2016.07.027 DOI: https://doi.org/10.1016/j.ejor.2016.07.027
E. Zamorano and R. Stolletz, “Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem,” Eur. J. Oper. Res., vol. 257, no. 1, pp. 55-68, Feb. 2017. https://doi.org/10.1016/j.ejor.2016.06.058 DOI: https://doi.org/10.1016/j.ejor.2016.06.058
M. M. Solomon, “Algorithms for the Vehicle Routing and Scheduling Problems With Time Window Constraints.,” Oper. Res., vol. 35, no. 2, pp. 254-265, Apr. 1987. https://doi.org/10.1287/opre.35.2.254 DOI: https://doi.org/10.1287/opre.35.2.254
B. Meindl and M. Templ, “Analysis of commercial and free and open source solvers for linear optimization problems,” ESSnet commom tools Harmon. Methodol. SDC ESS, vol. 1, no. 1, pp. 1-14, Feb. 2012. http://www.statistik.tuwien.ac.at/forschung/CS/CS-2012-1complete.pdf
J. Jablonský, “Benchmarks for Current Linear and Mixed Integer Optimization Solvers,” Acta Univ. Agric. Silvic. Mendelianae Brun., vol. 63, no. 6, pp. 1923-1928, Dec. 2016. https://doi.org/10.11118/201563061923 DOI: https://doi.org/10.11118/actaun201563061923
How to Cite
APA
ACM
ACS
ABNT
Chicago
Harvard
IEEE
MLA
Turabian
Vancouver
Download Citation
License
Copyright (c) 2022 Carlos Andrés López Ayala, Wilson Jurado Valbuena, Eduyn Ramiro Lopez Santana
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
From the edition of the V23N3 of year 2018 forward, the Creative Commons License "Attribution-Non-Commercial - No Derivative Works " is changed to the following:
Attribution - Non-Commercial - Share the same: this license allows others to distribute, remix, retouch, and create from your work in a non-commercial way, as long as they give you credit and license their new creations under the same conditions.
2.jpg)
