Compare different number of node and vehicle capacity by using Savings Algorithm and Sweep Algorithm
碩士 === 國立臺北科技大學 === 商業自動化與管理研究所 === 96 === Vehicle Routing Problem (VRP) has been a focus topic for many researches. VRP plays an important role in the vehicle dispatching. In practice, how to minimize the time and cost so as to enhance the service quality is an important part vehicle dispatching. V...
Main Authors: | Chi-Hung Lin, 林繼弘 |
---|---|
Other Authors: | 林逾先 |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/pxkgy4 |
Similar Items
-
Interior Node Projection Techniques in Sweeping Algorithms
by: Scott, Michael Andrew
Published: (2005) -
An Extensible Definition of the Rotational Sweep Algorithm
by: 王愷宏
Published: (2014) -
Some applications of the topological plane sweep algorithm
by: Leblanc, Alain, 1964-
Published: (1989) -
Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing
by: Peihuang Huang, et al.
Published: (2018-01-01) -
Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem
by: Arit Thammano, et al.
Published: (2021-09-01)