SciELO - Scientific Electronic Library Online

 
vol.28 issue50Finite elements analysis of the deformation applied to the 6061-T6 aluminum alloy by equal channel angular pressingNeural network study for the subject demand forecasting 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


Revista Facultad de Ingeniería

Print version ISSN 0121-1129

Abstract

OYOLA, Jorge. The capacitated vehicle routing problem with soft time windows and stochastic travel times. Rev. Fac. ing. [online]. 2019, vol.28, n.50, pp.19-33. ISSN 0121-1129.  https://doi.org/10.19053/01211129.v28.n50.2019.8782.

A full multiobjective approach is employed in this paper to deal with a stochastic multiobjective capacitated vehicle routing problem (CVRP). In this version of the problem, the demand is considered to be deterministic, but the travel times are assumed to be stochastic. A soft time window is tied to every customer and there is a penalty for starting the service outside the time window. Two objectives are minimized, the total length and the time window penalty. The suggested solution method includes a non-dominated sorting genetic algorithm (NSGA) together with a variable neighborhood search (VNS) heuristic. It was tested on instances from the literature and compared to a previous solution approach. The suggested method is able to find solutions that dominate some of the previously best known stochastic multiobjective CVRP solutions.

Keywords : genetic algorithms; heuristic algorithms; multiobjective programming; random processes; vehicle routing.

        · abstract in Spanish | Portuguese     · text in English     · English ( pdf )