نوع مقاله : علمی - پژوهشی
نویسندگان
1 دانش آموخته کارشناسی ارشد، برنامه ریزی حمل و نقل، دانشکده مهندسی عمران، دانشگاه علم و صنعت ایران
2 استادیار گروه برنامه ریزی حمل و نقل، دانشکده مهندسی عمران، دانشگاه علم و صنعت ایران
چکیده
کلیدواژه‌ها
عنوان مقاله [English]
نویسندگان [English]
Seaside operation Planning at container terminals includes three problems; Berth Allocation Problem (BAP), Quay Crane Assignment Problem (QCAP), and Quay Crane Scheduling Problem (QCSP). This paper solves these problems in the two stages integrated manner. BAP and QCAP are represented in a mathematical model and solved with metaheuristic algorithms in the first stage. QCSP is represented in a separate mathematical model and solved with the dynamic programming heuristic algorithm in the second stage. Due to the NP-Hard nature of seaside operation problems, heuristic/metaheuristic algorithms are needed to solve them. In this paper, for the first time, an evolutionary version of the Particle Swarm Optimization (EPSO) algorithm is used to solve seaside operation problems. The performance of EPSO and its output is compared with the initial version of the same algorithm (PSO) and genetic algorithm (GA). The numerical results showing the EPSO algorithm has approximately the same answers as the GA algorithm (with a difference of 1%). However, in terms of runtime, it is faster than the GA algorithm. Compared to the PSO algorithm, about 6% report better responses but slightly slower runtime. The validation of the present article has been done with the real data in both container terminals of Shahid Rajaei port.
کلیدواژه‌ها [English]
)