Scipediacontent: Scipediacontent moved page Draft Content 651883992 to Hansen et al 2019a

2021-02-16T11:34:32Z

Scipediacontent moved page Draft Content 651883992 to Hansen et al 2019a

Scipediacontent: Created page with " == Abstract == Train unit routing problem determines the number of train units needed to carry out involved trips, which is a significant part of railway operation cost...."

2021-02-16T11:34:29Z

Created page with " == Abstract == Train unit routing problem determines the number of train units needed to carry out involved trips, which is a significant part of railway operation cost...."

New page

== Abstract ==

Train unit routing problem determines the number of train units needed to carry out involved trips, which is a significant part of railway operation cost. In this paper, we focus on high-speed train unit routing problems, in which maintenance resource constraints both on time and distance are taken into account. Based on a connection network, this paper first proposes a general train unit routing model. Then, the general model is specialized to meet the circulation and maintenance conditions of high-speed train units in China, which is based on a special connection network with a two-day time horizon. A strategy is proposed to reduce the scale of the connection network, which improves the model’s solvability. Furthermore, an extension on multi-depot train unit routing problem is discussed. Finally, numerical experiments based on the real data of Chinese high-speed railway are carried out to verify the effectiveness and efficiency of the proposed mode and method.

== Original document ==

The different versions of the original document can be found in:

* [http://resolver.tudelft.nl/uuid:2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c http://resolver.tudelft.nl/uuid:2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c]

* [http://dx.doi.org/10.1016/j.cie.2018.02.039 http://dx.doi.org/10.1016/j.cie.2018.02.039],
: [http://resolver.tudelft.nl/uuid:2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c http://resolver.tudelft.nl/uuid:2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c]

* [https://api.elsevier.com/content/article/PII:S0360835218300755?httpAccept=text/xml https://api.elsevier.com/content/article/PII:S0360835218300755?httpAccept=text/xml],
: [https://api.elsevier.com/content/article/PII:S0360835218300755?httpAccept=text/plain https://api.elsevier.com/content/article/PII:S0360835218300755?httpAccept=text/plain],
: [http://dx.doi.org/10.1016/j.cie.2018.02.039 http://dx.doi.org/10.1016/j.cie.2018.02.039] under the license https://www.elsevier.com/tdm/userlicense/1.0/

* [https://www.sciencedirect.com/science/article/pii/S0360835218300755 https://www.sciencedirect.com/science/article/pii/S0360835218300755],
: [https://dblp.uni-trier.de/db/journals/candie/candie127.html#WangGYHM19 https://dblp.uni-trier.de/db/journals/candie/candie127.html#WangGYHM19],
: [https://www.narcis.nl/publication/RecordID/oai%3Atudelft.nl%3Auuid%3A2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c https://www.narcis.nl/publication/RecordID/oai%3Atudelft.nl%3Auuid%3A2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c],
: [https://academic.microsoft.com/#/detail/2794286129 https://academic.microsoft.com/#/detail/2794286129]

← Older revision	Revision as of 11:34, 16 February 2021
(No difference)

Hansen et al 2019a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 651883992 to Hansen et al 2019a

Scipediacontent: Created page with " == Abstract == Train unit routing problem determines the number of train units needed to carry out involved trips, which is a significant part of railway operation cost...."