Workload balancing at intermodal container terminals and sea ports
Publication date
2015
Document type
Konferenzbeitrag
Author
Organisational unit
Universität Siegen
Conference
11th Metaheuristics International Conference (MIC 2015) ; Agadir, Morocco ; June 7–10, 2015
Book title
Proceedings of the 11th Metaheuristics International Conference (MIC 2015)
First page
30.1
Last page
30.9
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Abstract
In this paper we analyze the performance of several heuristic and metaheuristic approaches for solving the Partitioning Min-Max Weighted Matching (PMMWM) Problem. Applications of PMMWM arise in the field of balancing workload at intermodal container terminals. The problem combines the problem of partitioning a set of vertices of a bipartite graph into disjoint subsets of restricted size and the strongly NP-hard Min-Max Weighted Matching (MMWM) Problem. Both problems have recently been introduced in the literature.
Cite as
Paper 30
Version
Published version
Access right on openHSU
Metadata only access