An Improved Discrete Particle Swarm Optimization for Berth Scheduling Problem

Dan Hua Huang; Su Wang

doi:10.4028/www.scientific.net/AMM.373-375.1192

Paper Titles

Software Source Code Plagiarism and Direction Detection Based on PDG
p.1172

An Improved Quantum-Behaved Particle Swarm Optimization Algorithm for the Knapsack Problem
p.1178

Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection
p.1182

Human Action Recognition Based on Hybrid Features
p.1188

An Improved Discrete Particle Swarm Optimization for Berth Scheduling Problem
p.1192

Genetic Algorithm Based Aircraft Spotting Allocation Optimal Scheduling Approach on Carrier Flight Deck
p.1196

A Context-Awareness Based Personalized Recommender System in a Pervasive Application Space
p.1202

Detectability and Locatability of Multiple Gross Errors in DEM Matching Algorithm
p.1208

System Identification of UAV Alap-Alap Using Back Propagation Neural Network
p.1212

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 373-375An Improved Discrete Particle Swarm Optimization...

An Improved Discrete Particle Swarm Optimization for Berth Scheduling Problem

Abstract:

Berth scheduling operation is an important problem in container terminal. The mathematic model of this problem is described in this paper and an improved particle swarm optimization algorithm is introduced to obtain the optimal scheduling solution. A floating-point allocation rule is used to encode the particles in the discrete space. A local search method is combined with PSO to avoid precocity. Finally the experiments are done to prove the improved PSO in this paper can resolve the berth scheduling problem and get better solution and convergence speed than the basic PSO.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 373-375)

Pages:

1192-1195

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.373-375.1192

Citation:

Cite this paper

Online since:

August 2013

Authors:

Dan Hua Huang, Su Wang

Keywords:

Berth Scheduling Problem, Container Terminal, Discrete Optimization, Local Search, Particle Swarm Optimization (PSO)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Lai K K, Shih K. A study of container berth allocation [J]. Journal of Advanced Transportation, 1992, 26: 45-60.

DOI: 10.1002/atr.5670260105

Google Scholar

[2] Etsuko Nishimura, Berth allocation planning in the public berth system by genetic algorithms, European journal of operational research, 2001, 131(2): 282-292.

DOI: 10.1016/s0377-2217(00)00128-4

Google Scholar

[3] HAN Xiaole, LU Zhiqiang, XI Lifeng. Optimization of Discrete Berth Scheduling Problem for Dynamic Arriving Vessels with Service Priority. Journal of Shanghai Jiaotong University, 2009: 902-905.

Google Scholar

[4] Imai A, Nishimura E. Berth allocation at indented berths for mega-containership. European Journal of Operational Research, 2007, 179(2): 579-593.

DOI: 10.1016/j.ejor.2006.03.034

Google Scholar

[5] J Kennedy, R C Eberhart. Particle Swarm Optimization[A], Proceedings of IEEE International Conference on Nerual Networks, NJ. 1995, 1942-(1948).

Google Scholar

[6] Min Yu, Study on Container Berth-Quay Crane Allocation Optimazation Based on Multi-Objective Genetie Algorithm. Dalin Maritime University, Master Dissertation, 2010, 6.

Google Scholar

[7] Shi Y. H, Eberhart R.C. Fuzzy Adaptive Particle Swarm Optimization[A]. Proceedings of Congress on Evolutionary[C]. 2001, 101-106.

Google Scholar