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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad Pedagógica y Tecnológica de Colombia
2019-01-01
|
| Series: | Revista Facultad de Ingeniería |
| Subjects: | |
| Online Access: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/8782 |
| _version_ | 1818364279555883008 |
|---|---|
| author | Jorge Oyola, Ph. D. |
| author_facet | Jorge Oyola, Ph. D. |
| author_sort | Jorge Oyola, Ph. D. |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T22:01:51Z |
| format | Article |
| id | doaj.art-5ff8f660361049e18c5b7a63ada903ed |
| institution | Directory Open Access Journal |
| issn | 0121-1129 2357-5328 |
| language | English |
| last_indexed | 2024-12-13T22:01:51Z |
| publishDate | 2019-01-01 |
| publisher | Universidad Pedagógica y Tecnológica de Colombia |
| record_format | Article |
| series | Revista Facultad de Ingeniería |
| spelling | doaj.art-5ff8f660361049e18c5b7a63ada903ed2022-12-21T23:29:59ZengUniversidad Pedagógica y Tecnológica de ColombiaRevista Facultad de Ingeniería0121-11292357-53282019-01-012850193310.19053/01211129.v28.n50.2019.87828782The capacitated vehicle routing problem with soft time windows and stochastic travel timesJorge Oyola, Ph. D.0Universidad de CórdobaA 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.https://revistas.uptc.edu.co/index.php/ingenieria/article/view/8782genetic algorithmsheuristic algorithmsmultiobjective programmingrandom processesvehicle routing |
| spellingShingle | Jorge Oyola, Ph. D. The capacitated vehicle routing problem with soft time windows and stochastic travel times Revista Facultad de Ingeniería genetic algorithms heuristic algorithms multiobjective programming random processes vehicle routing |
| title | The capacitated vehicle routing problem with soft time windows and stochastic travel times |
| title_full | The capacitated vehicle routing problem with soft time windows and stochastic travel times |
| title_fullStr | The capacitated vehicle routing problem with soft time windows and stochastic travel times |
| title_full_unstemmed | The capacitated vehicle routing problem with soft time windows and stochastic travel times |
| title_short | The capacitated vehicle routing problem with soft time windows and stochastic travel times |
| title_sort | capacitated vehicle routing problem with soft time windows and stochastic travel times |
| topic | genetic algorithms heuristic algorithms multiobjective programming random processes vehicle routing |
| url | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/8782 |
| work_keys_str_mv | AT jorgeoyolaphd thecapacitatedvehicleroutingproblemwithsofttimewindowsandstochastictraveltimes AT jorgeoyolaphd capacitatedvehicleroutingproblemwithsofttimewindowsandstochastictraveltimes |