Metaheuristics for Maritime Operations

Name: Metaheuristics for Maritime Operations | Volume 1
Brand: Wiley-ISTE
Price: 139.99 EUR
Availability: OnlineOnly

Volume 1

S. Mahdi Homayouni Dalila B. M. M. Fontes(Autor*in)

Wiley-ISTE (Verlag)

1. Auflage

Erschienen am 16. April 2018

240 Seiten

E-Book

PDF mit Adobe-DRM

Systemvoraussetzungen

978-1-119-52266-9 (ISBN)

139,99 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Adobe-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Cover
Half-Title Page
Title Page
Copyright Page
Contents
Introduction
1. A Review of Maritime Operations
1.1. Maritime transportation
1.2. Types of ships and cargo
1.3. Containerization
1.4. Handling equipment in seaports
1.4.1. Quay cranes
1.4.2. Vehicles
1.4.3. Storage equipment
1.5. Optimization of maritime operations
1.6. Conclusion
2. Metaheuristic Algorithms
2.1. Basics of metaheuristics
2.2. Simulated annealing algorithm
2.3. Tabu search algorithm
2.4. Genetic algorithms
2.5. Particle swarm optimization
2.6. Ant colony optimization
2.7. Conclusion
3. Metaheuristics for Ship Operations
3.1. Ship routing problem
3.1.1. Formulation of the tramp SRP
3.1.2. A simple GA for the tramp SRP
3.1.3. An ACO for the liner SRP
3.2. Green maritime transportations
3.2.1. Mathematical formulation of GSRP
3.2.2. A PSO for the GSRP
3.3. Conclusions
4. Optimization of Seaside Operations
4.1. Berth allocation problem
4.1.1. Formulation of the BAP
4.1.2. Representation of the BAP solution
4.1.3. An SA algorithm for the BAP
4.1.4. A bi-objective GA for the BAP
4.2. BAP in bulk seaports
4.2.1. Formulation of the BAP in bulk seaports
4.2.2. SA for the BAP in bulk seaports
4.3. Quay crane scheduling problem
4.3.1. An MILP for the QCSP
4.3.2. Genetic algorithms for the QCSP
4.3.3. Tabu search for the QCSP
4.3.4. Double cycling QCSP
4.4. Integrated berth allocation problem
4.4.1. A parallel GA for the B&CAP
4.4.2. PSO for the B&CAP
4.4.3. A simple hybrid GA for the B&CSP
4.5. Conclusions
5. Problems in Yard Operations
5.1. Storage space allocation problem
5.1.1. Formulation of the SSAP
5.1.2. GA for the SSAP
5.2. Yard crane scheduling
5.2.1. Mathematical formulation of the YCSP
5.2.2. A hybrid TS algorithm for the YCSP
5.3. Intra-terminal transportation
5.3.1. Formulation of the dispatching of multi-load vehicles
5.3.2. A Tabu search for the vehicle routing
5.3.3. Formulation of the vehicle scheduling problem
5.3.4. GA for the vehicle scheduling problem
5.4. Integrated storage space allocation problem
5.4.1. A PSO for integrated SSAP-VSP
5.4.2. GA for the integrated SSAP-VSP and dispatching of YCs
5.5. Integrated scheduling of handling equipment
5.5.1. Mathematical formulation of the 3D scheduling
5.5.2. SA for the 3D scheduling
5.5.3. A GA for the 3D scheduling
5.6. Conclusions
Conclusion
Bibliography
Index
Other titles from iSTE in Computer Engineering
EULA

Systemvoraussetzungen

Als PDF speichern Als Link merken