A metaheuristic approach to the urban transit routing problem

DOI10.1007/S10732-008-9089-8MaRDI QIDQ972642zbMATH OpenOpenAlexFDO

Authors Lang Fan, Christine L. Mumford

Publication date 21 May 2010

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10732-008-9089-8

zbMATH Keywords

Hill-climbingsimulated annealingurban transit routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Solving urban transit route design problem using selection hyper-heuristics
• Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem
• scientific article; zbMATH DE number 1114465
• APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM
• Multi-objective vehicle routing problems

Cites work

• A note on two problems in connexion with graphs
• A tabu search based heuristic method for the transit route network design problem
• Evaluation and optimization of urban public transportation networks
• scientific article; zbMATH DE number 3664728 (Why is no real title available?)

Cited in

(16)

• Solving urban transit route design problem using selection hyper-heuristics
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem
• Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
• The grid based approach, a fast local evaluation technique for line planning
• A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation
• A review of urban transportation network design problems
• A demand based route generation algorithm for public transit network design
• Design method using hybrid of line-type and circular-type routes for transit network system optimization
• Solving the multi‐objective bike routing problem by meta‐heuristic algorithms
• A framework for the generation of complex scenario instances in the Urban Transit Routing Problem
• An improved solution methodology for the urban transit routing problem
• Speeding up the passenger assignment problem in transit planning by the direct link network representation
• The choice of algorithms for solving a multi-agent routing problem based on solving related problems
• Quantum optimization of coherent chaotic systems: a case for buses of Kathmandu
• An exact approach for the transit route network design problem

Describes a project that uses

Uses Software

• Algorithm 97

This page was built for publication: A metaheuristic approach to the urban transit routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972642)