Chapter 3 1-Full-Truckload Pickup-and-Delivery Traveling Salesman Problem
In this chapter, we consider a generalization of the traveling salesman prob- lem, namely the one-commodity full-truckload pickup-and-delivery traveling salesman problem as presented in Gendreau et al. (2012). Routes have to be constructed to satisfy customer requests which either involve the pickup or delivery of a single commodity. A vehicle is to be routed such that the supply and the demand of the customers is satisﬁed under the objective to minimize the total distance traveled. The commodities which are collected from the pickup customers can be used to accommodate the demand of the delivery customers. A real-life application arises in the pre- and end-haulage of in- termodal freight transportation. We model this problem as an integer linear and an integer nonlinear programming problem that simultaneously solves a routing and an assignment problem. Exact solution approaches based on the classical and the generalized Benders decomposition are presented to op- timally solve the linear and the nonlinear model, respectively. Finally, we assess the quality of our solution approaches on several computational ex- periments. 50 Chapter 3. 1-FTPDTSP 3.1 Problem Description The problem studied is a generalization of the traveling salesman problem in which the set of customers is divided into pickup and delivery customers and where the former supplies and the latter demands one unit of a single commodity. A vehicle is to be routed such that the supply and the demand of the customers is satisﬁed while minimizing the total distance traveled. We refer to this routing problem as...
You are not authenticated to view the full text of this chapter or article.
This site requires a subscription or purchase to access the full text of books or journals.
Do you have any questions? Contact us.Or login to access all content.