Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "berth allocation" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Integrating truck arrival management into tactical operation planning at container terminals
Autorzy:
Yang, Z. Z.
Chen, G.
Song, D. P.
Powiązania:
https://bibliotekanauki.pl/articles/258956.pdf
Data publikacji:
2013
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
container terminal
integrated planning
truck arrival management
berth allocation
storage space allocation
Opis:
Truck arrival management (TAM) has been recognized as an effective solution to alleviate the gate congestion at container terminals. To further utilize TAM in improving the overall terminal performance, this study integrates TAM with the other terminal operations at a tactical level. An integrated planning model and a sequential planning model are presented to coordinate the major terminal planning activities, including quayside berth allocation, yard storage space allocation and TAM. A heuristic-based genetic algorithm is developed to solve the models. A range of numerical examinations are performed to compare two planning models. The result shows that: the integrated model can improve the terminal performance significantly from the sequential model alone, particularly when the gate capacity and the yard capacity are relatively low; whereas the sequential model is more efficient than the integrated model in terms of computational time.
Źródło:
Polish Maritime Research; 2013, S 1; 32-46
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic based algorithms to solving multi-quays berth allocation problem with setup time constraints
Autorzy:
Sangsawang, Chatnugrob
Longploypad, Cholthida
Powiązania:
https://bibliotekanauki.pl/articles/2203780.pdf
Data publikacji:
2022
Wydawca:
Wyższa Szkoła Logistyki
Tematy:
Multi-Quay
Berth Allocation Problem
genetic algorithm
Sequence-Dependent Setup Times
problem alokacji miejsc postojowych
algorytm genetyczny
czasy konfiguracji zależne od sekwencji
Opis:
Background: This study focuses on efficient berth planning in multi-purpose terminal composed of multiple quays. A multi-quay berth offers infrastructure, equipment, and services for different types of cargo and vessels to meet the needs of users from various freight markets. Moreover, each berth from any quay can be dedicated for one or two different types of cargo and vessels. To improve port efficiency in terms of reducing the waiting time of ships, this study addresses the Multi-Quay Berth Allocation Problem (MQ-BAP), where discrete berthing layout is considered along with setup time constraints and practical constraints such as time windows and safety distances between ships. Sequence dependent setup times may arise due to the berth can convert from dedicated function to another function according to the variance of cargo demand. This problem was inspired by a real case of a multi-purpose port in Thailand. Methods: To solve the problem, we propose a mixed-integer programming model to find the optimal solutions for small instances. Furthermore, we adapted a metaheuristic solution approach based on Genetic algorithm (GA) to solving the MQ-BAP model in large-scale problem cases. Results: Numerical experiments are carried out on randomly generated instances for multi-purpose terminals to assess the effectiveness of the proposed model and the efficiency of the proposed algorithm. The results show that our proposed GA provides a near-optimal solution by average 4.77% from the optimal and show a higher efficiency over Particle swarm optimization (PSO) and current practice situation, which are first come first serve (FCFS) rule by 1.38% and 5.61%, respectively. Conclusions: We conclude that our proposed GA is an efficient algorithm for near-optimal MQ-BAP with setup time constraint at acceptable of computation time. The computational results reveal that the reliability of the metaheuristics to deal with large instances is very efficient in solving the problem considered.
Źródło:
LogForum; 2022, 18, 4; 505--515
1734-459X
Pojawia się w:
LogForum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Berth Allocation Problem: Formulation and a Tunisian Case Study
Autorzy:
Kallel, Lobna
Benaissa, Ezzedine
Kamoun, Hichem
Benaissa, Mounir
Powiązania:
https://bibliotekanauki.pl/articles/223982.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
container terminals
seaport
Berth Allocation
flow time
scheduling of tasks
Tunisian port of Rades
terminal kontenerowy
port morski
cumowanie
czas przepływu
planowanie zadań
Opis:
This paper examines one of the most important operational problems in seaport terminals, namely the Berth Allocation Problem (BAP) which finds an optimal assignment of ships to the berths that minimize the total waiting time of all ships and reduce congestion in ports. Our problem is to affect and schedule n ships on m berths to minimize the processing time and the waiting time for all the ships in the port. Therefore, ships stay time in the port known by the flow time, while respecting the physical constraints existing at the port (such as the depth of the water berth and the draft of the ship’s water), knowing that each ship can only accommodate one ship at a time. It is as if it was a case of n tasks and m machines in parallel, and we wanted to schedule the passage of different tasks on different machines, knowing that each task can only pass on one machine and that the interruption of the task is not allowed. For example, if a job started on a machine, it will remain on this machine up to its completion. In our case, tasks are ships and machines are berths that are opting to minimize the total flow time and, therefore, to decrease the residence time of all the ships in the port. In a first step, a Mixed Integer Linear Program model is designed to address the BAP with the aim of minimizing the flow time of the ships in the port, our sample can be used for both static and dynamic berth allocation cases. In a second step, this model is illustrated with a real case study in the Tunisian port of Rades and solved by a commercial solver CPLEX. Calculation results are presented and compared with those obtained by port authorities in Radès.
Źródło:
Archives of Transport; 2019, 51, 3; 85-100
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies