SciELO - Scientific Electronic Library Online

 
vol.12 issue23Influence of Si Atoms Insertion on the Formation of the Ti-Si-N Composite by DFT SimulationA Mathematical Programming Model for High School Timetabling Problem author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Ingeniería y Ciencia

Print version ISSN 1794-9165

Abstract

MACIAS, B. J.  and  AMAYA, C. A.. Hybrid Algorithm Enhanced with Artificial Intelligence Applied to the Bi-Objective Open Capacitated Arc Routing Problem. ing.cienc. [online]. 2016, vol.12, n.23, pp.25-43. ISSN 1794-9165.  https://doi.org/10.17230/ingciencia.12.23.2.

Abstract The arc routing problem with a variable starting/ending position (Open Capacitated Arc Routing Problem - OCARP), in its classic version, pursues the best strategy to serve a set of customers located in the network arcs using vehicles. Compared to the Capacitated Arc Routing Problem (CARP), the OCARP lacks of constrains that guarantee that each vehicle ought to start and end the tour at a given vertex (also known as a depot). The aim of this paper is to propose a heuristic to find an efficient frontier for the main objective functions: minimize the number of vehicles and the total cost. Additionally, a hybrid algorithm that complements the genetic algorithm with artificial intelligence operator is proposed.

Keywords : genetic algorithm; multi-objective optimization; CARP; OCARP; MO-OCARP; neural networks; local search.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License