Robust Optimization for the Counterpart Open Capacitated Vehicle Routing Problem With Time Windows
- 10.2991/assehr.k.201230.162How to use a DOI?
- Waste Transportation, Soft Time Windows, Robust Optimization, Travel Time
This paper investigates the robust optimization for the counterpart open capacitated vehicle routing problem (denoted by RCOCVRP) with soft time windows on waste transport problems. The uncertainly of volume of waste and travel time are considered. Garbage collection vehicles in carrying out the process of collecting garbage sometimes there are delays such as congestion and engine damage. We investigates the robust counterpart open capacitated vehicle routing problem with soft time windows models, where the waste transport vehicle does not need to return to the location of origin, the volume of waste carried by the vehicle does not exceed the vehicle capacity and consider the time windows. The robust counterpart open capacitated vehicle routing problemwith soft time windows models solved by cheapest insertion heuristic algorithm. The results of the completion of the RCOCVRP model with soft time windows were completed with the GAMS software. Finally, the results of the calculation of the RCOVRP model with soft time windows using the cheapest insertion heuristics algorithm are also compared with the GAMS software.
- © 2021, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Evi Yuliza AU - Fitri Maya Puspita AU - Siti Suzlin Supadi PY - 2021 DA - 2021/01/02 TI - Robust Optimization for the Counterpart Open Capacitated Vehicle Routing Problem With Time Windows BT - Proceedings of the 4th Sriwijaya University Learning and Education International Conference (SULE-IC 2020) PB - Atlantis Press SP - 556 EP - 560 SN - 2352-5398 UR - https://doi.org/10.2991/assehr.k.201230.162 DO - 10.2991/assehr.k.201230.162 ID - Yuliza2021 ER -