A Comparison of Robust Criteria for Vehicle Routing Problem with Soft Time Windows
In this study, we focus on robust criteria for vehicle routing problems with soft time windows (VRPSTW). The main objective is to find a robust solution that provides the best for the worst case performance for VRPSTW under uncertain travel times. The robust criteria are used in this study such as a...
Saved in:
| Main Authors: | Thanasak Mouktonglang, Phannipa Worapun |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2019/9137458 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows
by: P. Kabcome, et al.
Published: (2015-01-01) -
Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows
by: Ailing Chen, et al.
Published: (2024-12-01) -
A multiobjective evolutionary algorithm incorporating neighborhood detection for the vehicle routing problem with soft time windows
by: Hao Jiang, et al.
Published: (2025-08-01) -
Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows
by: Rafael Grosso, et al.
Published: (2018-01-01) -
Robust Optimization for Electric Vehicle Routing Problem Considering Time Windows Under Energy Consumption Uncertainty
by: Dan Wang, et al.
Published: (2025-01-01)