Load-dependent and precedence-based models for pickup and delivery problems
Computers & Operations Research, Volume 63, Issue C, 2015.
We address the one-to-one multi-commodity pickup and delivery traveling salesman problem (m-PDTSP) which is a generalization of the TSP and arises in several transportation and logistics applications. The objective is to find a minimum-cost directed Hamiltonian path which starts and ends at given depot nodes and such that the demand of ea...More
Full Text (Upload PDF)
PPT (Upload PPT)