Flows in Transportation Networks
Erschienen am 14. Mai 2014
205 Seiten
978-0-08-095599-5 (ISBN)
Beschreibung
Flows in Transportation Networks
Weitere Details
Weitere Ausgaben
Inhalt
- Front Cover
- Flows in Transportation Networks
- Copyright Page
- Contents
- Preface
- Acknowledgments
- Chapter I. TRANSPORTATION NETWORKS
- 1. Introduction
- 2. Examples of Transportation Networks
- 3. Transportation Planning Process
- 4. Conclusion
- 5. Notes and References
- Chapter II. ELEMENTS OF NETWORK THEORY
- 6. Introduction
- 7. Graphs: Definitions and Notations
- 8. Flows and Conservation Laws
- 9. Costs and Capacities
- 10. Conclusion
- 11. Notes and References
- 12. Problems
- Chapter III. EXTREMAL PRINCIPLES AND TRAFFIC ASSIGNMENT
- 13. Introduction
- 14. Cheapest Routes
- 15. Minimum Network Cost
- 16. Flow Dependent Costs
- 17. Notes and References
- 18. Problems
- Chapter IV. TRIP DISTRIBUTION
- 19. Introduction
- 20. Model Formulation
- 21. Hitchcock Model
- 22. Entropy Models
- 23. Opportunity Models
- 24. Combined Distribution and Assignment
- 25. Conclusion
- 26. Notes and References
- 27. Problems
- Appendix A. THEOREM FOR CHEAPEST ROUTE ALGORITHMS
- Appendix B. DUALITY THEORY
- Appendix C. INEQUALITIES FOR MARGINAL AND AVERAGE LINK AND CHAIN COSTS
- Appendix D. ANSWERS TO PROBLEMS
- Index
