Zobrazeno 1 - 10
of 737
pro vyhledávání: '"Berth allocation problem"'
Publikováno v:
International Journal of Computational Intelligence Systems, Vol 17, Iss 1, Pp 1-20 (2024)
Abstract The multi-quay berth allocation problem (MQBAP) is an important problem in the planning of seaside operations (POSO) to find the best berthing solution for all the vessels. In this paper, an efficient method based on equilibrium optimizer (E
Externí odkaz:
https://doaj.org/article/ce50a990f29241b5b3854b67c416267a
Publikováno v:
Frontiers in Energy Research, Vol 12 (2024)
Robust charging schedules for a growing market of battery-electric bus (BEB) fleets are critical to successful adoption. In this paper, we present a BEB charging scheduling framework that considers spatiotemporal schedule constraints, route schedules
Externí odkaz:
https://doaj.org/article/09397d2346ee48e7b368e295eb51b9b8
Publikováno v:
Journal of International Maritime Safety, Environmental Affairs, and Shipping, Vol 8, Iss 4 (2024)
Maritime transportation plays a crucial role in global trade, as evidenced by the vast amount of containerized cargo transported between ports. In the realm of containerized maritime transport, an increasingly critical challenge lies in the efficient
Externí odkaz:
https://doaj.org/article/08931a26b4ee460181f137f435255985
Publikováno v:
Iraqi Journal for Computer Science and Mathematics, Vol 5, Iss 3 (2024)
Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that plays a crucial role in maritime transportation systems. BAP is categorized as non-deterministic polynomial-time hard (NP-hard) problems, that is very toug
Externí odkaz:
https://doaj.org/article/cb365e1c0bd04a54bc33c27309424e27
Publikováno v:
Journal of Marine Science and Engineering, Vol 12, Iss 10, p 1722 (2024)
In this paper, we investigate an online berth allocation problem, where vessels arrive one by one and their information is revealed upon arrival. Our objective is to design online algorithms to minimize the maximum load of all berths (makespan). We f
Externí odkaz:
https://doaj.org/article/63c8fe83df7d4b04891058d894ac98c5
Publikováno v:
Journal of Marine Science and Engineering, Vol 12, Iss 9, p 1567 (2024)
The significant increase in international seaborne trade volumes over the last several years is pushing port operators to improve the efficiency of terminal processes and reduce vessel turnaround time. Toward this direction, this study investigates a
Externí odkaz:
https://doaj.org/article/5e3de08465d44ac691ed3ced9a3facc4
Publikováno v:
Logistics, Vol 8, Iss 2, p 50 (2024)
Background: Improving the performance of marine terminals is one of the major concerns of both researchers and decision-makers in the maritime transportation sector. The problem of container storage planning and the berth allocation problem (BAP) are
Externí odkaz:
https://doaj.org/article/dff230f41584434eb0b3f75068ad2f30
Publikováno v:
Journal of Marine Science and Engineering, Vol 12, Iss 4, p 688 (2024)
This paper delves into the multi-port berth allocation problem (MBAP), enriching the traditional berth allocation problem (BAP) with vessel speed optimization (VSO). In the MBAP, it is assumed that there is cooperation between the port and the shippi
Externí odkaz:
https://doaj.org/article/801173309c0143528fa6147b40ecf7ae
Publikováno v:
Mathematics, Vol 12, Iss 5, p 753 (2024)
The berth allocation problem determining the berthing time and position for incoming vessels in port operations has garnered increased attention within the global transportation network. This study focuses on the berth allocation problem with a conti
Externí odkaz:
https://doaj.org/article/71a8046305cf4c9abc476cb851c8b0a5
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.