Description
Transportation Networks
A Quantitative Treatment
Routledge Library Edtions: Global Transport Planning Series
Author: Teodorović D.
Language: English
Subjects for Transportation Networks:
Keywords
Transportation Network; Entire Transportation Network; flows on transporation networks; Euler Tour; transport network capacity; Cheapest Path; problems of vehicle routing; Chinese Postman Problem; heuristic assignment algorithim; Shortest Path; depot locations; Predecessor Node; Heuristic sweeping algorithm; Bipartite Graph; Transportation discipline; Ordinary Branches; Transportation networks; Traveling Salesman Problem; Vehicle routing; Oriented Network; Conservation laws; Vehicle Routing Problems; Traveling Salesman Tour; Euler Path; Probabilistic Network; Capacity Matrix; Minimum Spanning Tree Problem; Branch Length; Total Travel Time; Space Time Diagram; Flow Conservation Law; Vehicle Capacity Constraint; Closed State; Transportation Services; Flow Conservation Equations
Publication date: 04-2023
· 15.6x23.4 cm · Paperback
Publication date: 05-2021
· 15.6x23.4 cm · Hardback
Description
/li>Contents
/li>Readership
/li>Biography
/li>
Originally published in 1986 and a major contribution towards improving operations within transportation systems, this book provides detailed coverage of the theory of transportation networks as a general traffic and transportation discipline. It examines some of the daily difficulties encountered by traffic and transportation experts, uncovering the intricacies of vehicle routing and scheduling, crew planning and facilities placement. This problem-solving approach uses multiple numerical examples and simple mathematical methods to enable newcomers to apply the book?s solutions to the situations they encounter on the job.
Preface. 1 Shortest Paths in Transportation Networks 2. Transportation Network Flows 3. Vehicle Routing Problems on Networks 4. Determining Vehicle Depot Locations
