scholarly journals Joint Scheduling of Yard Crane, Yard Truck, and Quay Crane for Container Terminal Considering Vessel Stowage Plan: An Integrated Simulation-Based Optimization Approach

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2236
Author(s):  
Hsien-Pin Hsu ◽  
Chia-Nan Wang ◽  
Hsin-Pin Fu ◽  
Thanh-Tuan Dang
Keyword(s):  
Particle Swarm Optimization ◽  
Container Terminal ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Scheduling Problem ◽  
Crane Scheduling ◽  
Swarm Optimization ◽  
Simulation Based ◽  
Simulation Based Optimization ◽  
Stowage Plan

The joint scheduling of quay cranes (QCs), yard cranes (YCs), and yard trucks (YTs) is critical to achieving good overall performance for a container terminal. However, there are only a few such integrated studies. Especially, those who have taken the vessel stowage plan (VSP) into consideration are very rare. The VSP is a plan assigning each container a stowage position in a vessel. It affects the QC operations directly and considerably. Neglecting this plan will cause problems when loading/unloading containers into/from a ship or even congest the YT and YC operations in the upstream. In this research, a framework of simulation-based optimization methods have been proposed firstly. Then, four kinds of heuristics/metaheuristics has been employed in this framework, such as sort-by-bay (SBB), genetic algorithm (GA), particle swarm optimization (PSO), and multiple groups particle swarm optimization (MGPSO), to deal with the yard crane scheduling problem (YCSP), yard truck scheduling problem (YTSP), and quay crane scheduling problem (QCSP) simultaneously for export containers, taking operational constraints into consideration. The objective aims to minimize makespan. Each of the simulation-based optimization methods includes three components, load-balancing heuristic, sequencing method, and simulation model. Experiments have been conducted to investigate the effectiveness of different simulation-based optimization methods. The results show that the MGPSO outperforms the others.

An Improved Discrete Particle Swarm Optimization for Berth Scheduling Problem

2013 ◽  
Vol 373-375 ◽  
pp. 1192-1195
Author(s):  
Dan Hua Huang ◽  
Su Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm Optimization Algorithm ◽  
Container Terminal ◽  
Particle Swarm ◽  
Mathematic Model ◽  
Allocation Rule ◽  
Scheduling Problem ◽  
Discrete Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Berth Scheduling

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.

OPTIMAL PREDICTION AND DESIGN OF SURFACE ROUGHNESS FOR CNC TURNING OF AL7075-T6 BY USING THE TAGUCHI HYBRID QPSO ALGORITHM

2016 ◽  
Vol 40 (5) ◽  
pp. 883-895 ◽  
Author(s):  
Wen-Jong Chen ◽  
Chuan-Kuei Huang ◽  
Qi-Zheng Yang ◽  
Yin-Liang Yang
Keyword(s):  
Surface Roughness ◽  
Particle Swarm Optimization ◽  
Predictive Models ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Cutting Parameters ◽  
Optimization Methods ◽  
Swarm Optimization ◽  
Cnc Turning ◽  
Multi Objective

This paper combines the Taguchi-based response surface methodology (RSM) with a multi-objective hybrid quantum-behaved particle swarm optimization (MOHQPSO) to predict the optimal surface roughness of Al7075-T6 workpiece through a CNC turning machining. First, the Taguchi orthogonal array L27 (36) was applied to determine the crucial cutting parameters: feed rate, tool relief angle, and cutting depth. Subsequently, the RSM was used to construct the predictive models of surface roughness (Ra, Rmax, and Rz). Finally, the MOHQPSO with mutation was used to determine the optimal roughness and cutting conditions. The results show that, compared with the non-optimization, Taguchi and classical multi-objective particle swarm optimization methods (MOPSO), the roughness Ra using MOHQPSO along the Pareto optimal solution are improved by 68.24, 59.31 and 33.80%, respectively. This reveals that the predictive models established can improve the machining quality in CNC turning of Al7075-T6.

scholarly journals Anti-synchronization of discrete-time chaotic systems using optimization algorithms

2011 ◽  
pp. 143-147
Author(s):  
Mahdieh Adeli ◽  
Hassan Zarabadipoor
Keyword(s):  
Particle Swarm Optimization ◽  
Pid Control ◽  
Pid Controller ◽  
Chaotic Systems ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Modified Particle Swarm Optimization

In this paper, anti-synchronization of discrete chaotic system based on optimization algorithms are investigated. Different controllers have been used for anti-synchronization of two identical discrete chaotic systems. A proportional-integral-derivative (PID) control is used and its parameters is tuned by the four optimization algorithms, such as genetic algorithm (GA), particle swarm optimization (PSO), modified particle swarm optimization (MPSO) and improved particle swarm optimization (IPSO). Simulation results of these optimization methods to determine the PID controller parameters to anti-synchronization of two chaotic systems are compared. Numerical results show that the improved particle swarm optimization has the best result.

PERFORMANCE EVALUATION OF PARALLEL GENETIC AND PARTICLE SWARM OPTIMIZATION ALGORITHMS WITHIN THE MULTICORE ARCHITECTURE

2014 ◽  
Vol 13 (04) ◽  
pp. 1450024
Author(s):  
A. S. RADHAMANI ◽  
E. BABURAJ
Keyword(s):  
Particle Swarm Optimization ◽  
Performance Optimization ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Swarm Optimization ◽  
Multicore Architecture ◽  
Bacterial Foraging ◽  
Processor Performance ◽  
Almost All ◽  
Time And Energy

In recent studies we found that there are many optimization methods presented for multicore processor performance optimization, however each method is suffered from limitations. Hence in this paper we presented a new method which is a combination of bacterial Foraging Particle swarm Optimization with certain constraints named as Constraint based Bacterial Foraging Particle Swarm Optimization (CBFPSO) scheduling can be effectively implemented. The proposed Constraint based Bacterial Foraging Particle Swarm Optimization (CBFPSO) scheduling for multicore architecture, which updates the velocity and position by two bacterial behaviours, i.e. reproduction and elimination dispersal. The performance of CBFPSO is compared with the simulation results of GA, and the result shows that the proposed algorithm has pretty good performance on almost all types of cores compared to GA with respect to completion time and energy consumption.

Sign in / Sign up

Export Citation Format

Share Document