ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

An improved solution methodology for the urban transit routing problem

Huesselmann, G.*; van Vuuren, J. H.; Andersen, S. J.
COMPUTERS & OPERATIONS RESEARCH2024-3DOI: 10.1016/j.cor.2023.106481
1被引3阅读
引用收藏
分享

摘要

An improved solution methodology is proposed in this paper for the urban transit routing problem (UTRP). This methodology includes a procedure for the generation of improved initial solutions as well as improved metaheuristic search approaches, involving the use of hyperheuristics to manage search operators in both trajectory-based and population-based metaheuristics. The UTRP variant considered in this paper is that of deciding upon efficient bus transit routes. The design criteria embedded in our UTRP model are the simultaneous minimisation of the expected average passenger travel time and minimisation of the system operator's cost (measuring the latter as the sum total of all route lengths in the system). The model takes as input an origin-destination demand matrix for a pre-specified set of bus stops, along with an underlying road network structure, and returns as output a set of bus route trade-off solutions. The decision maker can then select one of these route sets subjectively, based on the desired degree of trade-off between the aforementioned transit system design criteria. This bi-objective minimisation problem is solved approximately in three distinct stages - a solution initialisation stage, an intermediate analysis stage, and an iterative metaheuristic search stage during which high-quality trade-off solutions are sought. A novel procedure is introduced for the solution initialisation stage, aimed at effectively generating high-quality initial feasible solutions. Two metaheuristics are implemented to solve instances of the problem, namely a dominance-based multi-objective simulated annealing algorithm and an improved non-dominated sorting genetic algorithm, each equipped with a hyperheuristic capable of managing the perturbation operators employed. Various novel operators are proposed for these metaheuristics, of which the most noteworthy take into account the demand of passengers.

学科与关键词

关键词
Transit network design problemUrban transit routing problemDominance-based multi-objective simulated annealingNon-dominated sorting genetic algorithm IIMetaheuristicHyperheuristic
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2024-03
卷期
第 163 卷
页码
106481
DOI
10.1016/j.cor.2023.106481
语言
ENGLISH
成果收录
SCIE
资助标注
South African National (Department of Transport); Stellenbosch Unit for Operations Research in Engineering

作者

  • H

    Huesselmann, G. (通讯) (第一作者)

  • v

    van Vuuren, J. H.

查看全部 3 位作者收起作者
  • A

    Andersen, S. J.

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417