Optimizing Berth-quay Crane Allocation considering Economic Factors Using Chaotic Quantum SSA

نویسندگان

چکیده

With the regular development of global epidemic, port shipping supply is tight. The problem congestion, soaring freight rates, and hard-to-find container space has emerged. This paper proposes a new joint berth-quay crane allocation model, namely E-B&QC, by taking minimum time in ship, cost extra transportation distance for collector trucks land area port, waiting ships. Then, deficiencies sparrow search algorithm (SSA) are considered solving E-B&QC SSA improved based on three-dimensional Cat chaos mapping quantum computing theory. Chaotic Quantum Sparrow Search Algorithm (CQSSA) proposed, population individual coding rules formulated, also model established. Finally, berth-crane optimization method, namely, E-B&QC-CQSSA, proposed. Subsequently, feasibility superiority proposed solution tested according to actual data small river south medium-sized north. Simulation examples show that can develop different high-quality solutions ports under working conditions, more complex situation significant effect. CQSSA obtain better solution.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...

متن کامل

Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...

متن کامل

A Genetic Algorithm for Berth Allocation and Quay Crane Assignment

Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...

متن کامل

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals

We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...

متن کامل

The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach

This paper considers the combination of berth and crane allocation problems in container terminals. We propose a novel approach based on constraint programming able to model many realistic operational constraints. The costs for berth allocation, crane allocation, time windows, breaks and transition times during gang movements are optimized simultaneously. The model is based on a resource view w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Artificial Intelligence

سال: 2022

ISSN: ['0883-9514', '1087-6545']

DOI: https://doi.org/10.1080/08839514.2022.2073719