An integrated matching and partitioning problem with applications in intermodal transport
Publication date
2016-01-11
Document type
Konferenzbeitrag
Author
Organisational unit
Universität Siegen
Scopus ID
Conference
IEEE Symposium Series on Computational Intelligence 2015 (IEEE SSCI 2015) ; Cape Town, South Africa ; December 7–10, 2015
Publisher
IEEE
Book title
2015 IEEE Symposium Series on Computational Intelligence
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Abstract
We introduce a combination of the problem of partitioning a set of vertices of a bipartite graph into disjoint subsets of restricted size and the Min-Max Weighted Matching Problem. The resulting problem has applications in intermodal transport. We propose a mathematical model and prove the problem to be NP-hard in the strong sense. Two heuristic frameworks that decompose the problem into its partitioning and matching components are presented. Additionally, we analyze a basic implementation of tabu search and a genetic algorithm for the integrated problem. All algorithms outperform standard optimization software. Moreover, the decomposition heuristics outperform the classical metaheuristic approaches for the integrated problem. All algorithms outperform standardoptimization software. Moreover, the decomposition heuristics outperform the classical metaheuristic approaches.
Version
Published version
Access right on openHSU
Metadata only access