Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency

Journals

  • IJIEC (747)
  • MSL (2643)
  • DSL (668)
  • CCL (508)
  • USCM (1092)
  • ESM (413)
  • AC (562)
  • JPM (271)
  • IJDS (912)
  • JFS (91)
  • HE (32)
  • SCI (26)

IJIEC Volumes

    • Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)
    • Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • Volume 3 (76)
      • Issue 1 (9)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • Volume 17 (21)
      • Issue 1 (21)

Keywords

Supply chain management(166)
Jordan(161)
Vietnam(149)
Customer satisfaction(120)
Performance(113)
Supply chain(110)
Service quality(98)
Competitive advantage(95)
Tehran Stock Exchange(94)
SMEs(87)
optimization(86)
Financial performance(83)
Trust(83)
TOPSIS(83)
Sustainability(81)
Job satisfaction(80)
Factor analysis(78)
Social media(78)
Knowledge Management(77)
Artificial intelligence(77)


» Show all keywords

Authors

Naser Azad(82)
Mohammad Reza Iravani(64)
Zeplin Jiwa Husada Tarigan(63)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(39)
Jumadil Saputra(36)
Dmaithan Almajali(36)
Muhammad Turki Alshurideh(35)
Barween Al Kurdi(32)
Ahmad Makui(32)
Basrowi Basrowi(31)
Hassan Ghodrati(31)
Mohammad Khodaei Valahzaghard(30)
Sautma Ronni Basana(29)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)
Haitham M. Alzoubi(27)


» Show all authors

Countries

Iran(2183)
Indonesia(1290)
India(787)
Jordan(786)
Vietnam(504)
Saudi Arabia(453)
Malaysia(441)
United Arab Emirates(220)
China(206)
Thailand(153)
United States(111)
Turkey(106)
Ukraine(104)
Egypt(98)
Canada(92)
Peru(88)
Pakistan(85)
United Kingdom(80)
Morocco(79)
Nigeria(78)


» Show all countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 13 Issue 2 pp. 277-292 , 2022

Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency Pages 277-292 Right click to download the paper Download PDF

Authors: Sergio Esteban Vega-Figueroa, Paula Andrea López-Becerra, Eduyn R. López-Santana

DOI: 10.5267/j.ijiec.2021.10.001

Keywords: PVRP, Clustering, Metaheuristics, Routing, Scheduling

Abstract: This document addresses the problem of scheduling and routing a specific number of vehicles to visit a set of customers in specific time windows during a planning horizon. The vehicles have a homogeneous limited capacity and have their starting point and return in a warehouse or initial node, in addition, multiple variants of the classic VRP vehicle routing problem are considered, where computational complexity increases with the increase in the number of customers to visit, as a characteris-tic of an NP-hard problem. The solution method used consists of two connected phases, the first phase makes the allocation through a mixed-integer linear programming model, from which the visit program and its frequency in a determined plan-ning horizon are obtained. In the second phase, the customers are grouped through an unsupervised learning algorithm, the routing is carried out through an Ant Colony Optimization metaheuristic that includes local heu-ristics to make sure com-pliance with the restrictive factors. Finally, we test our algorithm by performance measures using instances of the literature and a comparative model, and we prove the effectiveness of the proposed algorithm.

How to cite this paper
Vega-Figueroa, S., López-Becerra, P & López-Santana, E. (2022). Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency.International Journal of Industrial Engineering Computations , 13(2), 277-292.

