The Library Vehicle Routing Problem with Deliveries and Pickups: Application of Meta-Heuristics
碩士 === 國立中央大學 === 土木工程研究所 === 98 === The library vehicle routing problem with delivery and pickup (LVRP-PD) is a problem of finding optimal routes to transport origin-destination paired books in a library system comprising a main library and several library branches. The LVRP-PD is an extension of t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/56368861556481371872 |
| Summary: | 碩士 === 國立中央大學 === 土木工程研究所 === 98 === The library vehicle routing problem with delivery and pickup (LVRP-PD) is a problem of finding optimal routes to transport origin-destination paired books in a library system comprising a main library and several library branches. The LVRP-PD is an extension of the traditional vehicle routing problem but is more difficult to solve because books are associated with fixed origin-destination pairs. To solve the LVRP-PD, two meta-heuristics called hybrid genetic algorithm (HGA) and hybrid bee colony optimization algorithm (HBCOA) are proposed. Two real library systems, one in San Francisco and the other in Taipei, are then demonstrated with the two meta-heuristics. The library vehicle routes scheduled by HGA and HBCOA are superior to the existing manual operations and those appeared in the literature in terms of some performance indices. The experiments also show that HGA is a bit better than HBCOA but the superiority is not significant. Hence both proposed solution algorithms have equally good potential for real applications in the future.
|
|---|