Applying Improved Ant Colony Optimization to Vehicle Routing Problem with Time Windows: A Dynamic Method to Construct Vehicle Routes
碩士 === 大同大學 === 資訊經營學系(所) === 103 === This paper studies applies ant colony optimization (ACO) to the vehicle routing problem with time windows (VRPTW).The effects of time window constraints are studied. The order of customer service is dynamically decided by considering current time points and time...
Main Authors: | Yu-Wei Chang, 張育偉 |
---|---|
Other Authors: | Ming-hsien Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/86078590249255218709 |
Similar Items
-
A Study of Ant Colony Optimization on Vehicle Routing Problem with Time Window
by: Hsiu-Mei Kao, et al.
Published: (2003) -
Improved Ant Colony Optimization Algorithm for vehicle routing problem with time windows
by: Chih-Kang Lin, et al.
Published: (2013) -
AN APPLICATION OF ANT COLONY ALGORITHMS TO VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS
by: RAFAEL LORENZO SANTOS
Published: (2006) -
[en] AN APPLICATION OF ANT COLONY ALGORITHMS TO VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS
by: RAFAEL LORENZO SANTOS
Published: (2007) -
Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows
by: Libing Wu, et al.
Published: (2019-01-01)