Buch, Englisch, 252 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1240 g
Buch, Englisch, 252 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1240 g
Reihe: Centre for Research on Transportation
ISBN: 978-0-7923-8161-7
Verlag: Springer US
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Operations Research
- Wirtschaftswissenschaften Wirtschaftssektoren & Branchen Transport- und Verkehrswirtschaft
- Wirtschaftswissenschaften Betriebswirtschaft Unternehmensforschung
- Wirtschaftswissenschaften Volkswirtschaftslehre Volkswirtschaftslehre Allgemein Ökonometrie
- Wirtschaftswissenschaften Volkswirtschaftslehre Internationale Wirtschaft Volkswirtschaften einzelner Länder und Regionen
- Technische Wissenschaften Verkehrstechnik | Transportgewerbe Fahrzeugtechnik
- Wirtschaftswissenschaften Betriebswirtschaft Wirtschaftsmathematik und -statistik
Weitere Infos & Material
1 Exact Solution of the Vehicle Routing Problem.- 1.1 Introduction.- 1.2 Problem Definition and Notation.- 1.3 Basic Reduction Rules.- 1.4 The Asymmetric CVRP.- 1.5 Branch-and-Bound Algorithms for the Symmetric CVRP.- 1.6 Branch-and-Cut Algorithms for the Symmetric CVRP.- 1.7 The Set Partitioning Approach.- 1.8 Conclusions.- References.- 2 Metaheuristics in Vehicle Routing.- 2.1 Introduction.- 2.2 Overview of Three Metaheuristics.- 2.3 Computational Experience.- 2.4 Large-Scale Vehicle Routing Problems.- 2.5 Future Directions in Vehicle Routing Research.- References.- 3 A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems.- 3.1 Introduction.- 3.2 Relations between Time Constrained Problems.- 3.3 A Unified Formulation.- 3.4 Solution Methodology.- 3.5 Conclusion.- References.- 4 The Inventory Routing Problem.- 4.1 Introduction.- 4.2 The Inventory Routing Problem.- 4.3 The Single Customer Problem.- 4.4 The Two-Customer Problem.- 4.5 Solution Approaches.- 4.6 Solution Approaches under Investigation.- 4.7 Practical Issues.- 4.8 Test Problems.- References.- 5 Dynamic Vehicle Routing and Dispatching.- 5.1 Introduction.- 5.2 Dial-a-Ride Problems.- 5.3 Repair and Courier Services.- 5.4 Express Mail Delivery.- 5.5 Concluding Remarks.- References.- 6 On Languages for Dynamic Resource Scheduling Problems.- 6.1 Introduction.- 6.2 The Language of Applications.- 6.3 A Representation Language.- 6.4 A Mathematical Language.- 6.5 A Software Language.- 6.6 A Modeling Process.- References.- 7 Solving Stochastic Routing Problems.- 7.1 Introduction.- 7.2 Formulation.- 7.3 The Integer L-Shaped Method.- 7.4 Implementation and Results.- 7.5 Conclusion.- References.- 8 Crew Scheduling in Air Transportation.- 8.1 Introduction.- 8.2 A Variety of CrewScheduling Problems.- 8.3 A Unified Formulation for Air Crew Scheduling Problems.- 8.4 Solution Methodology.- 8.5 Computational Results.- 8.6 Conclusion.- References.- 9 Path, Tree and Cycle Location.- 9.1 Introduction.- 9.2 Notations and Formulations.- 9.3 Paths with Fixed End Points (Po-d).- 9.4 Paths without Fixed End Points (P).- 9.5 Trees.- 9.6 Cycles with an Origin (Co).- 9.7 Cycles without a Fixed Origin (C).- 9.8 Conclusion.- References.- 10 Parallel Metaheuristics.- 10.1 Introduction.- 10.2 Parallel Metaheuristics.- 10.3 Type 1: Low-Level Parallelization.- 10.4 Type 2: Parallelization by Domain Decomposition.- 10.5 Type 3: Multiple Search Strategies.- 10.6 Conclusions and Perspectives.- References.