We introduce a new generalization of the traveling salesman problem with pickup and delivery, that stems from applications in maritime logistics, in which each node represents a port and has a known draft limit. Each customer has a demand, characterized by a weight, and pickups and deliveries are performed by a single ship of given weight capacity. The ship is able to visit a port only if the amount of cargo it carries is compatible with the draft limit of the port. We present an integer linear programming formulation and we show how classical valid inequalities from the literature can be adapted to the considered problem. We introduce heuristic procedures and a branch-and-cut exact algorithm. We examine, through extensive computational experiments, the impact of the various cuts and the performance of the proposed algorithms.
The traveling salesman problem with pickups, deliveries, and draft limits
2018-01-01
Article (Journal)
Electronic Resource
English
DDC: | 000 |
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs
Online Contents | 2010
|British Library Online Contents | 2010
|The Vehicle Routing Problem with Divisible Deliveries and Pickups
Online Contents | 2013
|The Vehicle Routing Problem with Divisible Deliveries and Pickups
British Library Online Contents | 2015
|