PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 21, 2026Transportation Research Part C Emerging Technologies9 citationsOpen Access

A two-stage stochastic optimization framework for integrated passenger-freight bus transport under time-varying capacity constraints

View Full Paper
YZYang ZhangYZYu ZhouBYBin Yu

Key Points

  • The aim is to create an optimization framework for integrating passenger and freight transport using bus systems.
  • Formulated a two-stage stochastic programming model for freight routing and station placement.
  • Used a link availability matrix to handle dynamic capacity constraints.
  • Designed a decomposition-based algorithm combining L-shaped framework with Lagrangian relaxation.
  • Applied a case study in Beijing's Shijingshan District bus network to test the model.
  • Increased freight capacity without significantly impacting passenger transport.
  • Showed economies of scale and a 'capacity paradox' in the bus system.
  • Provided effective implementation strategies for urban managers.

Abstract

• Uses city buses’ empty space to deliver parcels without adding new vehicles. • Shows how changing passenger demand limits freight space on buses during the day. • Optimizes both where to add freight stations and how parcels move through the network. • Custom solution method finds very good plans much faster than standard software. • Beijing case study shows higher freight capacity with little impact on bus passengers. This paper develops an optimization framework for integrated passenger-freight bus transport (IPFBT), which leverages the spare capacity of public bus systems to enhance sustainable urban freight delivery. We formulate a two-stage stochastic programming model that jointly optimizes the strategic location of passenger-freight integration stations and operational-level freight routing under time-varying passenger demand. The model innovatively introduces a link availability matrix to characterize dynamic capacity constraints under the passenger-priority principle, and designs temporal shift and spatial shift strategies to address capacity shortage during peak periods. To solve this large-scale, uncertainty-driven problem, we design a decomposition-based algorithm combining a L-shaped framework with Lagrangian relaxation. The master problem is efficiently solved via a greedy set-cover heuristic, while subproblems are decomposed into parallelizable single-commodity shortest path problems. Adaptive multiplier updates and feasibility restoration mechanisms are incorporated to ensure convergence and solution quality. A real-world case study based on the Shijingshan District bus network in Beijing demonstrates the model’s effectiveness and computational scalability. The study reveals phenomena such as obvious economies of scale and “capacity paradox” in the system, and provides implementation recommendations including phased deployment strategies for urban managers.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhang et al. (2026) studied this question.

synapsesocial.com/papers/69be35f96e48c4981c674824https://doi.org/10.1016/j.trc.2026.105632
Ask AI
Helpful
Bookmark
Share
View Full Paper