A Comparison of Robust Criteria for Vehicle Routing Problem with Soft Time Windows
© 2019 Thanasak Mouktonglang and Phannipa Worapun. 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. T...
Saved in:
Main Authors: | Thanasak Mouktonglang, Phannipa Worapun |
---|---|
Format: | Journal |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85075185017&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67922 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
by: P. Kabcome, et al.
Published: (2018) -
Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
by: P. Kabcome, et al.
Published: (2018) -
Multi-Trip Time-Dependent Vehicle Routing Problem with Time Windows
by: PAN BINBIN, et al.
Published: (2020) -
An interior-point trust-region algorithm for quadratic stochastic symmetric programming
by: Phannipa Kabcome, et al.
Published: (2018) -
Comparison of meta-heuristic algorithms for vehicle routing problem with time windows
by: Teerapun Saeheaw, et al.
Published: (2018)