Professional Documents
Culture Documents
Shipping Case Report
Shipping Case Report
Shipping Case Report
In this shipping optimization study, the objective was to minimize the total number of stops while
fulfilling the demand for container transportation between ports. Five ships with specific routes
and capacities were considered, and the decision of whether to use each ship was taken into account
to save extra charges. After solving the optimization model, the following recommendations were
made:
These recommendations optimize the routes for each ship, minimizing the total number of stops
and efficiently using each ship's capacity. Implementing these suggestions will enhance the
efficiency of container transportation operations, reducing costs and improving overall operational
effectiveness.
Mathematical Model:
Objective:
Decision Variables:
xijk = binary variable indicating whether ship k stops at port i before heading to port j.
Objective Function:
5 5 5
Minimize Z = ∑ ∑ ∑ xijk
k=1 i=1 j=1
Constraints:
5
∑ xijk = 1 ∀i, i = 1,2,3,4,5
k=1
5 5
∑ ∑ dij ∗ xijk ≤ cs ∀k, k = 1,2,3,4,5
i=1 j≠i,j=1
5 5
∑ xjik = ∑ xijk ∀i and k = 1,2,3,4,5
j=1,j≠i j=1,j≠i
Binary Constraint:
xijk = 0 or 1
Constraint 3
from/to A B C D E LHS EQUALITY RHS
A 1 1 1 1 1 1 = 0 0
B 1 1 1 1 1 1 = 0 0
C 1 1 1 1 1 1 = 0 0
D 1 1 1 1 1 1 = 0 0
E 1 1 1 1 1 1 = 0 0
Solver Parameters:
Z 5
Figure 4 Optimal Solution
5 5 5 5
Minimize Z = ∑ ∑ ∑ xijk + ∑ yk
k=1 i=1 j=1 k=1
Updated Constraints:
5 5
∑ ∑ xijk ≥ yk ∀k, k = 1,2,3,4,5
i=1 𝑗=1
5 5
∑ ∑ dij ∗ xijk ≤ cs ∗ yk ∀k, k = 1,2,3,4,5
i=1 j≠i,j=1
Recommendations:
Based on the optimization model, the following recommendations are suggested for each ship's
route and container pickups and deliveries to minimize the total number of stops:
1. Ship 1:
Route: A→ B→ C→ D→ E→ A
1 container at A.
1 container at B.
1 container at C.
2 container at D.
1 container at E.
2. Ship 2:
Route: B → C→ D→ E→A→B
0 container at A.
0 container at B.
1 container at C.
2 container at D.
1 container at E.
3. Ship 3:
Route: C→ D→ E→A→B→ C
1 container at A.
1 container at B.
1 container at C.
2 container at D.
1 container at E.
4. Ship 4:
Route: D→ E→A→B→C→ D
2 container at A.
2 container at B.
1 container at C.
1 container at D.
1 container at E.
5. Ship 5:
Route: E→ A→B→C→D→ E
2 container at A.
2 container at B.
1 container at C.
1 container at D.
1 container at E.
These recommendations optimize the routes for each ship, ensuring that all demand for container