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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 208; H. 1; S. 46 - 56
Hauptverfasser:	Curtin, Kevin M., Biba, Steve
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 2011 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!