The Application of the Ant Memory System on the Vehicle Routing Problems
碩士 === 逢甲大學 === 交通工程與管理所 === 98 === Transportation cost is a key component of Logistics cost, hence reducing daily operating costs such as VRP (Vehicle Routing Problems) have been of major concerns. VRP is a problem focusing on reducing total distance that commercial vehicles travel to serve custome...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/85059338282676640005 |
id |
ndltd-TW-098FCU05118011 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098FCU051180112016-04-20T04:18:19Z http://ndltd.ncl.edu.tw/handle/85059338282676640005 The Application of the Ant Memory System on the Vehicle Routing Problems 螞蟻記憶系統應用於車輛途程問題 Jing-Tang Lai 賴敬棠 碩士 逢甲大學 交通工程與管理所 98 Transportation cost is a key component of Logistics cost, hence reducing daily operating costs such as VRP (Vehicle Routing Problems) have been of major concerns. VRP is a problem focusing on reducing total distance that commercial vehicles travel to serve customers. It is a NP-Hard problem and solving a VRP is very time consuming so exact solutions won’t be generated in a timely fashion. In order to overcome this efficiency issue, different heuristic algorithms have been applied in VRP and different results have been achieved. Ant System (AS) is one meta-heuristic algorithm that was based on the behavior of ants. AS performs well in solving various NP-Hard problems and several modified versions have been developed, including Ant Memory System (AMS). AMS was developed by author and very good results have been obtained when it is applied in TSP (Travelling Salesman Problems). The design of memory boxes in AMS is able to avoid accepting local optimum that was found in the solving process. This study plans to find out the effectiveness of the AMS in solving VRP. AMS was modified for VRP and some local search mechanisms such as 2-opt were adopted to develop a new approach. International benchmark problems were used to test the efficiency of the modified algorithm. Meanwhile a tool has been developed to observe the iteration in the solving process visually and that would give us significant insights on improving AMS. Commonly used the benchmark problems were tested in this study and the result is compared with the results from other revised algorithms. The comparisons show that AMS provides better approximation solution than the other algorithms. In the random problem C1 ~ C10 average error of 0.98%, in the cluster problem C11 ~ C14 average error of 0.55%. Da-Jie Lin 林大傑 2010 學位論文 ; thesis 77 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 逢甲大學 === 交通工程與管理所 === 98 === Transportation cost is a key component of Logistics cost, hence reducing daily operating costs such as VRP (Vehicle Routing Problems) have been of major concerns. VRP is a problem focusing on reducing total distance that commercial vehicles travel to serve customers. It is a NP-Hard problem and solving a VRP is very time consuming so exact solutions won’t be generated in a timely fashion. In order to overcome this efficiency issue, different heuristic algorithms have been applied in VRP and different results have been achieved.
Ant System (AS) is one meta-heuristic algorithm that was based on the behavior of ants. AS performs well in solving various NP-Hard problems and several modified versions have been developed, including Ant Memory System (AMS). AMS was developed by author and very good results have been obtained when it is applied in TSP (Travelling Salesman Problems). The design of memory boxes in AMS is able to avoid accepting local optimum that was found in the solving process. This study plans to find out the effectiveness of the AMS in solving VRP. AMS was modified for VRP and some local search mechanisms such as 2-opt were adopted to develop a new approach. International benchmark problems were used to test the efficiency of the modified algorithm.
Meanwhile a tool has been developed to observe the iteration in the solving process visually and that would give us significant insights on improving AMS. Commonly used the benchmark problems were tested in this study and the result is compared with the results from other revised algorithms. The comparisons show that AMS provides better approximation solution than the other algorithms. In the random problem C1 ~ C10 average error of 0.98%, in the cluster problem C11 ~ C14 average error of 0.55%.
|
author2 |
Da-Jie Lin |
author_facet |
Da-Jie Lin Jing-Tang Lai 賴敬棠 |
author |
Jing-Tang Lai 賴敬棠 |
spellingShingle |
Jing-Tang Lai 賴敬棠 The Application of the Ant Memory System on the Vehicle Routing Problems |
author_sort |
Jing-Tang Lai |
title |
The Application of the Ant Memory System on the Vehicle Routing Problems |
title_short |
The Application of the Ant Memory System on the Vehicle Routing Problems |
title_full |
The Application of the Ant Memory System on the Vehicle Routing Problems |
title_fullStr |
The Application of the Ant Memory System on the Vehicle Routing Problems |
title_full_unstemmed |
The Application of the Ant Memory System on the Vehicle Routing Problems |
title_sort |
application of the ant memory system on the vehicle routing problems |
publishDate |
2010 |
url |
http://ndltd.ncl.edu.tw/handle/85059338282676640005 |
work_keys_str_mv |
AT jingtanglai theapplicationoftheantmemorysystemonthevehicleroutingproblems AT làijìngtáng theapplicationoftheantmemorysystemonthevehicleroutingproblems AT jingtanglai mǎyǐjìyìxìtǒngyīngyòngyúchēliàngtúchéngwèntí AT làijìngtáng mǎyǐjìyìxìtǒngyīngyòngyúchēliàngtúchéngwèntí AT jingtanglai applicationoftheantmemorysystemonthevehicleroutingproblems AT làijìngtáng applicationoftheantmemorysystemonthevehicleroutingproblems |
_version_ |
1718228748021530624 |