Simulated annealing (SA) to vehicle routing problems with soft time windows
The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW). For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific peri...
Main Authors: | Suphan Sodsoon, Sarayut Kornvirat, Nakhon Sodsoon |
---|---|
Format: | Article |
Language: | English |
Published: |
Khon Kaen University
2014-12-01
|
Series: | KKU Engineering Journal |
Subjects: | |
Online Access: | https://www.tci-thaijo.org/index.php/kkuenj/article/download/28298/24327 |
Similar Items
-
Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits
by: Suphan Sodsoon, et al.
Published: (2014-06-01) -
Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows
by: Libing Wu, et al.
Published: (2019-01-01) -
An Enhanced Approach for the Multiple Vehicle Routing Problem with Heterogeneous Vehicles and a Soft Time Window
by: He-Yau Kang, et al.
Published: (2018-11-01) -
A period vehicle routing problem with time windows and backhauls
by: Chang, Chia-Sheng
Published: (1993) -
An Adaptive Variable Neighborhood Search Ant Colony Algorithm for Vehicle Routing Problem With Soft Time Windows
by: Meiling He, et al.
Published: (2021-01-01)