0%

Container terminals are constantly being challenged to adjust their throughput capacity to match fluctuating demand. Examining the optimization problems encountered in today's container terminals, Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, Second Edition provides advanced algorithms for handling the s

Table of Contents

  1. Front Cover (1/2)
  2. Front Cover (2/2)
  3. Contents (1/2)
  4. Contents (2/2)
  5. List of Figures
  6. List of Tables
  7. Preface
  8. Acknowledgments
  9. Authors
  10. List of Abbreviations
  11. Chapter 1: Introduction (1/2)
  12. Chapter 1: Introduction (2/2)
  13. Chapter 2: Problems in Container Terminals (1/2)
  14. Chapter 2: Problems in Container Terminals (2/2)
  15. Chapter 3: Formulations of the Problems and Solutions (1/14)
  16. Chapter 3: Formulations of the Problems and Solutions (2/14)
  17. Chapter 3: Formulations of the Problems and Solutions (3/14)
  18. Chapter 3: Formulations of the Problems and Solutions (4/14)
  19. Chapter 3: Formulations of the Problems and Solutions (5/14)
  20. Chapter 3: Formulations of the Problems and Solutions (6/14)
  21. Chapter 3: Formulations of the Problems and Solutions (7/14)
  22. Chapter 3: Formulations of the Problems and Solutions (8/14)
  23. Chapter 3: Formulations of the Problems and Solutions (9/14)
  24. Chapter 3: Formulations of the Problems and Solutions (10/14)
  25. Chapter 3: Formulations of the Problems and Solutions (11/14)
  26. Chapter 3: Formulations of the Problems and Solutions (12/14)
  27. Chapter 3: Formulations of the Problems and Solutions (13/14)
  28. Chapter 3: Formulations of the Problems and Solutions (14/14)
  29. Chapter 4: Vehicle Scheduling: A Minimum Cost Flow Problem (1/4)
  30. Chapter 4: Vehicle Scheduling: A Minimum Cost Flow Problem (2/4)
  31. Chapter 4: Vehicle Scheduling: A Minimum Cost Flow Problem (3/4)
  32. Chapter 4: Vehicle Scheduling: A Minimum Cost Flow Problem (4/4)
  33. Chapter 5: Network Simplex: The Fastest Algorithm (1/6)
  34. Chapter 5: Network Simplex: The Fastest Algorithm (2/6)
  35. Chapter 5: Network Simplex: The Fastest Algorithm (3/6)
  36. Chapter 5: Network Simplex: The Fastest Algorithm (4/6)
  37. Chapter 5: Network Simplex: The Fastest Algorithm (5/6)
  38. Chapter 5: Network Simplex: The Fastest Algorithm (6/6)
  39. Chapter 6: Network Simplex Plus: Complete Advanced Algorithm (1/3)
  40. Chapter 6: Network Simplex Plus: Complete Advanced Algorithm (2/3)
  41. Chapter 6: Network Simplex Plus: Complete Advanced Algorithm (3/3)
  42. Chapter 7: Dynamic Network Simplex: Dynamic Complete Advanced Algorithm (1/5)
  43. Chapter 7: Dynamic Network Simplex: Dynamic Complete Advanced Algorithm (2/5)
  44. Chapter 7: Dynamic Network Simplex: Dynamic Complete Advanced Algorithm (3/5)
  45. Chapter 7: Dynamic Network Simplex: Dynamic Complete Advanced Algorithm (4/5)
  46. Chapter 7: Dynamic Network Simplex: Dynamic Complete Advanced Algorithm (5/5)
  47. Chapter 8: Greedy Vehicle Search: An Incomplete Advanced Algorithm (1/3)
  48. Chapter 8: Greedy Vehicle Search: An Incomplete Advanced Algorithm (2/3)
  49. Chapter 8: Greedy Vehicle Search: An Incomplete Advanced Algorithm (3/3)
  50. Chapter 9: Multi-Load and Heterogeneous Vehicle Scheduling: Hybrid Solutions (1/3)
  51. Chapter 9: Multi-Load and Heterogeneous Vehicle Scheduling: Hybrid Solutions (2/3)
  52. Chapter 9: Multi-Load and Heterogeneous Vehicle Scheduling: Hybrid Solutions (3/3)
  53. Chapter 10: Conclusions and Future Research (1/2)
  54. Chapter 10: Conclusions and Future Research (2/2)
  55. Appendix: Information on Web (1/2)
  56. Appendix: Information on Web (2/2)
  57. References (1/3)
  58. References (2/3)
  59. References (3/3)
  60. Back Cover
18.119.160.154