Application of Modified NSGA-II to the Transit Network Design Problem

Yang, Jie; Jiang, Yangsheng

doi:10.1155/2020/3753601

Cited by 12 publications

(3 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When more than one objective is considered, many studies combine the objectives using a weight function. A few use a bi-objective approach where both objectives are minimized at the same time, generating a set of non-dominated solutions (Miandoabchi et al 2012;Mumford 2013;John et al 2014;Yang and Jiang 2020).…”

Section: Objective Functionmentioning

confidence: 99%

A survey on the transit network design and frequency setting problem

Durán-Micco

Vansteenwegen

2021

Public Transp

View full text Add to dashboard Cite

Appropriate public transport systems are crucial in modern cities. Given the high costs that they represent and the impact they have on people's lives, effective tools are required to support their design. With this in mind, the Transit Network Design problem (TNDP) and the Transit Network Design and Frequency Setting problem (TNDFSP) have been extensively studied in the domain of Operations Research. However, due to the complexity of these problems, multiple simplifications are typically made when modelling and designing solution algorithms. Therefore, still no optimization techniques are available to address these problems in practice. Moreover, different studies address different versions of the problem, with varying assumptions and constraints, complicating the comparison of results or solution approaches. This paper presents an extensive survey of studies addressing the TNDP and the TNDFSP. It discusses the different assumptions, constraints, objectives, solutions approaches and testing instances that have been considered in the literature. Furthermore, a detailed analysis is done regarding the case studies considered for the TNDFSP. Moreover, the variants of the passenger assignment subproblem that have been applied within the TNDP and the TNDFSP are discussed. The analysis shows that extensive research has been done regarding these problems. However, it also identified the significant gap that still exists between theory and practice, even in the studies addressing case studies.

show abstract

Section: Objective Functionmentioning

confidence: 99%

A survey on the transit network design and frequency setting problem

Durán-Micco

Vansteenwegen

2021

Public Transp

View full text Add to dashboard Cite

show abstract

“…ese networks are based on actual bus route networks from Chinese and British cities and are being used more and more [4,6,8,[18][19][20]53]. One of the datasets was already used earlier by Fan and Mumford [12], and another one was already used by Nikolić and Teodorović [9] with different parameters.…”

Section: Benchmark Instancesmentioning

confidence: 99%

An Exact Solution Approach for the Bus Line Planning Problem with Integrated Passenger Routing

Vermeir

Engelen

Philips

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

The bus line planning problem or transit network design problem with integrated passenger routing is a challenging combinatorial problem. Although well-known benchmark instances for this problem have been available for decades, the state of the art lacks optimal solutions for these instances. The branch and bound algorithm, presented in this paper, introduces three novel concepts to determine these optimal solutions: (1) a new line pool generation method based on dominance, (2) the introduction of essential links, i.e., links which can be determined beforehand and must be present in the optimal solution, and (3) a new network representation based on adding only extra edges. Next to presenting the newly obtained optimal solutions, each of the abovementioned concepts is examined in isolation in the experiments, and it is shown that they contribute significantly to the success of the algorithm.

show abstract

“…10.3389/fenrg.2022.996726 model, TRDP (transit route design problem), has been introduced to reduce the time consumption with the shortest optimal route (Yang and Jiang, 2020).…”

mentioning

confidence: 99%

Path planning for EVs based on RA-RRT* model

Muhammad

Zhou

2023

Front. Energy Res.

View full text Add to dashboard Cite

The optimal path planning for EVs (electric vehicles) has gained great attention during the last decade due to the zero pollution emission characteristics and limited power capacity of EV batteries. In this paper, an optimal route search is proposed considering multiple charging stations in a dynamic urban environment, while it is still applicable when the initial available amount of the battery fails to cover a certain travel range. The TRDP (transit route design problem) and TNDP (transit node design problem) are used to search for the most feasible routes based on time and driving range via the improved route-assisted rapid random tree (RA-RRT*) algorithm. Considering the status of charge of an EV’s battery during optimal routes search, three states are investigated between the destination and the aggregators: (1) bypassing the aggregators, (2) stopping over a single aggregator, and (3) stopping over multiple aggregators. During the states (2) and (3), it is required that the EVs be charged at the charging stations obtained by the RA-RRT* algorithm while approaching the destination. The proposed algorithm is tested on a random dataset under certain conditions, that is, traffic flow with congestion and assigned target locations from a given map data, with comparison experiments for efficacy verification.

show abstract

Application of Modified NSGA-II to the Transit Network Design Problem

Cited by 12 publications

References 41 publications

A survey on the transit network design and frequency setting problem

A survey on the transit network design and frequency setting problem

An Exact Solution Approach for the Bus Line Planning Problem with Integrated Passenger Routing

Path planning for EVs based on RA-RRT* model

Contact Info

Product

Resources

About