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