Design of Heuristic Operators for the Selective Pickup and Delivery Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 104 === The pickup and delivery problem (PDP) is an important class of routing problem that seeks to satisfy all delivery nodes with all pickup nodes through a shortest route. The selective pickup and delivery problem (SPDP) breaks the constraint to visit all pickup nod...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/jxem9e |