Optimization of Multimodal Discrete Network Design Problems Based on Super Networks

In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented...

Description complète

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yaling Zhou, Chengxuan Cao, Ziyan Feng
Format:	article
Langue:	EN
Publié:	MDPI AG 2021
Sujets:	super network discrete network design problem multimodal transport network bi-objective programming hybrid heuristic algorithm Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999
Accès en ligne:	https://doaj.org/article/e3f59e0fbd494d65b18b4067c1f59ca8
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

id	oai:doaj.org-article:e3f59e0fbd494d65b18b4067c1f59ca8
record_format	dspace
spelling	oai:doaj.org-article:e3f59e0fbd494d65b18b4067c1f59ca82021-11-11T15:12:23ZOptimization of Multimodal Discrete Network Design Problems Based on Super Networks10.3390/app1121101432076-3417https://doaj.org/article/e3f59e0fbd494d65b18b4067c1f59ca82021-10-01T00:00:00Zhttps://www.mdpi.com/2076-3417/11/21/10143https://doaj.org/toc/2076-3417In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented to signify the modal interactions. Then, the generalized cost formulas of each type of links in the super network are defined. And based on the above formulas a bi-objective programming model is proposed to minimize the network operation cost and construction cost with traffic flow equilibrium constraints, investment constraints and expansion constraints. Moreover, a hybrid heuristic algorithm that combines the minimum cost flow algorithm and simulated annealing algorithm is presented to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is evaluated through two numerical tests: a simple test network and an actual multimodal transport network.Yaling ZhouChengxuan CaoZiyan FengMDPI AGarticlesuper networkdiscrete network design problemmultimodal transport networkbi-objective programminghybrid heuristic algorithmTechnologyTEngineering (General). Civil engineering (General)TA1-2040Biology (General)QH301-705.5PhysicsQC1-999ChemistryQD1-999ENApplied Sciences, Vol 11, Iss 10143, p 10143 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	super network discrete network design problem multimodal transport network bi-objective programming hybrid heuristic algorithm Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999
spellingShingle	super network discrete network design problem multimodal transport network bi-objective programming hybrid heuristic algorithm Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999 Yaling Zhou Chengxuan Cao Ziyan Feng Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
description	In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented to signify the modal interactions. Then, the generalized cost formulas of each type of links in the super network are defined. And based on the above formulas a bi-objective programming model is proposed to minimize the network operation cost and construction cost with traffic flow equilibrium constraints, investment constraints and expansion constraints. Moreover, a hybrid heuristic algorithm that combines the minimum cost flow algorithm and simulated annealing algorithm is presented to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is evaluated through two numerical tests: a simple test network and an actual multimodal transport network.
format	article
author	Yaling Zhou Chengxuan Cao Ziyan Feng
author_facet	Yaling Zhou Chengxuan Cao Ziyan Feng
author_sort	Yaling Zhou
title	Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
title_short	Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
title_full	Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
title_fullStr	Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
title_full_unstemmed	Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
title_sort	optimization of multimodal discrete network design problems based on super networks
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/e3f59e0fbd494d65b18b4067c1f59ca8
work_keys_str_mv	AT yalingzhou optimizationofmultimodaldiscretenetworkdesignproblemsbasedonsupernetworks AT chengxuancao optimizationofmultimodaldiscretenetworkdesignproblemsbasedonsupernetworks AT ziyanfeng optimizationofmultimodaldiscretenetworkdesignproblemsbasedonsupernetworks
_version_	1718436704418791424

Optimization of Multimodal Discrete Network Design Problems Based on Super Networks

Documents similaires