Application of Modified NSGA-II to the Transit Network Design Problem
The transit network design problem involves determining a certain number of routes to operate in an urban area to balance the costs of the passengers and the operator. In this paper, we simultaneously determine the route structure of each route and the number of routes in the final solution. A novel...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2020/3753601 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832553962384916480 |
|---|---|
| author | Jie Yang Yangsheng Jiang |
| author_facet | Jie Yang Yangsheng Jiang |
| author_sort | Jie Yang |
| collection | DOAJ |
| description | The transit network design problem involves determining a certain number of routes to operate in an urban area to balance the costs of the passengers and the operator. In this paper, we simultaneously determine the route structure of each route and the number of routes in the final solution. A novel initial route set generation algorithm and a route set size alternating heuristic are embedded into a nondominated sorting genetic algorithm-II- (NSGA-II-) based solution framework to produce the approximate Pareto front. The initial route set generation algorithm aims to generate high-quality initial solutions for succeeding optimization procedures. To explore the solution space and to have solutions with a different number of routes, a route set size alternating heuristic is developed to change the number of routes in a solution by adding or deleting one route. Experiments were performed on Mandl’s network and four larger Mumford’s networks. Compared with a fixed route set size approach, the proposed NSGA-II-based solution method can produce an approximate Pareto front with much higher solution quality as well as improved computation efficiency. |
| format | Article |
| id | doaj-art-a9d801a7f9e449fda291674b14307efe |
| institution | Kabale University |
| issn | 0197-6729 2042-3195 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-a9d801a7f9e449fda291674b14307efe2025-02-03T05:52:43ZengWileyJournal of Advanced Transportation0197-67292042-31952020-01-01202010.1155/2020/37536013753601Application of Modified NSGA-II to the Transit Network Design ProblemJie Yang0Yangsheng Jiang1School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan 611756, ChinaSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan 611756, ChinaThe transit network design problem involves determining a certain number of routes to operate in an urban area to balance the costs of the passengers and the operator. In this paper, we simultaneously determine the route structure of each route and the number of routes in the final solution. A novel initial route set generation algorithm and a route set size alternating heuristic are embedded into a nondominated sorting genetic algorithm-II- (NSGA-II-) based solution framework to produce the approximate Pareto front. The initial route set generation algorithm aims to generate high-quality initial solutions for succeeding optimization procedures. To explore the solution space and to have solutions with a different number of routes, a route set size alternating heuristic is developed to change the number of routes in a solution by adding or deleting one route. Experiments were performed on Mandl’s network and four larger Mumford’s networks. Compared with a fixed route set size approach, the proposed NSGA-II-based solution method can produce an approximate Pareto front with much higher solution quality as well as improved computation efficiency.http://dx.doi.org/10.1155/2020/3753601 |
| spellingShingle | Jie Yang Yangsheng Jiang Application of Modified NSGA-II to the Transit Network Design Problem Journal of Advanced Transportation |
| title | Application of Modified NSGA-II to the Transit Network Design Problem |
| title_full | Application of Modified NSGA-II to the Transit Network Design Problem |
| title_fullStr | Application of Modified NSGA-II to the Transit Network Design Problem |
| title_full_unstemmed | Application of Modified NSGA-II to the Transit Network Design Problem |
| title_short | Application of Modified NSGA-II to the Transit Network Design Problem |
| title_sort | application of modified nsga ii to the transit network design problem |
| url | http://dx.doi.org/10.1155/2020/3753601 |
| work_keys_str_mv | AT jieyang applicationofmodifiednsgaiitothetransitnetworkdesignproblem AT yangshengjiang applicationofmodifiednsgaiitothetransitnetworkdesignproblem |