Metaheuristics for Maritime Operations

Inbunden, Engelska, 2018

Av S. Mahdi Homayouni, Dalila B. M. M. Fontes, Portugal) Homayouni, S. Mahdi (INESC TEC, Iran) Fontes, Dalila B. M. M. (IAU, S Mahdi Homayouni, Dalila B M M Fontes

2 339 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Metaheuristic Algorithms in Maritime Operations Optimization focuses on the seaside and port side problems regarding the maritime transportation. The book reviews and introduces the most important problems regarding the shipping network design, long-term and short-term scheduling and planning problems in both bulk and container shipping as well as liquid maritime transportation. Application of meta heuristic algorithm is important for these problems, as most of them are hard and time-consuming to be solved optimally.

Produktinformation

Utgivningsdatum2018-03-28
Mått163 x 239 x 20 mm
Vikt476 g
FormatInbunden
SpråkEngelska
Antal sidor240
FörlagISTE Ltd and John Wiley & Sons Inc
ISBN9781786302809

Tillhör följande kategorier

Programmeringsböcker inom Data och it
Transportindustri inom Ekonomi och ledarskap

Introduction ixChapter 1. A Review of Maritime Operations 11.1. Maritime transportation 11.2. Types of ships and cargo 31.3. Containerization 51.4. Handling equipment in seaports 81.4.1. Quay cranes 101.4.2. Vehicles 111.4.3. Storage equipment 131.5. Optimization of maritime operations 151.6. Conclusion 19Chapter 2. Metaheuristic Algorithms 212.1. Basics of metaheuristics 212.2. Simulated annealing algorithm 222.3. Tabu search algorithm 262.4. Genetic algorithms 282.5. Particle swarm optimization 322.6. Ant colony optimization 342.7. Conclusion 37Chapter 3. Metaheuristics for Ship Operations 393.1. Ship routing problem 393.1.1. Formulation of the tramp SRP 423.1.2. A simple GA for the tramp SRP 463.1.3. An ACO for the liner SRP 483.2. Green maritime transportations 513.2.1. Mathematical formulation of GSRP 543.2.2. A PSO for the GSRP 593.3. Conclusions 62Chapter 4. Optimization of Seaside Operations 654.1. Berth allocation problem 654.1.1. Formulation of the BAP 684.1.2. Representation of the BAP solution 704.1.3. An SA algorithm for the BAP 724.1.4. A bi-objective GA for the BAP 744.2. BAP in bulk seaports 764.2.1. Formulation of the BAP in bulk seaports 774.2.2. SA for the BAP in bulk seaports 804.3. Quay crane scheduling problem 824.3.1. An MILP for the QCSP 844.3.2. Genetic algorithms for the QCSP 874.3.3. Tabu search for the QCSP 904.3.4. Double cycling QCSP 924.4. Integrated berth allocation problem 954.4.1. A parallel GA for the B∩ 984.4.2. PSO for the B∩ 1014.4.3. A simple hybrid GA for the B&CSP 1084.5. Conclusions 111Chapter 5. Problems in Yard Operations 1135.1. Storage space allocation problem 1135.1.1. Formulation of the SSAP 1165.1.2. GA for the SSAP 1205.2. Yard crane scheduling 1245.2.1. Mathematical formulation of the YCSP 1265.2.2. A hybrid TS algorithm for the YCSP 1305.3. Intra-terminal transportation 1355.3.1. Formulation of the dispatching of multi-load vehicles 1395.3.2. A Tabu search for the vehicle routing 1425.3.3. Formulation of the vehicle scheduling problem 1475.3.4. GA for the vehicle scheduling problem 1505.4. Integrated storage space allocation problem 1535.4.1. A PSO for integrated SSAP–VSP 1555.4.2. GA for the integrated SSAP–VSP and dispatching of YCs 1585.5. Integrated scheduling of handling equipment 1615.5.1. Mathematical formulation of the 3D scheduling 1635.5.2. SA for the 3D scheduling 1725.5.3. A GA for the 3D scheduling 1765.6. Conclusions 179Conclusion 181Bibliography 185Index 207