The Transit Route Arc-Node Service Maximization problem

This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that maximizes the service value of a route, rather than minimizing cost. Cost (distance) is considered as a budget constraint on the extent of the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 208; číslo 1; s. 46 - 56
Hlavní autori: Curtin, Kevin M., Biba, Steve
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 2011
Elsevier
Elsevier Sequoia S.A
Edícia:European Journal of Operational Research
Predmet:
Applied sciences
Buildings. Public works
Divide & conquer algorithms
Exact sciences and technology
Flows in networks. Combinatorial problems
Integer programming
Linear programming
Location
Logistics
Mathematical models
Mathematical programming
Network optimization
Operational research and scientific management
Operational research. Management science
Route optimization
Routing
Routing Transportation Integer programming Network optimization Transit Location
Studies
Transit
Transportation
Transportation problem (Operations research)
Traveling salesman problem
Urban development
United States > US
Richardson Texas
Integer programming
Routing
Transit
Transportation
Network optimization
Location
Costs
Linear structure
Travelling salesman problem
Modeling
Urban district network
Street
Budget
Localization
Divide and conquer method
Optimal flow
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that maximizes the service value of a route, rather than minimizing cost. Cost (distance) is considered as a budget constraint on the extent of the route. The mathematical formulation modifies and exploits the structure of linear programming problems designed for the traveling salesman problem. An innovative divide-and-conquer solution procedure is presented that not only makes the transit routing problem tractable, but also provides a range of high-quality alternate routes for consideration, some of which have substantially varying geometries. Variant formulations are provided for several common transit route types. The model is tested through its application to an existing street network in Richardson, TX. Optimal numeric results are obtained for several problem instances, and these results demonstrate that increased route cost is not correlated with increased service provision.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2010.07.026