Lagrangian relaxation approaches for network design problem considering travel time variability

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Transportmetrica A: Transport Science

• Publication date

  2025-11-05

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1080/23249935.2025.2583461
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Ant Colony Optimization for solving large-scale bi-level network design problems

  2025cited by this paper
• An improved alternating direction method of multipliers for solving deterministic user equilibrium

  2024cited by this paper
• Order dispatch problem of the inter-city or inter-district ridesplitting service

  2024cited by this paper
• Integrated physical and service network design of suburban rail under the coordination of urban rail

  2024cited by this paper
• Logistics vehicle routing optimisation with synchronised transfer

  2024cited by this paper
• An asynchronous parallel benders decomposition method for stochastic network design problems

  2023cited by this paper
• An infeasible start heuristic for the transit route network design problem

  2020cited by this paper
• Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty

  2020cited by this paper
• Benders decomposition for network design covering problems

  2020cited by this paper
• ADMM-based problem decomposition scheme for vehicle routing problem with time windows

  2019cited by this paper
• Metaheuristics for the transit route network design problem: a review and comparative analysis

  2019cited by this paper
• An algorithm for reliable shortest path problem with travel time correlations

  2019cited by this paper
• Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling

  2018cited by this paper
• Network design problem considering system time minimization and road safety maximization: formulation and solution approaches

  2017cited by this paper
• Capacitated transit service network design with boundedly rational agents

  2016cited by this paper
• Two-phase stochastic program for transit network design under demand uncertainty

  2016cited by this paper
• A review of sustainable network design for road networks

  2016cited by this paper
• A green intermodal service network design problem with travel time uncertainty

  2016cited by this paper
• Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

  2015cited by this paper
• Transportation network design for maximizing space–time accessibility

  2015cited by this paper
• An exact algorithm for the mean–standard deviation shortest path problem

  2015cited by this paper
• Transit network design based on travel time reliability

  2014cited by this paper
• A review of urban transportation network design problems

  2013cited by this paper
• Travel through time: the story of research on travel time reliability

  2013cited by this paper
• Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

  2011cited by this paper
• Transport Network Design Problem under Uncertainty: A Review and New Developments

  2011cited by this paper
• Multi-period transportation network design under demand uncertainty

  2009cited by this paper
• Modeling impacts of adverse weather conditions on a road network with uncertainties in demand and supply

  2008cited by this paper
• A survey on benders decomposition applied to fixed-charge network design problems

  2005cited by this paper
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

  2004cited by this paper
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

  2000cited by this paper
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound

  1998cited by this paper
• Models and algorithms for road network design: a review and some new developments

  1998cited by this paper
• Scenarios and Policy Aggregation in Optimization Under Uncertainty

  1991cited by this paper
• Network Design and Transportation Planning: Models and Algorithms

  1984cited by this paper
• Transportation Research Part B

  year unknowncited by this paper

• No citing papers are available for this paper.