Lin, Z and Kwan, R (2017) Multicommodity Flow Problems with Commodity Compatibility Relations. In: ITM Web of Conferences, Volume 14, 2017 The 12th International Conference Applied Mathematical Programming and Modelling – APMOD 2016. The 12th International Conference Applied Mathematical Programming and Modelling – APMOD 2016, 08-10 Jun 2016, Brno, Czech Republic. EDP Sciences
Abstract
We present a class of Multicommodity Flow Problems with Commodity Compatibility Relations (MCFP-CCR), in which compatibility relations among commodities used at each node are required. This class of problems has application in the Train Unit Scheduling Problem (TUSP) [1, 2], where train units of different traction types may not be coupled with each other to serve the same train trip. Computational complexity issues are discussed and solution methods are proposed. Computational experiments using the proposed solution methods are reported.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © The Authors, published by EDP Sciences, 2017. This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (http://creativecommons.org/licenses/by/4.0/). |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/M007243/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 17 Nov 2017 10:40 |
Last Modified: | 11 Jan 2023 13:05 |
Status: | Published |
Publisher: | EDP Sciences |
Identification Number: | 10.1051/itmconf/20171400003 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:124230 |