Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem

Valerio Maria Sereno; Line Blander Reinhardt; Stefan Guericke

doi:10.1007/978-3-030-00898-7_24

Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem

Valerio Maria Sereno , Line Blander Reinhardt, Stefan Guericke

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

In this paper the liner shipping crew scheduling problem is described and modelled. Three different models have been formulated and tested for the scheduling problem. A mixed integer formulation and a set covering formulation are constructed and solved using exact methods. A mat-heuristic based on column generation has been implemented and tested. Moreover, a simple heuristic is implemented as a benchmark value. The models and methods were tested on smaller instances of the problem. The results show that good results can be achieved within 5 min using the heuristic and around an hour using the set partitioning formulation.

Original language	English
Title of host publication	Computational Logistics : 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings
Editors	Raffaele Cerulli , Andrea Raiconi , Stefan Voss
Volume	11184
Publisher	Springer
Publication date	2018
Pages	363-378
ISBN (Print)	978-3-030-00897-0
ISBN (Electronic)	978-3-030-00898-7
DOIs	https://doi.org/10.1007/978-3-030-00898-7_24
Publication status	Published - 2018
Event	9th International Conference on Computational Logistics - Vietri sul Mare, Sorrento, Italy Duration: 1 Oct 2018 → 3 Oct 2018 Conference number: 9 http://www.iccl2018.it

Conference

Conference	9th International Conference on Computational Logistics
Number	9
Location	Vietri sul Mare
Country/Territory	Italy
City	Sorrento
Period	01/10/2018 → 03/10/2018
Internet address	http://www.iccl2018.it

Series	Lecture Notes in Computer Science
ISSN	0302-9743

Access to Document

10.1007/978-3-030-00898-7_24

OpenUrl availability

Full text

Cite this

Sereno , V. M., Reinhardt, L. B., & Guericke, S. (2018). Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem. In R. C., A. R., & S. V. (Eds.), Computational Logistics: 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings (Vol. 11184, pp. 363-378). Springer. https://doi.org/10.1007/978-3-030-00898-7_24

Sereno , Valerio Maria ; Reinhardt, Line Blander ; Guericke, Stefan. / Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem. Computational Logistics: 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings. editor / Raffaele Cerulli ; Andrea Raiconi ; Stefan Voss. Vol. 11184 Springer, 2018. pp. 363-378 (Lecture Notes in Computer Science).

@inproceedings{812d9aeb74134cd5a5e9f89aae0f2cbd,

title = "Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem",

abstract = "In this paper the liner shipping crew scheduling problem is described and modelled. Three different models have been formulated and tested for the scheduling problem. A mixed integer formulation and a set covering formulation are constructed and solved using exact methods. A mat-heuristic based on column generation has been implemented and tested. Moreover, a simple heuristic is implemented as a benchmark value. The models and methods were tested on smaller instances of the problem. The results show that good results can be achieved within 5 min using the heuristic and around an hour using the set partitioning formulation.",

author = "Sereno, {Valerio Maria} and Reinhardt, {Line Blander} and Stefan Guericke",

year = "2018",

doi = "10.1007/978-3-030-00898-7_24",

language = "English",

isbn = "978-3-030-00897-0",

volume = "11184",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "363--378",

editor = "{Raffaele Cerulli} and {Andrea Raiconi} and {Stefan Voss}",

booktitle = "Computational Logistics",

note = "9th International Conference on Computational Logistics, ICCL'18 ; Conference date: 01-10-2018 Through 03-10-2018",

url = "http://www.iccl2018.it",

}

Sereno , VM, Reinhardt, LB & Guericke, S 2018, Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem. in RC, AR & SV (eds), Computational Logistics: 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings. vol. 11184, Springer, Lecture Notes in Computer Science, pp. 363-378, 9th International Conference on Computational Logistics, Sorrento, Italy, 01/10/2018. https://doi.org/10.1007/978-3-030-00898-7_24

Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem. / Sereno , Valerio Maria; Reinhardt, Line Blander; Guericke, Stefan.
Computational Logistics: 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings. ed. / Raffaele Cerulli; Andrea Raiconi; Stefan Voss. Vol. 11184 Springer, 2018. p. 363-378 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem

AU - Sereno , Valerio Maria

AU - Reinhardt, Line Blander

AU - Guericke, Stefan

N1 - Conference code: 9

PY - 2018

Y1 - 2018

N2 - In this paper the liner shipping crew scheduling problem is described and modelled. Three different models have been formulated and tested for the scheduling problem. A mixed integer formulation and a set covering formulation are constructed and solved using exact methods. A mat-heuristic based on column generation has been implemented and tested. Moreover, a simple heuristic is implemented as a benchmark value. The models and methods were tested on smaller instances of the problem. The results show that good results can be achieved within 5 min using the heuristic and around an hour using the set partitioning formulation.

AB - In this paper the liner shipping crew scheduling problem is described and modelled. Three different models have been formulated and tested for the scheduling problem. A mixed integer formulation and a set covering formulation are constructed and solved using exact methods. A mat-heuristic based on column generation has been implemented and tested. Moreover, a simple heuristic is implemented as a benchmark value. The models and methods were tested on smaller instances of the problem. The results show that good results can be achieved within 5 min using the heuristic and around an hour using the set partitioning formulation.

U2 - 10.1007/978-3-030-00898-7_24

DO - 10.1007/978-3-030-00898-7_24

M3 - Article in proceedings

SN - 978-3-030-00897-0

VL - 11184

T3 - Lecture Notes in Computer Science

SP - 363

EP - 378

BT - Computational Logistics

A2 - , Raffaele Cerulli

A2 - , Andrea Raiconi

A2 - , Stefan Voss

PB - Springer

T2 - 9th International Conference on Computational Logistics

Y2 - 1 October 2018 through 3 October 2018

ER -

Sereno VM, Reinhardt LB, Guericke S. Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem. In RC, AR, SV, editors, Computational Logistics: 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings. Vol. 11184. Springer. 2018. p. 363-378. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-00898-7_24

Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this