Pickup and delivery problem with split demand and transfers

Title:

Pickup and delivery problem with split demand and transfers

Creator:

Pelikán, Jan

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:eab27a6a-dace-4ce0-a9b6-5c4a3339c393
uuid:eab27a6a-dace-4ce0-a9b6-5c4a3339c393

Subject:

pickup and delivery problem, case study, integer programming, and skip transportation

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

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.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

[755]-764

Source:

Kybernetika | 2013 Volume:49 | Number:5

Harvested from:

CDK

Metadata only:

false