arrow
返回

Path based algorithms for metro network design

delete2015-10-01
delete27
delete
OA
AI
G
Gilbert Laporte
M
Marta Pascoal *
DOI:10.1016/j.cor.2015.04.007delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper proposes a practical methodology for the problem of designing a metro configuration under two criteria: population coverage and construction cost. It is assumed that a set of corridors defining a rough a priori geometric configuration is provided by the planners. The proposed algorithm consists of fine tuning the location of single alignments within each corridor. This is achieved by means of a bicriteria methodology that generates sets of non-dominated paths. These alignments are then combined to form a metro network by solving a bicriteria integer linear program. Extensive computational experiments confirm the efficiency of the proposed methodology. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Metro network design
Path based algorithm
Bicriteria optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

H
HEC Montreal
学者数:
860
论文数: 944
被引数: 6
U
universite de montreal
学者数:
4.6W
论文数: 3.8W
被引数: 46
引用论文

引用论文

Minimum cost path problems with relays
err2011-01-01
err64
PREAI
errLaporte, Gilbert; Pascoal, Marta M. B.
err分享
err收藏
err分享
err收藏
Location of infrastructure in urban railway networks
err2009-05-01
err56
PREAI
errMarin, Angel; Garcia-Rodenas, Ricardo
err分享
err收藏
err分享
err收藏
学者 查看更多内容