Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/117323
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | en_US |
| dc.contributor | Department of Industrial and Systems Engineering | en_US |
| dc.creator | Liang, M | en_US |
| dc.creator | Xu, M | en_US |
| dc.creator | Wang, S | en_US |
| dc.date.accessioned | 2026-02-11T06:21:38Z | - |
| dc.date.available | 2026-02-11T06:21:38Z | - |
| dc.identifier.issn | 0305-0483 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/117323 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Pergamon Press | en_US |
| dc.subject | Integrated transit-bike system | en_US |
| dc.subject | Joint optimization design | en_US |
| dc.subject | Multi-objective optimization | en_US |
| dc.subject | Traffic assignment | en_US |
| dc.subject | Transportation | en_US |
| dc.title | Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 141 | en_US |
| dc.identifier.doi | 10.1016/j.omega.2025.103484 | en_US |
| dcterms.abstract | In this study, we investigate the joint optimization design of transit and bike-sharing systems (JDTB) at the strategic planning level, where the transit network, operating frequencies of transit lines, bike-sharing parking locations, and associated bike deployment numbers are simultaneously determined. Considering that transit and bike-sharing systems are operated by different operators with various objectives, we propose a multi-objective bi-level optimization model to formulate the JDTB problem. The upper-level optimization has two competing objectives: namely, the transit objective to minimize overall costs for both users and the transit operator, and the bike-sharing objective to maximize bike-sharing profits. At the lower level, a stochastic user equilibrium (SUE) assignment model is proposed to capture users’ choice behaviors in integrated transit-bike systems. To achieve more realistic choice behaviors and provide practical and reliable JDTB solutions, this model considers various impact factors on users’ decision-making processes, including congestion and common-line issues in transit systems, bike availability and reuse, as well as multimode combination and transfers in trip chains. Moreover, a diagonalization method combined with an iterative balancing scheme as well as a meta-heuristic algorithm based on NSGA-II are developed to solve the SUE and JDTB problems, respectively. Numerical experiments demonstrate the efficacy of the proposed model and algorithm in achieving trade-off solutions between the interests of transit and bike-sharing operators. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Omega, June 2026, v. 141, 103484 | en_US |
| dcterms.isPartOf | Omega | en_US |
| dcterms.issued | 2026-06 | - |
| dc.identifier.scopus | 2-s2.0-105024334568 | - |
| dc.identifier.eissn | 1873-5274 | en_US |
| dc.identifier.artn | 103484 | en_US |
| dc.description.validate | 202602 bchy | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G000902/2026-01 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | This work was supported by the National Natural Science Foundation of China [Grant Nos. 72371221, 72361137006], the Research Grants Council of the Hong Kong Special Administrative Region, China [Project number HKSAR RGC TRS T32-707/22-N], the National Natural Science Foundation of China [Grant number 52432010], and the National Key Research and Development Program of China [Grant number 2022XAGG0126]. | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2026-06-30 | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



