Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
© 2015 P. Kabcome and T. Mouktonglang. This paper presents a mathematical model to solve the vehicle routing problem with soft time windows (VRPSTW) and distribution of products with multiple categories. In addition, we include multiple compartments and trips. Each compartment is dedicated to a sing...
Saved in:
Main Authors: | P. Kabcome, T. Mouktonglang |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84939204024&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44633 |
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) -
A Comparison of Robust Criteria for Vehicle Routing Problem with Soft Time Windows
by: Thanasak Mouktonglang, et al.
Published: (2020) -
Multi-Trip Time-Dependent Vehicle Routing Problem with Time Windows
by: PAN BINBIN, et al.
Published: (2020) -
A multi-trip, multi-depot vehicle routing problem with vehicle time windows constraints.
by: Naranjo, Michael Don R., et al.
Published: (2000) -
PENYELESAIAN MULTIPLE-TRIPS VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (MTVRPTW) DENGAN MENGGUNAKAN FIREFLY ALGORITHM (FA)
by: QUINTAN SURI ISTIQOMAH, 081411231044
Published: (2018)