| Issue |
ITM Web Conf.
Volume 14, 2017
The 12th International Conference Applied Mathematical Programming and Modelling – APMOD 2016
|
|
|---|---|---|
| Article Number | 00003 | |
| Number of page(s) | 8 | |
| DOI | https://doi.org/10.1051/itmconf/20171400003 | |
| Published online | 08 November 2017 | |
Multicommodity Flow Problems with Commodity Compatibility Relations
School of Computing, University of Leeds, Leeds, United Kingdom, LS2 9PT
* e-mail: Z.Lin@leeds.ac.uk
** e-mail: R.S.Kwan@leeds.ac.uk
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.
© 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/).
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.