Abstract
Abstract The objective of this article is to provide an in-depth exploration of the complex task of container storage at seaports, a problem characterized as one of the challenging NP (Non-Deterministic Polynomial time) problems. Seaports are faced with the dilemma of accommodating a finite number of containers due to the constrained surface area available, making the management of container storage operations a formidable task. To address this challenge, the present study leverages a meta-heuristic approach aimed at identifying an optimal storage plan for containers within a storage area. This approach is informed by insights drawn from bat swarm intelligence, commonly known as the Bat Algorithm. By integrating principles from this nature-inspired algorithm, the authors seek to develop a robust solution for optimizing container storage strategies in seaports. This approach takes into account several critical constraints, including container travel distances and considerations related to container type and departure dates.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
