A mixed-integer linear programming method for time-dependent line planning in passenger railway systems Article Swipe
X. Shi
,
Wenliang Zhou
,
Xiang Li
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1371/journal.pone.0322394
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1371/journal.pone.0322394
This paper addresses a line planning problem (LPP) that simultaneously optimizes both train and passenger times in passenger railway systems, considering time-dependent origin-destination-period demand and passenger train choice. The problem is clearly and flexibly modeled in a physical infrastructure-based directed graph, which efficiently integrates the train operation choice and the passenger train choice. The problem is first formulated as a mixed-integer, non-concave, and non-linear programming model aimed at minimizing both the total operating cost of trains and the total travel cost of passengers. To solve the problem, an extended time-dimension method is proposed to transform the non-concave and non-linear model into a mixed-integer linear programming (MILP) model that can be solved using a commercial solver. Additionally, a set of simplification strategies is introduced to reduce the computational complexity while ensuring the global optimality of the linear model. A case study of a busy Chinese railway line demonstrates that the optimized time-dependent line plan enhances operational efficiency and accommodates the diversified travel preferences driven by time-dependent demand.
Related Topics
Concepts
Integer programming
Train
Linear programming
Solver
Mathematical optimization
Computer science
Line (geometry)
Plan (archaeology)
Dimension (graph theory)
Integer (computer science)
Set (abstract data type)
Graph
Operations research
Engineering
Mathematics
Theoretical computer science
Cartography
Geography
Programming language
Archaeology
History
Geometry
Pure mathematics
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1371/journal.pone.0322394
- OA Status
- gold
- References
- 30
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4410766196
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4410766196Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1371/journal.pone.0322394Digital Object Identifier
- Title
-
A mixed-integer linear programming method for time-dependent line planning in passenger railway systemsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-05-27Full publication date if available
- Authors
-
X. Shi, Wenliang Zhou, Xiang LiList of authors in order
- Landing page
-
https://doi.org/10.1371/journal.pone.0322394Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1371/journal.pone.0322394Direct OA link when available
- Concepts
-
Integer programming, Train, Linear programming, Solver, Mathematical optimization, Computer science, Line (geometry), Plan (archaeology), Dimension (graph theory), Integer (computer science), Set (abstract data type), Graph, Operations research, Engineering, Mathematics, Theoretical computer science, Cartography, Geography, Programming language, Archaeology, History, Geometry, Pure mathematicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
30Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4410766196 |
|---|---|
| doi | https://doi.org/10.1371/journal.pone.0322394 |
| ids.doi | https://doi.org/10.1371/journal.pone.0322394 |
| ids.pmid | https://pubmed.ncbi.nlm.nih.gov/40424474 |
| ids.openalex | https://openalex.org/W4410766196 |
| fwci | 0.0 |
| mesh[0].qualifier_ui | |
| mesh[0].descriptor_ui | D011890 |
| mesh[0].is_major_topic | True |
| mesh[0].qualifier_name | |
| mesh[0].descriptor_name | Railroads |
| mesh[1].qualifier_ui | |
| mesh[1].descriptor_ui | D011382 |
| mesh[1].is_major_topic | True |
| mesh[1].qualifier_name | |
| mesh[1].descriptor_name | Programming, Linear |
| mesh[2].qualifier_ui | |
| mesh[2].descriptor_ui | D006801 |
| mesh[2].is_major_topic | False |
| mesh[2].qualifier_name | |
| mesh[2].descriptor_name | Humans |
| mesh[3].qualifier_ui | |
| mesh[3].descriptor_ui | D013997 |
| mesh[3].is_major_topic | False |
| mesh[3].qualifier_name | |
| mesh[3].descriptor_name | Time Factors |
| mesh[4].qualifier_ui | |
| mesh[4].descriptor_ui | D000465 |
| mesh[4].is_major_topic | False |
| mesh[4].qualifier_name | |
| mesh[4].descriptor_name | Algorithms |
| mesh[5].qualifier_ui | |
| mesh[5].descriptor_ui | D008962 |
| mesh[5].is_major_topic | False |
| mesh[5].qualifier_name | |
| mesh[5].descriptor_name | Models, Theoretical |
| mesh[6].qualifier_ui | |
| mesh[6].descriptor_ui | D011890 |
| mesh[6].is_major_topic | True |
| mesh[6].qualifier_name | |
| mesh[6].descriptor_name | Railroads |
| mesh[7].qualifier_ui | |
| mesh[7].descriptor_ui | D011382 |
| mesh[7].is_major_topic | True |
| mesh[7].qualifier_name | |
| mesh[7].descriptor_name | Programming, Linear |
| mesh[8].qualifier_ui | |
| mesh[8].descriptor_ui | D006801 |
| mesh[8].is_major_topic | False |
| mesh[8].qualifier_name | |
| mesh[8].descriptor_name | Humans |
| mesh[9].qualifier_ui | |
| mesh[9].descriptor_ui | D013997 |
| mesh[9].is_major_topic | False |
| mesh[9].qualifier_name | |
| mesh[9].descriptor_name | Time Factors |
| mesh[10].qualifier_ui | |
| mesh[10].descriptor_ui | D000465 |
| mesh[10].is_major_topic | False |
| mesh[10].qualifier_name | |
| mesh[10].descriptor_name | Algorithms |
| mesh[11].qualifier_ui | |
| mesh[11].descriptor_ui | D008962 |
| mesh[11].is_major_topic | False |
| mesh[11].qualifier_name | |
| mesh[11].descriptor_name | Models, Theoretical |
| type | article |
| title | A mixed-integer linear programming method for time-dependent line planning in passenger railway systems |
| awards[0].id | https://openalex.org/G5231212779 |
| awards[0].funder_id | https://openalex.org/F4320322843 |
| awards[0].display_name | |
| awards[0].funder_award_id | 2022JJ30057, 2022JJ30767 |
| awards[0].funder_display_name | Natural Science Foundation of Hunan Province |
| awards[1].id | https://openalex.org/G3712518982 |
| awards[1].funder_id | https://openalex.org/F4320321001 |
| awards[1].display_name | |
| awards[1].funder_award_id | 72471247 |
| awards[1].funder_display_name | National Natural Science Foundation of China |
| biblio.issue | 5 |
| biblio.volume | 20 |
| biblio.last_page | e0322394 |
| biblio.first_page | e0322394 |
| topics[0].id | https://openalex.org/T10698 |
| topics[0].field.id | https://openalex.org/fields/33 |
| topics[0].field.display_name | Social Sciences |
| topics[0].score | 0.9994000196456909 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/3313 |
| topics[0].subfield.display_name | Transportation |
| topics[0].display_name | Transportation Planning and Optimization |
| topics[1].id | https://openalex.org/T11568 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9993000030517578 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Railway Systems and Energy Efficiency |
| topics[2].id | https://openalex.org/T10842 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9966999888420105 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2210 |
| topics[2].subfield.display_name | Mechanical Engineering |
| topics[2].display_name | Railway Engineering and Dynamics |
| funders[0].id | https://openalex.org/F4320321001 |
| funders[0].ror | https://ror.org/01h0zpd94 |
| funders[0].display_name | National Natural Science Foundation of China |
| funders[1].id | https://openalex.org/F4320322843 |
| funders[1].ror | |
| funders[1].display_name | Natural Science Foundation of Hunan Province |
| is_xpac | False |
| apc_list.value | 1805 |
| apc_list.currency | USD |
| apc_list.value_usd | 1805 |
| apc_paid.value | 1805 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 1805 |
| concepts[0].id | https://openalex.org/C56086750 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7265453338623047 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q6042592 |
| concepts[0].display_name | Integer programming |
| concepts[1].id | https://openalex.org/C190839683 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6897484064102173 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q2448197 |
| concepts[1].display_name | Train |
| concepts[2].id | https://openalex.org/C41045048 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6553663611412048 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q202843 |
| concepts[2].display_name | Linear programming |
| concepts[3].id | https://openalex.org/C2778770139 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6486760973930359 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1966904 |
| concepts[3].display_name | Solver |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.6467630863189697 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C41008148 |
| concepts[5].level | 0 |
| concepts[5].score | 0.6259241104125977 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[5].display_name | Computer science |
| concepts[6].id | https://openalex.org/C198352243 |
| concepts[6].level | 2 |
| concepts[6].score | 0.504578709602356 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q37105 |
| concepts[6].display_name | Line (geometry) |
| concepts[7].id | https://openalex.org/C2776505523 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4883441627025604 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q4785468 |
| concepts[7].display_name | Plan (archaeology) |
| concepts[8].id | https://openalex.org/C33676613 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4743082523345947 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q13415176 |
| concepts[8].display_name | Dimension (graph theory) |
| concepts[9].id | https://openalex.org/C97137487 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4424003064632416 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q729138 |
| concepts[9].display_name | Integer (computer science) |
| concepts[10].id | https://openalex.org/C177264268 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4300461411476135 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[10].display_name | Set (abstract data type) |
| concepts[11].id | https://openalex.org/C132525143 |
| concepts[11].level | 2 |
| concepts[11].score | 0.42186951637268066 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[11].display_name | Graph |
| concepts[12].id | https://openalex.org/C42475967 |
| concepts[12].level | 1 |
| concepts[12].score | 0.3776942193508148 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q194292 |
| concepts[12].display_name | Operations research |
| concepts[13].id | https://openalex.org/C127413603 |
| concepts[13].level | 0 |
| concepts[13].score | 0.20040574669837952 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[13].display_name | Engineering |
| concepts[14].id | https://openalex.org/C33923547 |
| concepts[14].level | 0 |
| concepts[14].score | 0.1656019687652588 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[14].display_name | Mathematics |
| concepts[15].id | https://openalex.org/C80444323 |
| concepts[15].level | 1 |
| concepts[15].score | 0.07856488227844238 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[15].display_name | Theoretical computer science |
| concepts[16].id | https://openalex.org/C58640448 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q42515 |
| concepts[16].display_name | Cartography |
| concepts[17].id | https://openalex.org/C205649164 |
| concepts[17].level | 0 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q1071 |
| concepts[17].display_name | Geography |
| concepts[18].id | https://openalex.org/C199360897 |
| concepts[18].level | 1 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[18].display_name | Programming language |
| concepts[19].id | https://openalex.org/C166957645 |
| concepts[19].level | 1 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q23498 |
| concepts[19].display_name | Archaeology |
| concepts[20].id | https://openalex.org/C95457728 |
| concepts[20].level | 0 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q309 |
| concepts[20].display_name | History |
| concepts[21].id | https://openalex.org/C2524010 |
| concepts[21].level | 1 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[21].display_name | Geometry |
| concepts[22].id | https://openalex.org/C202444582 |
| concepts[22].level | 1 |
| concepts[22].score | 0.0 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q837863 |
| concepts[22].display_name | Pure mathematics |
| keywords[0].id | https://openalex.org/keywords/integer-programming |
| keywords[0].score | 0.7265453338623047 |
| keywords[0].display_name | Integer programming |
| keywords[1].id | https://openalex.org/keywords/train |
| keywords[1].score | 0.6897484064102173 |
| keywords[1].display_name | Train |
| keywords[2].id | https://openalex.org/keywords/linear-programming |
| keywords[2].score | 0.6553663611412048 |
| keywords[2].display_name | Linear programming |
| keywords[3].id | https://openalex.org/keywords/solver |
| keywords[3].score | 0.6486760973930359 |
| keywords[3].display_name | Solver |
| keywords[4].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[4].score | 0.6467630863189697 |
| keywords[4].display_name | Mathematical optimization |
| keywords[5].id | https://openalex.org/keywords/computer-science |
| keywords[5].score | 0.6259241104125977 |
| keywords[5].display_name | Computer science |
| keywords[6].id | https://openalex.org/keywords/line |
| keywords[6].score | 0.504578709602356 |
| keywords[6].display_name | Line (geometry) |
| keywords[7].id | https://openalex.org/keywords/plan |
| keywords[7].score | 0.4883441627025604 |
| keywords[7].display_name | Plan (archaeology) |
| keywords[8].id | https://openalex.org/keywords/dimension |
| keywords[8].score | 0.4743082523345947 |
| keywords[8].display_name | Dimension (graph theory) |
| keywords[9].id | https://openalex.org/keywords/integer |
| keywords[9].score | 0.4424003064632416 |
| keywords[9].display_name | Integer (computer science) |
| keywords[10].id | https://openalex.org/keywords/set |
| keywords[10].score | 0.4300461411476135 |
| keywords[10].display_name | Set (abstract data type) |
| keywords[11].id | https://openalex.org/keywords/graph |
| keywords[11].score | 0.42186951637268066 |
| keywords[11].display_name | Graph |
| keywords[12].id | https://openalex.org/keywords/operations-research |
| keywords[12].score | 0.3776942193508148 |
| keywords[12].display_name | Operations research |
| keywords[13].id | https://openalex.org/keywords/engineering |
| keywords[13].score | 0.20040574669837952 |
| keywords[13].display_name | Engineering |
| keywords[14].id | https://openalex.org/keywords/mathematics |
| keywords[14].score | 0.1656019687652588 |
| keywords[14].display_name | Mathematics |
| keywords[15].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[15].score | 0.07856488227844238 |
| keywords[15].display_name | Theoretical computer science |
| language | en |
| locations[0].id | doi:10.1371/journal.pone.0322394 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S202381698 |
| locations[0].source.issn | 1932-6203 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1932-6203 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | PLoS ONE |
| locations[0].source.host_organization | https://openalex.org/P4310315706 |
| locations[0].source.host_organization_name | Public Library of Science |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310315706 |
| locations[0].source.host_organization_lineage_names | Public Library of Science |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | PLOS One |
| locations[0].landing_page_url | https://doi.org/10.1371/journal.pone.0322394 |
| locations[1].id | pmid:40424474 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306525036 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | PubMed |
| locations[1].source.host_organization | https://openalex.org/I1299303238 |
| locations[1].source.host_organization_name | National Institutes of Health |
| locations[1].source.host_organization_lineage | https://openalex.org/I1299303238 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | publishedVersion |
| locations[1].raw_type | |
| locations[1].license_id | |
| locations[1].is_accepted | True |
| locations[1].is_published | True |
| locations[1].raw_source_name | PloS one |
| locations[1].landing_page_url | https://pubmed.ncbi.nlm.nih.gov/40424474 |
| locations[2].id | pmh:oai:RePEc:plo:pone00:0322394 |
| locations[2].is_oa | False |
| locations[2].source.id | https://openalex.org/S4306401271 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | RePEc: Research Papers in Economics |
| locations[2].source.host_organization | https://openalex.org/I77793887 |
| locations[2].source.host_organization_name | Federal Reserve Bank of St. Louis |
| locations[2].source.host_organization_lineage | https://openalex.org/I77793887 |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | article |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0322394 |
| locations[3].id | pmh:oai:doaj.org/article:8c926f47941a4d67aac1645b299d2af7 |
| locations[3].is_oa | False |
| locations[3].source.id | https://openalex.org/S4306401280 |
| locations[3].source.issn | |
| locations[3].source.type | repository |
| locations[3].source.is_oa | False |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[3].source.host_organization | |
| locations[3].source.host_organization_name | |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | submittedVersion |
| locations[3].raw_type | article |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | False |
| locations[3].raw_source_name | PLoS ONE, Vol 20, Iss 5, p e0322394 (2025) |
| locations[3].landing_page_url | https://doaj.org/article/8c926f47941a4d67aac1645b299d2af7 |
| locations[4].id | pmh:oai:pubmedcentral.nih.gov:12112200 |
| locations[4].is_oa | True |
| locations[4].source.id | https://openalex.org/S2764455111 |
| locations[4].source.issn | |
| locations[4].source.type | repository |
| locations[4].source.is_oa | False |
| locations[4].source.issn_l | |
| locations[4].source.is_core | False |
| locations[4].source.is_in_doaj | False |
| locations[4].source.display_name | PubMed Central |
| locations[4].source.host_organization | https://openalex.org/I1299303238 |
| locations[4].source.host_organization_name | National Institutes of Health |
| locations[4].source.host_organization_lineage | https://openalex.org/I1299303238 |
| locations[4].license | other-oa |
| locations[4].pdf_url | |
| locations[4].version | submittedVersion |
| locations[4].raw_type | Text |
| locations[4].license_id | https://openalex.org/licenses/other-oa |
| locations[4].is_accepted | False |
| locations[4].is_published | False |
| locations[4].raw_source_name | PLoS One |
| locations[4].landing_page_url | https://www.ncbi.nlm.nih.gov/pmc/articles/12112200 |
| indexed_in | crossref, doaj, pubmed |
| authorships[0].author.id | https://openalex.org/A5091299418 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9910-9345 |
| authorships[0].author.display_name | X. Shi |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I139660479 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Traffic and Transportation Engineering, Central South University, Changsha, Hunan, China. |
| authorships[0].institutions[0].id | https://openalex.org/I139660479 |
| authorships[0].institutions[0].ror | https://ror.org/00f1zfq44 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I139660479 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Central South University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Xin Shi |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Traffic and Transportation Engineering, Central South University, Changsha, Hunan, China. |
| authorships[1].author.id | https://openalex.org/A5018342630 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-2401-1049 |
| authorships[1].author.display_name | Wenliang Zhou |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I139660479 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Traffic and Transportation Engineering, Central South University, Changsha, Hunan, China. |
| authorships[1].institutions[0].id | https://openalex.org/I139660479 |
| authorships[1].institutions[0].ror | https://ror.org/00f1zfq44 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I139660479 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Central South University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Wenliang Zhou |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Traffic and Transportation Engineering, Central South University, Changsha, Hunan, China. |
| authorships[2].author.id | https://openalex.org/A5101406012 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-2557-8899 |
| authorships[2].author.display_name | Xiang Li |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I139660479 |
| authorships[2].affiliations[0].raw_affiliation_string | School of Traffic and Transportation Engineering, Central South University, Changsha, Hunan, China. |
| authorships[2].institutions[0].id | https://openalex.org/I139660479 |
| authorships[2].institutions[0].ror | https://ror.org/00f1zfq44 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I139660479 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Central South University |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Xiang Li |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | School of Traffic and Transportation Engineering, Central South University, Changsha, Hunan, China. |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1371/journal.pone.0322394 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A mixed-integer linear programming method for time-dependent line planning in passenger railway systems |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10698 |
| primary_topic.field.id | https://openalex.org/fields/33 |
| primary_topic.field.display_name | Social Sciences |
| primary_topic.score | 0.9994000196456909 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/3313 |
| primary_topic.subfield.display_name | Transportation |
| primary_topic.display_name | Transportation Planning and Optimization |
| related_works | https://openalex.org/W618248309, https://openalex.org/W2047683846, https://openalex.org/W2044902158, https://openalex.org/W2109912052, https://openalex.org/W1711527768, https://openalex.org/W4285278887, https://openalex.org/W2365237642, https://openalex.org/W2995925505, https://openalex.org/W2773399470, https://openalex.org/W3116484972 |
| cited_by_count | 0 |
| locations_count | 5 |
| best_oa_location.id | doi:10.1371/journal.pone.0322394 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S202381698 |
| best_oa_location.source.issn | 1932-6203 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1932-6203 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | PLoS ONE |
| best_oa_location.source.host_organization | https://openalex.org/P4310315706 |
| best_oa_location.source.host_organization_name | Public Library of Science |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310315706 |
| best_oa_location.source.host_organization_lineage_names | Public Library of Science |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | PLOS One |
| best_oa_location.landing_page_url | https://doi.org/10.1371/journal.pone.0322394 |
| primary_location.id | doi:10.1371/journal.pone.0322394 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S202381698 |
| primary_location.source.issn | 1932-6203 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1932-6203 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | PLoS ONE |
| primary_location.source.host_organization | https://openalex.org/P4310315706 |
| primary_location.source.host_organization_name | Public Library of Science |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310315706 |
| primary_location.source.host_organization_lineage_names | Public Library of Science |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | PLOS One |
| primary_location.landing_page_url | https://doi.org/10.1371/journal.pone.0322394 |
| publication_date | 2025-05-27 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W3012068453, https://openalex.org/W4200182997, https://openalex.org/W4366602249, https://openalex.org/W2560192442, https://openalex.org/W3126542092, https://openalex.org/W2039338672, https://openalex.org/W1657638245, https://openalex.org/W4239772001, https://openalex.org/W2125835969, https://openalex.org/W2010674343, https://openalex.org/W2005547391, https://openalex.org/W2895345576, https://openalex.org/W2034621328, https://openalex.org/W1603235454, https://openalex.org/W2067703847, https://openalex.org/W2018619682, https://openalex.org/W2076232801, https://openalex.org/W4285169337, https://openalex.org/W2081540698, https://openalex.org/W2170392562, https://openalex.org/W1985157975, https://openalex.org/W2490110638, https://openalex.org/W2339233888, https://openalex.org/W2922331646, https://openalex.org/W3181521649, https://openalex.org/W4206240595, https://openalex.org/W3096725652, https://openalex.org/W4307953888, https://openalex.org/W2182510773, https://openalex.org/W4376571587 |
| referenced_works_count | 30 |
| abstract_inverted_index.A | 137 |
| abstract_inverted_index.a | 3, 36, 59, 101, 112, 116, 141 |
| abstract_inverted_index.To | 83 |
| abstract_inverted_index.an | 87 |
| abstract_inverted_index.as | 58 |
| abstract_inverted_index.at | 67 |
| abstract_inverted_index.be | 109 |
| abstract_inverted_index.by | 163 |
| abstract_inverted_index.in | 16, 35 |
| abstract_inverted_index.is | 30, 55, 91, 121 |
| abstract_inverted_index.of | 74, 81, 118, 133, 140 |
| abstract_inverted_index.to | 93, 123 |
| abstract_inverted_index.The | 28, 53 |
| abstract_inverted_index.and | 13, 24, 32, 48, 62, 76, 97, 156 |
| abstract_inverted_index.can | 108 |
| abstract_inverted_index.set | 117 |
| abstract_inverted_index.the | 44, 49, 70, 77, 85, 95, 125, 130, 134, 148, 158 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.both | 11, 69 |
| abstract_inverted_index.busy | 142 |
| abstract_inverted_index.case | 138 |
| abstract_inverted_index.cost | 73, 80 |
| abstract_inverted_index.into | 100 |
| abstract_inverted_index.line | 4, 145, 151 |
| abstract_inverted_index.plan | 152 |
| abstract_inverted_index.that | 8, 107, 147 |
| abstract_inverted_index.(LPP) | 7 |
| abstract_inverted_index.aimed | 66 |
| abstract_inverted_index.first | 56 |
| abstract_inverted_index.model | 65, 99, 106 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.solve | 84 |
| abstract_inverted_index.study | 139 |
| abstract_inverted_index.times | 15 |
| abstract_inverted_index.total | 71, 78 |
| abstract_inverted_index.train | 12, 26, 45, 51 |
| abstract_inverted_index.using | 111 |
| abstract_inverted_index.which | 41 |
| abstract_inverted_index.while | 128 |
| abstract_inverted_index.(MILP) | 105 |
| abstract_inverted_index.choice | 47 |
| abstract_inverted_index.demand | 23 |
| abstract_inverted_index.driven | 162 |
| abstract_inverted_index.global | 131 |
| abstract_inverted_index.graph, | 40 |
| abstract_inverted_index.linear | 103, 135 |
| abstract_inverted_index.method | 90 |
| abstract_inverted_index.model. | 136 |
| abstract_inverted_index.reduce | 124 |
| abstract_inverted_index.solved | 110 |
| abstract_inverted_index.trains | 75 |
| abstract_inverted_index.travel | 79, 160 |
| abstract_inverted_index.Chinese | 143 |
| abstract_inverted_index.choice. | 27, 52 |
| abstract_inverted_index.clearly | 31 |
| abstract_inverted_index.demand. | 165 |
| abstract_inverted_index.modeled | 34 |
| abstract_inverted_index.problem | 6, 29, 54 |
| abstract_inverted_index.railway | 18, 144 |
| abstract_inverted_index.solver. | 114 |
| abstract_inverted_index.directed | 39 |
| abstract_inverted_index.enhances | 153 |
| abstract_inverted_index.ensuring | 129 |
| abstract_inverted_index.extended | 88 |
| abstract_inverted_index.flexibly | 33 |
| abstract_inverted_index.physical | 37 |
| abstract_inverted_index.planning | 5 |
| abstract_inverted_index.problem, | 86 |
| abstract_inverted_index.proposed | 92 |
| abstract_inverted_index.systems, | 19 |
| abstract_inverted_index.addresses | 2 |
| abstract_inverted_index.operating | 72 |
| abstract_inverted_index.operation | 46 |
| abstract_inverted_index.optimized | 149 |
| abstract_inverted_index.optimizes | 10 |
| abstract_inverted_index.passenger | 14, 17, 25, 50 |
| abstract_inverted_index.transform | 94 |
| abstract_inverted_index.commercial | 113 |
| abstract_inverted_index.complexity | 127 |
| abstract_inverted_index.efficiency | 155 |
| abstract_inverted_index.formulated | 57 |
| abstract_inverted_index.integrates | 43 |
| abstract_inverted_index.introduced | 122 |
| abstract_inverted_index.minimizing | 68 |
| abstract_inverted_index.non-linear | 63, 98 |
| abstract_inverted_index.optimality | 132 |
| abstract_inverted_index.strategies | 120 |
| abstract_inverted_index.considering | 20 |
| abstract_inverted_index.diversified | 159 |
| abstract_inverted_index.efficiently | 42 |
| abstract_inverted_index.non-concave | 96 |
| abstract_inverted_index.operational | 154 |
| abstract_inverted_index.passengers. | 82 |
| abstract_inverted_index.preferences | 161 |
| abstract_inverted_index.programming | 64, 104 |
| abstract_inverted_index.accommodates | 157 |
| abstract_inverted_index.demonstrates | 146 |
| abstract_inverted_index.non-concave, | 61 |
| abstract_inverted_index.Additionally, | 115 |
| abstract_inverted_index.computational | 126 |
| abstract_inverted_index.mixed-integer | 102 |
| abstract_inverted_index.mixed-integer, | 60 |
| abstract_inverted_index.simplification | 119 |
| abstract_inverted_index.simultaneously | 9 |
| abstract_inverted_index.time-dependent | 21, 150, 164 |
| abstract_inverted_index.time-dimension | 89 |
| abstract_inverted_index.infrastructure-based | 38 |
| abstract_inverted_index.origin-destination-period | 22 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/9 |
| sustainable_development_goals[0].score | 0.6000000238418579 |
| sustainable_development_goals[0].display_name | Industry, innovation and infrastructure |
| citation_normalized_percentile.value | 0.17157649 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |