Article ID: | iaor2009325 |
Country: | Germany |
Volume: | 12 |
Issue: | 4 |
Start Page Number: | 405 |
End Page Number: | 417 |
Publication Date: | Dec 2004 |
Journal: | Central European Journal of Operations Research |
Authors: | Lbbecke Marco E. |
Keywords: | programming: travelling salesman, networks: path |
Pickup and delivery problems discussed in the literature are often constrained to particularly simple solutions in terms of the sequence of visited locations. We study the very simplest pickup and delivery paths which are concatenations of short patterns visiting one or two requests. This restricted variant, still