pickup and delivery problem; case study; integer programming; skip transportation
We deal with a logistic problem motivated by a case study from a company dealing with inland transportation of piece goods in regular cycles. The problem consists in transportation of goods among regional centres – hubs of a network. Demands on transportation are contained in a matrix of flows of goods between pairs of hubs. The transport is performed by vehicles covering the shipping demands and the task is to design a cyclical route and to place a depot for each vehicle. The route depot can be placed in any hub of the route. Goods can be transferred from one route and vehicle to another route and vehicle. The aim is to minimize the total transportation cost. The task is classified as a new case of the pickup and delivery problem with split demand and transfers (SDPDPT). We propose a mathematical model and prove NP-hardness of the problem. We study demand reducibility. We also deal with skip pickup and delivery problem as a special case and show its complexity.
 Archetti, C., Mansini, R., Speranza, M. G.: Complexity and reducibility of the skip delivery problem
. Transport. Sci. 39 (2005), 182-187. DOI 10.1287/trsc.1030.0084
 Fábry, J.: Optimization of routes in pickup and delivery problem. In: Mathematical Methods in Economics, University of South Bohemia České Budějovice 2010, pp. 128-131.
 Savelsbergh, M. W. P., Sol, M.: The general pickup and delivery problem
. Transport. Res. 29 (1995), 17-29. Zbl 0826.90049
 Thangiah, S. R., Fergany, A., Salman, A.: Real-time split-delivery and delivery time window problems with transfers
. Central Europ. J. Oper. Res. 15 (2007), 4, 329-349. DOI 10.1007/s10100-007-0035-x
| MR 2363903