| Article ID: | iaor20082020 |
| Country: | China |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 134 |
| End Page Number: | 138 |
| Publication Date: | Jan 2006 |
| Journal: | Journal of Tongji University |
| Authors: | Huo Jiazhen, Zhang Lei |
| Keywords: | heuristics |
An assumption is usually introduced into traveling salesman problem with pickup and delivery (TSPD) that all the delivery demands must be satisfied before pickup. Based on the analysis and decomposition of the model, a modified Clarke–Wright, a kind of saving/inserting algorithm without taking the above assumption into consideration is adopted to solve the problem. Also a case example is conducted in this paper.