Beam Search Based Algorithms for Solving Traveling Salesman Problem with Pickup and Delivery
碩士 === 元智大學 === 工業工程與管理學系 === 98 === The traveling salesman problem with pickup and delivery (TSPPD) consists of a single depot and a set of customers who ask for one-to-one pickup and delivery requests. Each pickup node must be visited before its associated delivery node. The TSPPD aims to seek a r...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/97984836225632521459 |