The transit route arc-node service maximization problem

DOI10.1016/j.ejor.2010.07.026zbMath1206.90010OpenAlexW2094578975WikidataQ58484338 ScholiaQ58484338MaRDI QIDQ621660

Kevin M. Curtin, Steve Biba

Publication date: 28 January 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.026

zbMATH Keywords

integer programmingtransportationlocationnetwork optimizationroutingtransit

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (6)

Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ Rapid transit network design for optimal cost and origin-destination demand capture ⋮ Path based algorithms for metro network design ⋮ Corridor-based metro network design with travel flow capture ⋮ A simulated annealing for multi-criteria network path problems ⋮ A review of urban transportation network design problems

Cites Work

• Unnamed Item
• Strategic route extension in transit networks
• Location-routing: issues, models and methods
• A route set construction algorithm for the transit network design problem
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The median tour and maximal covering tour problems: Formulations and heuristics
• A coverage model for improving public transit system accessibility and expanding access
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• Optimization of transit route network, vehicle headways and timetables for large-scale transit networks
• Multi-objective vehicle routing problems
• Arc routing in a node routing environment
• The Truck Dispatching Problem
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• The prize collecting traveling salesman problem
• The Covering Salesman Problem
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• The Traveling-Salesman Problem
• Discrete-Variable Extremum Problems

This page was built for publication: The transit route arc-node service maximization problem