| Description |
1 online resource (234 p.) |
| Series |
Routledge Library Edtions: Global Transport Planning Ser. ; v.19 |
|
Routledge Library Edtions: Global Transport Planning Ser
|
| Contents |
Cover -- Half Title -- Title Page -- Copyright Page -- Original Title Page -- Original Copyright Page -- Table of Contents -- Introduction to the Series -- Preface -- 1 Shortest Paths in Transportation Networks -- 1.1 Introduction -- 1.2 Basic Concepts Behind the Theory of Transportation Networks -- 1.3 Method for Finding the Shortest Path from One Node to all Other Nodes in the Transportation Network -- 1.4 Method for Finding the Shortest Path Between all Pairs of Nodes -- 1.5 Method for Determining Shortest Paths When the Transportation Network Contains Two Types of Branches |
|
1.6 Finding the Shortest Path in a Probabilistic Network -- 1.7 Method for Finding Minimum Spanning Trees -- 2 Transportation Network Flows -- 2.1 Flows on Transportation Networks -- 2.2 Conservation Laws on Transportation Networks -- 2.3 Flows on Transportation Networks with One Source and One Sink -- 2.4 Branch Capacities and Transportation Network Capacities -- 2.5 Algorithm for Finding the Maximum Flow Through a Transportation Network -- 3 Vehicle Routing Problems on Networks -- 3.1 Vehicle Routing on the Network -- 3.2 The Chinese Postman's Problem on a Nonoriented Network |
|
3.3 The Chinese Postman Problem on an Oriented Network -- 3.4 The Travelling Salesman Problem -- 3.5 Designing Optimal Routes for Vehicles Which Must go Through all Nodes of the Transportation Network at Least Once When There are Time Constraints or Vehicle Capacity Constraints -- 3.6 Heuristic Algorithm for the Traveling Salesman Problem -- 3.7 Routing and Scheduling Problems for Several Vehicles on the Transportation Network -- 3.8 Classification of Vehicle Routing and Scheduling Problems on a Transportation Network |
|
3.9 Designing Optimal Routes for a Fleet of Vehicles Which Must Service Every Node on the Transportation Network -- 3.10 The Problem of Routing Several Vehicles When There is Only One Depot -- 3.11 Heuristic ""Sweeping"" Algorithm to Route Vehicles on a Transportation Network When There is One Depot -- 3.12 Heuristic ""Assignment"" Algorithm to Route Vehicles on a Transportation Network When There is One Depot -- 3.13 The Problem of Vehicle Routing When There are Several Depots |
|
3.14 Method to Determine the Minimum Number of Vehicles Needed to Service a Given Schedule on the Transportation Network -- 3.15 Optimal Dispatching Strategy on a Transportation Network After a Schedule Perturbation -- 4 Determining Vehicle Depot Locations -- 4.1 Determining Transportation Network Centers -- 4.2 The Problem of Several Centers -- 4.3 The Median Problem -- 4.4 Algorithm to Determine One Network Median -- 4.5 Algorithm for Finding k Medians -- References -- Index |
| Notes |
Description based upon print version of record |
| Form |
Electronic book
|
| ISBN |
9781000366990 |
|
1000366995 |
|
