The capacitated vehicle routing problem with soft time windows and stochastic travel times

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...

תיאור מלא

מידע ביבליוגרפי

מחבר ראשי:	Oyola, Jorge
פורמט:	Online
שפה:	eng
יצא לאור:	Universidad Pedagógica y Tecnológica de Colombia 2019
נושאים:	genetic algorithms heuristic algorithms multiobjective programming random processes vehicle routing algoritmos genéticos algoritmos heurísticos optimización multiobjetivo proceso aleatorio ruteo de vehículos
גישה מקוונת:	https://revistas.uptc.edu.co/index.php/ingenieria/article/view/8782