A Study on Vehicle Routing Problem by Simulated Annealing
碩士 === 元智大學 === 工業工程研究所 === 86 === The transportation rate and cost of the goods for distribution center(DC) is far more than that of a manufacturing factory. The planning of the vehicle routing of the DCs is tradionally treated as a vehicle routing problem(VRP). VRP...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/05786226658324585559 |
| Summary: | 碩士 === 元智大學 === 工業工程研究所 === 86 === The transportation rate and cost of the goods for distribution
center(DC) is far more than that of a manufacturing factory.
The planning of the vehicle routing of the DCs is tradionally
treated as a vehicle routing problem(VRP). VRP is defined as a
set of vehicles of limited capacity at a DC serve all customers
exactly one and then return to the DC with minimized total
routing cost. This study considered that all vehicles have a
full time window and nearest and saving methods were employed
to get the initial solutions. Then the procedure utilized the
simulated annealing(SA) method to search for better solutions
by jumping off the trap to improve the initial solution.
Finally, an experimental design for the design parameters was
conducted for statistics analysis. The results show that the
factors of initial temperature, stopping rule and cooling rate
are significant for the solution quality.
|
|---|