507
Views
15
CrossRef citations to date
0
Altmetric
ARTICLES

A pareto artificial fish swarm algorithm for solving a multi-objective electric transit network design problem

ORCID Icon, ORCID Icon, , &
Pages 1648-1670 | Received 08 Nov 2019, Accepted 17 May 2020, Published online: 04 Jun 2020
 

Abstract

This study presents a multi-objective optimization model for the urban electric transit network design problem by simultaneously determining the set of transit routes, the service frequency and the location of charging depots with the objectives of minimizing the costs for passengers and operators. The constraints about the bus route, charging depot, vehicle operation and charging schedule are considered to ensure the rational design and operational feasibility of the electric transit network. The solution approach is based on a Pareto artificial fish swarm algorithm (PAFSA) in combination with the crossover and mutation operators. The transit network in an urban region of Beijing is studied in a case study, revealing that the proposed optimization model solved by the PAFSA is able to provide the Pareto optimal solutions to design a relatively large-scaled transit network for the best fits between the passengers and operators.

Disclosure statement

No potential conflict of interest is reported by the authors.

Additional information

Funding

This research is supported by the National Natural Science Foundation of China [grant number 71571011].

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.