Scheduling movements in the network of an express service provider

I. Louwerse, J. Mijnarends, W.J.M. Meuffels, D. Huisman, H.A. Fleuren

Research output: Contribution to journalArticleScientificpeer-review

Abstract

Express service providers manage shipments from senders to receivers under strict service level agreements. Such shipments are usually not sufficient to justify a single transportation, so it is preferred to maximize consolidation of these shipments to reduce cost. The consolidation is organized via depots and hubs: depots are local sorting centers that take care of the collection and delivery of the parcels at the customers, and hubs are used to consolidate the transportation between the depots. A single transportation between two locations, carried out by a certain vehicle at a specific time, is defined as a movement. In this paper, we address the problem of scheduling all movements in an express network at minimum cost. Our approach allows to impose restrictions on the number of arriving/departing movements at the hubs so that sufficient handling capacity is ensured. As the movement scheduling problem is complex, it is divided into two parts: one part concerns the movements between depots and hubs; the other part considers the movements between the hubs. We use a column generation approach and a local search algorithm to solve these two subproblems, respectively. Computational experiments show that by using this approach the total transportation costs are decreased.
Original languageEnglish
Pages (from-to)565-584
JournalFlexible Services and Manufacturing Journal
Volume26
Issue number4
Early online date9 Feb 2013
DOIs
Publication statusPublished - Dec 2014

Fingerprint

Scheduling
Consolidation
Costs
Sorting
Service provider
Hub
Experiments

Keywords

  • express service provider
  • movement scheduling
  • integer programming
  • column generation
  • local search

Cite this

Louwerse, I. ; Mijnarends, J. ; Meuffels, W.J.M. ; Huisman, D. ; Fleuren, H.A. / Scheduling movements in the network of an express service provider. In: Flexible Services and Manufacturing Journal. 2014 ; Vol. 26, No. 4. pp. 565-584.
@article{7f7ec0da0a6e499e90db740ffb560778,
title = "Scheduling movements in the network of an express service provider",
abstract = "Express service providers manage shipments from senders to receivers under strict service level agreements. Such shipments are usually not sufficient to justify a single transportation, so it is preferred to maximize consolidation of these shipments to reduce cost. The consolidation is organized via depots and hubs: depots are local sorting centers that take care of the collection and delivery of the parcels at the customers, and hubs are used to consolidate the transportation between the depots. A single transportation between two locations, carried out by a certain vehicle at a specific time, is defined as a movement. In this paper, we address the problem of scheduling all movements in an express network at minimum cost. Our approach allows to impose restrictions on the number of arriving/departing movements at the hubs so that sufficient handling capacity is ensured. As the movement scheduling problem is complex, it is divided into two parts: one part concerns the movements between depots and hubs; the other part considers the movements between the hubs. We use a column generation approach and a local search algorithm to solve these two subproblems, respectively. Computational experiments show that by using this approach the total transportation costs are decreased.",
keywords = "express service provider, movement scheduling, integer programming, column generation, local search",
author = "I. Louwerse and J. Mijnarends and W.J.M. Meuffels and D. Huisman and H.A. Fleuren",
year = "2014",
month = "12",
doi = "10.1007{\%}2fs10696-013-9171-x#",
language = "English",
volume = "26",
pages = "565--584",
journal = "Flexible Services and Manufacturing Journal",
issn = "1936-6582",
publisher = "Springer New York",
number = "4",

}

Scheduling movements in the network of an express service provider. / Louwerse, I.; Mijnarends, J.; Meuffels, W.J.M.; Huisman, D.; Fleuren, H.A.

In: Flexible Services and Manufacturing Journal, Vol. 26, No. 4, 12.2014, p. 565-584.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Scheduling movements in the network of an express service provider

AU - Louwerse, I.

AU - Mijnarends, J.

AU - Meuffels, W.J.M.

AU - Huisman, D.

AU - Fleuren, H.A.

PY - 2014/12

Y1 - 2014/12

N2 - Express service providers manage shipments from senders to receivers under strict service level agreements. Such shipments are usually not sufficient to justify a single transportation, so it is preferred to maximize consolidation of these shipments to reduce cost. The consolidation is organized via depots and hubs: depots are local sorting centers that take care of the collection and delivery of the parcels at the customers, and hubs are used to consolidate the transportation between the depots. A single transportation between two locations, carried out by a certain vehicle at a specific time, is defined as a movement. In this paper, we address the problem of scheduling all movements in an express network at minimum cost. Our approach allows to impose restrictions on the number of arriving/departing movements at the hubs so that sufficient handling capacity is ensured. As the movement scheduling problem is complex, it is divided into two parts: one part concerns the movements between depots and hubs; the other part considers the movements between the hubs. We use a column generation approach and a local search algorithm to solve these two subproblems, respectively. Computational experiments show that by using this approach the total transportation costs are decreased.

AB - Express service providers manage shipments from senders to receivers under strict service level agreements. Such shipments are usually not sufficient to justify a single transportation, so it is preferred to maximize consolidation of these shipments to reduce cost. The consolidation is organized via depots and hubs: depots are local sorting centers that take care of the collection and delivery of the parcels at the customers, and hubs are used to consolidate the transportation between the depots. A single transportation between two locations, carried out by a certain vehicle at a specific time, is defined as a movement. In this paper, we address the problem of scheduling all movements in an express network at minimum cost. Our approach allows to impose restrictions on the number of arriving/departing movements at the hubs so that sufficient handling capacity is ensured. As the movement scheduling problem is complex, it is divided into two parts: one part concerns the movements between depots and hubs; the other part considers the movements between the hubs. We use a column generation approach and a local search algorithm to solve these two subproblems, respectively. Computational experiments show that by using this approach the total transportation costs are decreased.

KW - express service provider

KW - movement scheduling

KW - integer programming

KW - column generation

KW - local search

U2 - 10.1007%2fs10696-013-9171-x#

DO - 10.1007%2fs10696-013-9171-x#

M3 - Article

VL - 26

SP - 565

EP - 584

JO - Flexible Services and Manufacturing Journal

JF - Flexible Services and Manufacturing Journal

SN - 1936-6582

IS - 4

ER -