Scipediacontent: Scipediacontent moved page Draft Content 725923086 to Conejero et al 2014a

2021-02-12T12:00:48Z

Scipediacontent moved page Draft Content 725923086 to Conejero et al 2014a

Scipediacontent: Created page with " == Abstract == Given a railway line with n stops and the number of travelers between each pair of stops, we show how to split these stops into k different fare zones in orde..."

2021-02-12T12:00:45Z

Created page with " == Abstract == Given a railway line with n stops and the number of travelers between each pair of stops, we show how to split these stops into k different fare zones in orde..."

New page

== Abstract ==

Given a railway line with n stops and the number of travelers between each pair of stops, we show how to split these stops into k different fare zones in order to maximize the benefit obtained from the sale of tickets to the travelers. We present a method to obtain this solution that is based on finding the longest path in a weighted root tree. This method improves in terms of efficiency the combinatorial method, where all the possible distributions have to be considered for deciding which is the optimal one. The authors would like to thank RENFE for his collaboration and providing us several tables of data of the flow of passengers of the commuter trains of the Valencia region. J. Alberto Conejero is supported by MEC Project MTM2013-47093-P and Esther Sanabria-Codesal is supported by MEC Project MTM2012-33073. Conejero Casares, JA.; Jordan Lluch, C.; Sanabria Codesal, E. (2014). A tree-based model for setting optimal train fare zones. Mathematical Problems in Engineering. 2014:1-11. doi:10.1155/2014/384321 S 1 11 2014

Document type: Article

== Full document ==
<pdf>Media:Draft_Content_725923086-beopen93-1527-document.pdf</pdf>

== Original document ==

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

* [http://downloads.hindawi.com/journals/mpe/2014/384321.pdf http://downloads.hindawi.com/journals/mpe/2014/384321.pdf] under the license https://creativecommons.org/licenses/by

* [http://dx.doi.org/10.1155/2014/384321 http://dx.doi.org/10.1155/2014/384321] under the license cc-by

* [http://hdl.handle.net/10251/49158 http://hdl.handle.net/10251/49158]

* [http://downloads.hindawi.com/journals/mpe/2014/384321.pdf http://downloads.hindawi.com/journals/mpe/2014/384321.pdf],
: [http://downloads.hindawi.com/journals/mpe/2014/384321.xml http://downloads.hindawi.com/journals/mpe/2014/384321.xml],
: [http://dx.doi.org/10.1155/2014/384321 http://dx.doi.org/10.1155/2014/384321]

* [http://dx.doi.org/10.1155/2014/384321 http://dx.doi.org/10.1155/2014/384321],
: [https://doaj.org/toc/1024-123X https://doaj.org/toc/1024-123X],
: [https://doaj.org/toc/1563-5147 https://doaj.org/toc/1563-5147] under the license http://creativecommons.org/licenses/by/3.0/

* [https://www.hindawi.com/journals/mpe/2014/384321 https://www.hindawi.com/journals/mpe/2014/384321],
: [https://riunet.upv.es/handle/10251/49158 https://riunet.upv.es/handle/10251/49158],
: [https://core.ac.uk/display/90334664 https://core.ac.uk/display/90334664],
: [http://downloads.hindawi.com/journals/mpe/2014/384321.pdf http://downloads.hindawi.com/journals/mpe/2014/384321.pdf],
: [https://riunet.upv.es/bitstream/10251/49158/1/Conejero%3bJordan%3bSanabria%20-%20A%20tree-based%20model%20for%20setting%20optimal%20train%20fare%20zones.pdf https://riunet.upv.es/bitstream/10251/49158/1/Conejero%3bJordan%3bSanabria%20-%20A%20tree-based%20model%20for%20setting%20optimal%20train%20fare%20zones.pdf],
: [https://academic.microsoft.com/#/detail/2021996261 https://academic.microsoft.com/#/detail/2021996261]

← Older revision	Revision as of 12:00, 12 February 2021
(No difference)

Conejero et al 2014a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 725923086 to Conejero et al 2014a

Scipediacontent: Created page with " == Abstract == Given a railway line with n stops and the number of travelers between each pair of stops, we show how to split these stops into k different fare zones in orde..."