2013
DOI: 10.1016/s1570-6672(13)60124-5
|View full text |Cite
|
Sign up to set email alerts
|

Route Selection for Railway Passengers: A Multi-objective Model and Optimization Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
13
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 2 publications
0
13
0
Order By: Relevance
“…The problem is formulated by using Eqs. (5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17)(18). The significant weights obtained using the AHP method in the previous phase are added into the objective function of ZOGP.…”
Section: Zero-one Goal Programingmentioning
confidence: 99%
See 2 more Smart Citations
“…The problem is formulated by using Eqs. (5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17)(18). The significant weights obtained using the AHP method in the previous phase are added into the objective function of ZOGP.…”
Section: Zero-one Goal Programingmentioning
confidence: 99%
“…To address this important issue, many scholars have been developing mathematical programing models to optimize route selection to improve the logistics performance. Yang et al [11]. established a multi-objective optimization model for railway route selection in China.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Most authors consider the main criteria as the operating cost and time travel, which has a great importance for developing the transport plan of the trains, [11,15,19,[21][22][23][24]29]. Some authors also investigated the criteria of transfer interval time [7], delayed times [13], social risk [17], transport risk [18], total energy consumption [20], damage cost [22], functionality and upgradeability, number of overtaking [25], compliance with standards [26], and the pollution factor [29]. The choice of criteria depends of the object of the study.…”
Section: Introductionmentioning
confidence: 99%
“…The solution efficiency is obvious superior to the current business linear solution software [5]. Improves the standard simulated annealing algorithm to solve the problem of dynamic route planning, which can get the optimal or approximately optimal route by comparing with classic Dijkstra algorithm [6]. Constructs the train service network based on existing train route and adopts the fast search algorithm to solve the feasible route set introducing the concept of information entropy to endow route weights and choose the relatively superior routes [7].…”
Section: Introductionmentioning
confidence: 99%