Refrences
Avellaneda, J., Estevéz, R., & Aguilar, K. (2019). Un algoritmo colonia de hormigas para el problema de ruteo de vehículos eléctricos con función de carga parcial y ventanas de tiempo. Trabajo de Grado, 53(9), 1689–1699. https://doi.org/10.1017/CBO9781107415324.004
Baker, B.M. and Ayechew, M. A. (2003). A Genetic Algorithm for the Vehicle Routing Problem. Computer and Operation Research, 30, 787–800.
Barreto Riaño, H. (2019). Un algoritmo metaheurístico para solucionar el problema de ruteo de vehículos con restricciones de ventanas de tiempo y flota heterogénea en la empresa Carnes Los Sauces S.A.
Batsyn, M. V., Batsyna, E. K., Bychkov, I. S., & Pardalos, P. M. (2019). Vehicle assignment in site-dependent vehicle routing problems with split deliveries. Operational Research, 0123456789. https://doi.org/10.1007/s12351-019-00471-7
Bell, J.E. and McMullen, P. R. (2004). Ant Colony Optimization Techniques for the Vehicle Routing Problem. Advanced Engineering Informatics, 18(1), 41–48.
Ben-Said, A., El-Hajj, R., & Moukrim, A. (2016). An adaptive heuristic for the Capacitated Team Orienteering Problem. IFAC-PapersOnLine, 49(12), 1662–1666. https://doi.org/10.1016/j.ifacol.2016.07.819
Cacchiani, V., Hemmelmayr, V. C., & Tricoire, F. (2014). A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics (Amsterdam, Netherlands : 1988), 163(Pt 1), 53–64. https://doi.org/10.1016/j.dam.2012.08.032
Castillo, J. J. A., Giraldo, A. D. H., & Cabrera, J. P. O. (2018). Método de dos fases para el problema de ruteo de mensajeros en motocicleta con ventanas de tiempo. Entramado, 14(1), 268–281. https://doi.org/10.18041/entramado.2018v14n1.27106
Cattaruzza, D., Absi, N., & Feillet, D. (2016). Vehicle routing problems with multiple trips. 4or, 14(3), 223–259. https://doi.org/10.1007/s10288-016-0306-2
Cheng, C. Bin, & Mao, C. P. (2007). A modified ant colony system for solving the travelling salesman problem with time windows. Mathematical and Computer Modelling, 46(9–10), 1225–1235. https://doi.org/10.1016/j.mcm.2006.11.035
Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle routing dispatching problem. Operations Research Quaterly, 20(3), 309–318.
Chu, F., Labadi, N., & Prins, C. (2005). Heuristics for the periodic capacitated arc routing problem. Journal of Intelligent Manufacturing, 16(2), 243–251. https://doi.org/10.1007/s10845-004-5892-8
Cordeau, Jean‐François Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi‐depot vehicle routing problems. Networks An Internacional Journal, 30(2), 105–119.
Cordeau, J. F., & Maischberger, M. (2012). A parallel iterated tabu search heuristic for vehicle routing problems. Computers and Operations Research, 39(9), 2033–2050. https://doi.org/10.1016/j.cor.2011.09.021
Créput, J. C., Hajjam, A., Koukam, A., & Kuhn, O. (2012). Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem. Journal of Combinatorial Optimization, 24(4), 437–458. https://doi.org/10.1007/s10878-011-9400-8
Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–91.
Froger, A., Mendoza, J. E., Jabali, O., & Laporte, G. (2019). Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions. Computers and Operations Research, 104, 256–294. https://doi.org/10.1016/j.cor.2018.12.013
Gulczynski, D., Golden, B., & Wasil, E. (2011). The period vehicle routing problem: New heuristics and real-world variants. Transportation Research Part E: Logistics and Transportation Review, 47(5), 648–668. https://doi.org/10.1016/j.tre.2011.02.002
Laporte, G., & Nobert, Y. (1987). Exact algorithms for the vehicle routing problem. Annals of Discrete Mathematics, 31, 147–184.
Melian, B., & Moreno-vega, J. M. (2003). Metaheuristicas : Una visión global. January.
Méndez, A., Pontin, M., Ziletti, M., & Chávez, L. (2005). Heurísticas Para La Resolución De Un Problema De Ruteo De Vehículos Periódico Real. Mecánica Computacional, 24(November).
Mourgaya, M., & Vanderbeck, F. (2007). Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research, 183(3), 1028–1041. https://doi.org/10.1016/j.ejor.2006.02.030
Muñuzuri, J., Domíngueza, I., Berrocal, M. A., & Escudero, A. (2016). An allocation-scheduling heuristic to manage train traffic in an intermodal terminal. Computers in Industry, 82, 196–204. https://doi.org/10.1016/j.compind.2016.07.006
Olivera, A. (2004). Heurísticas para problemas de ruteo de vehículos. Instituto de Computacion - Facultad de Ingenieria., 63.
Orrego Cardozo, J. P., Ospina Toro, D., & Toro Ocampo, E. M. (2016). Solución al Problema de Ruteo de Vehículos con Capacidad Limitada (CVRP) usando una técnica metaheurística. Scientia et Technica, 21(3), 225. https://doi.org/10.22517/23447214.9013
Osman, I. H. (1993). Meta-strategy simulated annealing and Tabu search algorithms for the vehicle routine problem. Annals of Operations Research, 41(4), 421–451. https://doi.org/10.1007/BF02023004
Patiño Chirva, J. A., Daza Cruz, Y. X., & López-Santana, E. R. (2016). A Hybrid Mixed-Integer Optimization and Clustering Approach to Selective Collection Services Problem of Domestic Solid Waste. Ingeniería, 21(2), 235–247. https://doi.org/http://dx.doi.org/10.14483/udistrital.jour.reving.2016.2.a09
Pullen, H. and Webb, M. (1967). A computer application to a transport scheduling problem. The Computer Journal, 10(1), 10–13.
Puras, A. M., & Bonrostro, J. A. P. (2016). Modelo real de planificación y rutas Bi-objetivo. Equilibrio entre costes y preferencias de clientes. Recta, 17(1), 57–80.
Reyes Morales, N. (2016). Modelo de optimización de programación de rutas para una empresa logística peruana usando herramientas FSMVRPTW. Industrial Data, 19(2), 118. https://doi.org/10.15381/idata.v19i2.12847
Rocha Medina, L. B., González La Rota, E. C., & Orjuela Castro, J. A. (2011). Una revisión al estado del arte del proble- ma de ruteo de vehículos : Evolución histó- rica y métodos de solución State of the art review of the vehicle routing problem : A historic account with solving methods Resumen. Ingeniería. Universidad Francisco José de Caldas, 16(2), 35–55.
Rodríguez-Vásquez, W. C., López-Santana, E. R., & Méndez-Giraldo, G. A. (2016). Proposal for a Hybrid Expert System and an Optimization Model for the Routing Problem in the Courier Services. In J. C. Figueroa-García, E. R. López-Santana, & R. Ferro-Escobar (Eds.), Applied Computer Sciences in Engineering WEA 2016 (Vol. 657, pp. 141–152). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-50880-1_13
Rodriguez, S., Correa, D., & López-Santana, E. (2015). An Alternative Iterative Method to Periodic Vehicle Routing Problem. In S. Cetinkaya and J. K. Ryan (Ed.), IIE Annual Conference and Expo 2015 (pp. 2001–2010).
Russell, R. A. (1977). An Effective Heuristic for the M -Tour Traveling Salesman Problem with Some Side Conditions. Operational Research, 25(3), 517–524.
Russell, R. A., & Gribbin, D. (1991). A multiphase approach to the period routing problem. Networks An Internacional Journal, 21(7), 747–765.
Schneider, K., & Nurre, S. G. (2019). A multi-criteria vehicle routing approach to improve the compliance audit schedule for food banks. Omega (United Kingdom), 84, 127–140. https://doi.org/10.1016/j.omega.2018.05.002
Solomon, M. M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, 35(2), 254–265. https://doi.org/10.1287/opre.35.2.254
Torres Prato, R., Fernando, D., & Pérez, S. (2015). Ruteo de Vehículos desde un Centro de Distribución a una Línea de Supermercados en Barranquilla , Colombia Vehicle Routing from a Distribution Center to a Supermarket Line in Barranquilla , Colombia. Ingeniare, 10(18), 11–21.
Toth, P., & Vigo, D. (2002). The vehicle routing problem. In Optimization (Vol. 9). SIAM. https://doi.org/10.1137/1.9780898718515
Yousefikhoshbakht, M., & Khorram, E. (2012). Solving the vehicle routing problem by a hybrid meta-heuristic algorithm. Journal of Industrial Engineering International, 8(1), 1–9. https://doi.org/10.1186/2251-712X-8-11
Zhao, M., & Lu, Y. (2019). A heuristic approach for a real-world electric vehicle routing problem. Algorithms, 12(2), 1–19. https://doi.org/10.3390/a12020045

  • 85
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2022 | Volume: 13 | Issue: 2 | Views: 1574 | Reviews: 0

Related Articles:
  • Dynamic inventory routing problem: Policies considering network disruptions
  • A metaheuristic algorithm for the multi-depot vehicle routing problem with ...
  • A hybrid expert system, clustering and ant colony optimization approach for ...
  • Variable neighborhood search algorithm for the green vehicle routing proble ...
  • A heuristic algorithm based on tabu search for vehicle routing problems wit ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com