Harbor Logistics: Berth Allocation Problem for Inter-Related Terminals
Recommend Documents
Keywords : berth allocation problem, stochastic scheduling, proactive and ... start and end of availability for each machine, consisting in scheduling tasks.
Fossil energy sources, such as coal and oil, were increasingly exploited to .... categories there are chemical tankers, gas tankers, offshore ships, ferry and passenger .... In North America, the port of South Louisiana handles 250 million tonnes ...
berth allocation is applied in this paper by which strategies are evaluated in ... of
computer-based modeling is proposed to evaluate the Berth Allocation ...
BERTH ALLOCATION WITH SERVICE PRIORITY. Akio IMAI. Department of
Transportation and Information Systems Engineering. Kobe University of
Mercantile ...
belonged to different shipping companies without any preferable docking location .... The objective is to get the optimal BAP solution with the minimum vessels ...
Berth Allocation Problem –. A Case Study in Algorithmic Approaches. Leong Hon
Wai,. RAS Research Group, SoC, NUS [email protected]. Content:.
served are already in the port before the planning period starts, or (b) they are scheduled to arrive after the planning ...... Seattle Tacoma. Moorthy, R. and Teo, ...
Oct 6, 2008 - The template used at the operational level is determined at the tactical decision level. ⢠In addition to favourite berthing positions, the concept of ...
Georg-August-Universität Göttingen. Platz der Göttinger ... Ole Björn Brodersen, Leif Meier, Matthias Schumann. 2278 ... type process (Meier and Fischer 2006).
Abstract. The Berth Allocation Problem (BAP) consists on program- ... The
programming and allocation of ships to berths have a primary impact in the
efficiency ...
Requirements for Allocation of Berth. The following conditions are prerequisites
before an application for a berth will be considered: a. Full personal membership
...
Nov 28, 2016 - Considering Service Level Using an Adaptive Differential. Evolution ... Based on the concept of service level which is commonly used in.
routing, berthing time assignment with transshipment option ... terminals to minimize the waiting time of ships or to maximize the utilization of berths. In the. 1 ...
Jul 20, 2006 - that the proposed stochastic beam search is more accurate and efficient than both the .... To build an efficient BAP optimization engine for.
branching rules, is incorporated into a branch and bound algorithm for the berth allocation problem. Real data ... than one berth may process a huge ship and one berth ..... experiment on ten real berth allocation problems in the Baosteel ...
Dec 1, 2014 - To overcome this issue, a robust model and a proactive approach ... assignment problem as a representative example of scheduling problems.
Aug 15, 2012 ... The Berth Allocation Problem (BAP) is one of the most critical and widely ...
allocation problem in bulk ports for hybrid berth layout and dynamic ...
the assignment of berths to arriving container ships at a CT (Container .... interviews that in berth planning, placing the ship closest to the target stack on a ...
the integrated planning of the following problems faced at container terminals:
berth allocation, quay crane assignment (number), and quay crane assignment ...
Sep 9, 2012 - For a terminal this results in a cyclic schedule of calling vessels, with typically ... to an exchange zone (inbound containers) from where they leave the terminal by ..... berth location of center of vessel v â {1,..., V} along the q
Apr 6, 2017 - Journal of Software Engineering and Applications, 2017, 10, 311-323 ... Published: April 6, 2017 ..... various sources including CAD systems.
Abstract Resource allocation problem for local reserve depots in disaster management is consid- ered in this paper. In order to prepare for natural and manmade ...
Jan 23, 2017 - Collaborative logistics network resource allocation can effectively meet the needs of customers. ... and external resources and combine the supply chain system .... programming problems, and genetic algorithm was proposed.
Harbor Logistics: Berth Allocation Problem for Inter-Related Terminals
Jan 22, 2007 ... Harbor Logistics: Berth Allocation Problem for. Inter-Related Terminals. Maarten
Hendriks, Eindhoven University of Technology. January 22nd ...
12 Harbor Logistics: Berth Allocation Problem for Inter-Related Terminals i i
Maarten Hendriks, Eindhoven University of Technology
January 22nd, 2007
JJJNIII
/w
1/8
12
Introduction
BAP for Inter-Related . . . Objective Model Current Issues Similar Problems
Introduction
• Last decades: rapid grow of containerization • Ports need methods to optimize logistics operations
i i
JJJNIII
/w
2/8
12
Introduction
BAP for Inter-Related . . . Objective Model Current Issues Similar Problems
BAP for Inter-Related Terminals
Consider: • Port with a number of terminals • Terminals are inter-connected • Each terminal has a restricted quay length • Each terminal has a restricted number of quay cranes i i
• Each terminal has a restricted storage capacity • Vessels arrive once a week • Vessels need to be unloaded and loaded • Each specific vessel transports its specific containers
JJJNIII
/w
3/8
12
Introduction
BAP for Inter-Related . . . Objective Model Current Issues Similar Problems
Objective
Assign arriving vessels to terminals by trading off: 1. Processing vessels within preferred time window, 2. Balancing the workload among the terminals and among the days, 3. Reducing inter-terminal transport. i i
JJJNIII
/w
4/8
12
Introduction
BAP for Inter-Related . . . Objective Model Current Issues Similar Problems
Model
MILP formulation Binary variables: 1 if in terminal t vessel v arrives during [k , k + 1i, at v (k ) ∈ 0 otherwise. 1 if in terminal t vessel v departs during [k , k + 1i, dt v (k ) ∈ 0 otherwise. 1 if in terminal t vessel v berths during [k , k + 1i, bt v (k ) ∈ 0 otherwise. i
i
JJJNIII
/w
5/8
12
Introduction
BAP for Inter-Related . . . Objective Model Current Issues Similar Problems
Model
Continuous variables: qt v (k ) = Workload assigned in terminal t to vessel v during [k , k + 1i. fprz (k ) = Amount of containers transported from terminal p to terminal r with destination z during [k , k + 1i, p 6 = r. i
i
wt z (k ) = Number of containers in terminal t with destination z during [k , k + 1i.
JJJNIII
/w
6/8
12
Introduction
BAP for Inter-Related . . . Objective Model
Current Issues
Find appropriate heuristics for 1 and 2+3.
Current Issues Similar Problems
1. Berth Allocation vessel to terminal
# cranes to vessel
2. Vessel to specific location in terminal
JJJNIII
i
/w
i
3. Specific cranes to vessel
7/8
12
Introduction
BAP for Inter-Related . . . Objective Model Current Issues Similar Problems
