Adaptive Max-Min Ant System for the Dynamic Selective Pickup and Delivery Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 105 === The selective pickup and delivery problem (SPDP) aims for the shortest route that satisfies the load constraint to supply the commodities demanded by all delivery nodes with some selected pickup nodes. This problem is relevant to many real-world problems, e.g.,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/c94428 |