<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    ajibm
   </journal-id>
   <journal-title-group>
    <journal-title>
     American Journal of Industrial and Business Management
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2164-5167
   </issn>
   <issn publication-format="print">
    2164-5175
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/ajibm.2024.1411072
   </article-id>
   <article-id pub-id-type="publisher-id">
    ajibm-137508
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Business 
     </subject>
     <subject>
       Economics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Hub Port Cooperation vs Competition: A Multi-Criteria Approach for Cost, Reliability, and Sustainability in Liner Shipping
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Paulo
      </surname>
      <given-names>
       Correia
      </given-names>
     </name>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Chengji
      </surname>
      <given-names>
       Liang
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aInstitute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai, China
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     12
    </day> 
    <month>
     11
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    14
   </volume> 
   <issue>
    11
   </issue>
   <fpage>
    1435
   </fpage>
   <lpage>
    1453
   </lpage>
   <history>
    <date date-type="received">
     <day>
      3,
     </day>
     <month>
      October
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      18,
     </day>
     <month>
      October
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      18,
     </day>
     <month>
      November
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Efficient logistical services are usually reliable, i.e., they are available when required. However, reliable logistics service is normally inversely proportional to unreliability, implying a cost-tradeoff. Moreover, containerized liner shipping, in particular, relies heavily on port infrastructures and their managerial decision. This paper examines how cooperative vs. competitive strategies between hub ports can affect the design of a logistical network that is cost-effective and reliable. A multi-objective mixed integer nonlinear optimization model is proposed. Numerical experiments were conducted within the West Africa-Europe-South America transatlantic supply chain, focusing on West Africa due to its strategic location (Atlantic shipping crossroads and extensive coastline). The results show that cooperative hubs, whether close or far apart, exhibit a complex interplay between absolute cost performance and marginal efficiency. While hubs nearby achieved superior marginal cost tradeoffs, neither closer nor geographically distant cooperative hubs dominated each other in absolute cost performance. However, the results showcased that competition completely dominates cooperation when hubs are located far apart.
   </abstract>
   <kwd-group> 
    <kwd>
     Liner Shipping
    </kwd> 
    <kwd>
      Hubs Cooperative vs. Competitive Strategy
    </kwd> 
    <kwd>
      Multi-Objective Optimization
    </kwd> 
    <kwd>
      Pareto Front
    </kwd> 
    <kwd>
      Network Design Problem
    </kwd> 
    <kwd>
      West Africa
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>In an increasingly constrained environment characterized by fierce competition, geopolitical and economic uncertainty, and pollution regulations, containerized liner shipping must enhance efficiency to remain competitive. A commonly adopted strategy to mitigate the latter involves consolidating various origin-destination pairs through a transshipment gateway/hub that exploits economies of scale, specifically between hubs. In parallel, the growing market pressure for more reliable logistical services has forced liner shipping to integrate (vertically and horizontally) to gain size and control not only shipping but the entire supply chain activities (<xref ref-type="bibr" rid="scirp.137508-17">
     Rodriguez, Agrell, Manrique-de-Lara-Penate, &amp; Trujillo, 2022
    </xref>). However, the fundamental characteristic of containerized liner shipping is its heavy dependence on port infrastructures and the managerial decisions of port authorities. Empirical literature emphasizes that port cooperation, rather than competition, generates positive spillover effects that benefit the entire port network within a geographical region (<xref ref-type="bibr" rid="scirp.137508-12">
     Li &amp; Oh, 2010
    </xref>). For the West African region (<xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>), many ports have undergone large investment programs to achieve regional hub port status. For example, the African Development Bank Group has financed 60 million EUR to construct a new container terminal at the port of Lomé, which will be used for transshipment and inward goods (<xref ref-type="bibr" rid="scirp.137508-2">
     African Development Bank Group, 2015
    </xref>). Similarly, DP World and the Senegal government agreed on an ambitious 2-phase development project of 1127 billion U$ to reinforce Dakar as a major regional transshipment getaway/hub port to West Africa (<xref ref-type="bibr" rid="scirp.137508-#HYPERLINK  l R08">
     Kherallah, 2020
    </xref>). Moreover, many other potential hubs have undergone similar investment campaigns, see: (<xref ref-type="bibr" rid="scirp.137508-1">
     Africa Container Shipping, 2022
    </xref>). These ports, equipped with adequate infrastructure and strategically located at the Atlantic shipping crossroads between Africa, Europe, and the Americas, share a unique spatial competitive advantage to assume regional hub port status. Such an advantage, however, can easily escalate competition versus cooperation. This, then, justifies the need to better understand how cooperative vs. competitive strategies between hub ports can affect the design of a cost-effective and reliable logistical network in liner shipping. Liner shipping network design encompasses key routing planning decisions and tactical decisions (fleet deployment and scheduling designs). Most of the decisions that must be made by liner shipping at the tactical level in the network design are conflicting. It follows that, providing reliable service at port requires significant capital investment to deploy a certain number of vessels. In parallel, adopting higher vessel speeds has become common in modern consumerism and short life cycle products. Whereas both practices can enhance system reliability, they also increase vessel fuel consumption, emissions, port due costs (pilotage, towage, mooring), and other vessel-related handling costs. Conversely, unreliable service significantly increases shipping time, the associated costs, and customer dissatisfaction. Nonetheless, the existing literature on ports’ competitive versus cooperative strategy usually combines conflicting objectives of liner shipping into one objective, thereby limiting the crucial tradeoff analysis. For example, implementing cooperation between ports may, in fact, worsen at least one key objective in liner shipping, and/or improving environmental objectives may require higher sacrifices in delivery reliability. Indeed, combining these objectives into a single one might wrongly inform the decision-makers. To avoid the latter drawback, this paper proposes a bi-objective mixed integer nonlinear optimization model to minimize liner shipping main production costs. The main costs addressed in the literature are then separated into two conflicting groups, following a similar approach in (<xref ref-type="bibr" rid="scirp.137508-#HYPERLINK  l R05">
     Dulebenets, 2018
    </xref>): costs that usually decrease with time (unreliability costs), and costs that commonly increase with time (reliability costs). The main purpose is to examine how cooperative versus competitive strategies between hubs can affect logistical network design that is both cost-effective and reliable. The cost-tradeoff is assessed using the e-constraint method. The Pareto dominance concept will also be explored, where cooperation between hubs is considered to dominate competition if it is superior in at least one liner shipping objective and as good in another. Conversely, they are considered non-dominant (i.e., implementing cooperation should worsen liner shipping at least one objective). Numerical experiments were conducted for the West Africa-Europe-South America transatlantic supply chain (see <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>). The main focus was placed on the West African region due to its geographical characteristics (extensive coastlines and located at the Atlantic shipping crossroads). Ports in this region offer equal spatial competitive advantages to assume regional hub status, triggering competition or cooperation. Furthermore, the maritime supply chain corridor herein is assumed to be served by a single integrated (vertically and horizontally) container shipping company that transports all West Africa-Europe-South America traffic. The central planner assumption simplifies the analysis, allowing a focused examination of the crucial tradeoff between reliability and unreliability costs at the highest level. The port of Algeciras was selected as the representative port for Europe and the port of Santos for South America. The subsequent part of this paper unfolds as follows: The next section discusses relevant literature. The third section presents the optimization model. The data used in this study is detailed in the fourth section, and the fifth is the solution approach and analysis. Moreover, the final section presents the conclusion of the study.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.137508-"></xref>Figure 1. West African countries, with dots representing operational ports and circles indicating potential hub ports. Source: (<xref ref-type="bibr" rid="scirp.137508-15">
       Nations Online Project, 2023
      </xref>).</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2123455-rId15.jpeg?20241121021501" />
   </fig>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. Example of a West Africa-Europe-South America transatlantic supply chain, illustrating routes under hub port cooperation (red lines) vs. competition (black lines).</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2123455-rId16.jpeg?20241121021501" />
   </fig>
  </sec><sec id="s2">
   <title>2. Literature Review</title>
   <p>Two streams of literature are important to the purpose of this study. 1) liner shipping network design problems; and 2) collaborative versus competitive strategy among ports.</p>
   <p>Liner shipping network design problems encompass key decision-making areas, including routing planning, fleet management, and schedule design. Literature concerning liner routing and scheduling has been reviewed by (<xref ref-type="bibr" rid="scirp.137508-13">
     Meng, Wang, Andersson, &amp; Thun, 2014
    </xref>) with a focus on mathematical model formulations, algorithm design, and assumptions. In addition, studies on containership fleet size, network design (strategic level), service frequency, fleet management, schedule designs (tactical level), and container booking and routing and ship rescheduling (operational level) were thoroughly revised. The study further identifies key areas for research, including but not limited to delivery reliability and environmental sustainability.</p>
   <p>The liner shipping decisions, made at tactical or operational levels, often conflict, as discussed earlier. However, most conventional models in the literature typically combine the conflicting objectives into a single one, with only a few attempts to capture the conflicting nature between the liner’s main production costs, and they will be revised here.</p>
   <p>
    <xref ref-type="bibr" rid="scirp.137508-5">
     Dulebenets (2018)
    </xref> Proposed a global multi-objective optimization algorithm based on the e-constraints method to solve the conflicting vessel schedule (tactical level) problems. Numerical experiments were conducted for the Asia-Mediterranean liner shipping route. Results of sensitive analysis reveal that vessel schedules are more sensitive to a unit fuel cost change than unit emission cost. <xref ref-type="bibr" rid="scirp.137508-17">
     Rodriguez, Agrell, Manrique-de-Lara-Penate, &amp; Trujillo (2022)
    </xref> proposes a bi-objective based on a weighting method for fleet deployment cost (tactical decisions), time, and emissions. The authors aimed to find a tradeoff between pure cost and time minimizations and cost and emissions. They highlighted that cost reductions could be attained through an increase in transportation time/cost. <xref ref-type="bibr" rid="scirp.137508-21">
     Wen, Chen, Yin, Lau, &amp; Dulebenets (2024)
    </xref> proposed a multi-objective for green shipping scheduling (tactical decisions) to minimize costs, carbon emissions, and service unreliability. Results indicated that congested port’s effects on service unreliability are greater than additional costs and emissions. <xref ref-type="bibr" rid="scirp.137508-7">
     Elmi et al. (2023)
    </xref> focused on the vessel schedule recovery problem and proposed a multi-objective model based on an e-constraint method aimed to minimize the total ships late arrival cost and minimize total profit loss in a potentially disruptive event at the port. Numerical experiments were conducted for the Europe-Pakistan-India shipping route. The results indicated that the model proposed is able to generate Pareto sets in a timely manner.</p>
   <sec id="s2_1">
    <title>Ports Cooperative vs Competitive Strategy</title>
    <p>Ports along the same extensive geographical coastlines may equally share opportunities to become regional hub ports, thereby intensifying competition to attract customers. However, cooperation is a significant strategy to enhance overall port competitiveness and crowd out competitors/competitions. The primary rationale is that cooperation between ports can facilitate and enhance integrations within the supply chain network, mitigate disruptions, alleviate congestions, provide greater flexibility in the liner routing planning, resulting in cost reductions, and stimulate regional economic growth (<xref ref-type="bibr" rid="scirp.137508-#HYPERLINK  l R11">
      Lezhnina &amp; Balykina, 2021
     </xref>). For example, (<xref ref-type="bibr" rid="scirp.137508-14">
      Munim &amp; Haralambides, 2018
     </xref>) studied competition and cooperation for intermodal container transshipment between Bangladesh and Indian ports. A mixed integer linear optimization model was proposed for port user cost reductions and port transshipment revenue. Numerical experiments showcased that port users could highly benefit from cooperation in terms of cost reductions. Similarly, (<xref ref-type="bibr" rid="scirp.137508-19">
      Trujillo, Campos, &amp; Pérez, 2018
     </xref>) developed a case study for Chile cooperative versus competitive strategy between neighboring ports and concluded that cooperation would lead to growth. (<xref ref-type="bibr" rid="scirp.137508-12">
      Li &amp; Oh, 2010
     </xref>) research competition versus collaborations between Shanghai Port and Ningbo-Zhoushan Port. The results suggested that the two ports should avoid competition to generate positive spillover effects for the entire port network within the Yangtze River Delta region. For a similar study, refer to: (<xref ref-type="bibr" rid="scirp.137508-18">
      Saeed &amp; Larsen, 2010
     </xref>).</p>
    <p>Studies focused on port cooperative vs competitive strategy have not evaluated their effects on conflicting objectives in liner shipping, which, in turn, causes limitations in the analysis of crucial tradeoffs. Further research is required on how cooperative vs. competitive strategies between hubs can affect the design of a logistical network that is cost-effective and reliable throughout the West Africa-Europe-South America transatlantic supply chain. Therefore, although the existing literature offers valuable practical managerial insights, it cannot directly be used to inform stakeholders within this paper study area. Thus, this study contributes to both literature and supply chain management practice.</p>
   </sec>
  </sec><sec id="s3">
   <title>3. Optimization Model</title>
   <p>The study proposes a mixed integer nonlinear mathematical model to minimize liner shipping main weekly route production costs addressed in the literature and separate them into two conflicting groups: Z<sub>1</sub>-costs that typically decrease with time: 1) port due cost (PDC), 2) vessel emission cost in the sea (VEC), 3) vessel fuel consumption cost (VFC), 4) terminal handling cost (THC) (as a weighting cost), and Z<sub>2</sub>-costs that commonly increases with time; 5) vessel daily charter and operating cost (VOC), 6) container lease cost in sea as well as at ports (Clease), 7) cos of inventory in sea as well as at ports (CINV); 8) vessel late arrival cost (LAC); 9) vessel handling cost at ports (VHC). All the formulas used to compute each cost component for each objective were adapted from (<xref ref-type="bibr" rid="scirp.137508-4">
     Correia &amp; Chengji, 2024
    </xref>).</p>
   <p>Nomenclature</p>
   <p>Sets</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mi>
           p 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> set of port of call;</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> set of available ship’s (ship types);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mi>
         p 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          2 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             H 
           </mi> 
           <mi>
             p 
           </mi> 
          </msub> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> set of hub port.</p>
   <p>Binary variable</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math> if ship of type k navigates the shipping leg from port i to j, (= 0 otherwise).</p>
   <p>Auxiliary variables</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> arrival time (hr.) of ship k at pot i;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         w 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> travel time (hr.) on the sip leg from port i to j with ship k;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mi>
        l 
      </mi> 
      <msub> 
       <mi>
         h 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math> late arrival time of a ship of type k at the hub port h;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         z 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math> if ship of type k navigates the shipping leg from port i to j, (=0 otherwise).</p>
   <p>Parameters</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math> quantity of available ship’s;</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        d 
      </mi> 
      <mi>
        i 
      </mi> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> distance in the shipping leg from port i to j (nmi);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> transshipment time at the hub port h;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         V 
       </mi> 
       <mrow> 
        <mi>
          r 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> ship sailing speed (knots);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <msub> 
       <mi>
         L 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math> slope for the equation of simple linear regression to approximate the port due cost/vessel handling costs at port i;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mi>
         j 
       </mi> 
      </msub> 
     </mrow> 
    </math> intercept for the equation of simple linear regression to approximate the port due cost/vessel handling costs at port i;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math> port time at port i (hr./day);</p>
   <p>Q total amount of containers (TEU);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mi>
         j 
       </mi> 
      </msub> 
     </mrow> 
    </math> weekly amount of container loaded at port i (TEU);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        e 
      </mi> 
      <mi>
        f 
      </mi> 
     </mrow> 
    </math> ship emission factor at sea (tons of emissions per ton of fuel);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        e 
      </mi> 
      <mi>
        c 
      </mi> 
      <mi>
        p 
      </mi> 
     </mrow> 
    </math> unit cost of emission (USD per ton);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        f 
      </mi> 
      <mi>
        p 
      </mi> 
     </mrow> 
    </math> fuel price (USD);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        l 
      </mi> 
      <mi>
        c 
      </mi> 
     </mrow> 
    </math> late arrival cost (USD/hour);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         c 
       </mi> 
       <mi>
         i 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          d 
        </mi> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math> container handling cost at port i (USD/TEU);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        C 
      </mi> 
      <mi>
        a 
      </mi> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math> total carrying capacity of a ship of type k (tons);</p>
   <p>LOA vessel length overall;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <munder accentunder="true"> 
         <mi>
           n 
         </mi> 
         <mo stretchy="true">
           _ 
         </mo> 
        </munder> 
       </mrow> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math> fuel consumption function coefficients;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> capital cost parameter (USD);</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> factor modeling the effect of economies of scale due the vessel size, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mn>
        0 
      </mn> 
      <mo>
        &lt; 
      </mo> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        ≤ 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         c 
       </mi> 
       <mi>
         r 
       </mi> 
       <mrow> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math> unit rent cost for each container (USD/hour);</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        v 
      </mi> 
      <mi>
        f 
      </mi> 
      <mi>
        c 
      </mi> 
     </mrow> 
    </math> vessel fuel consumption;</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          v 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </msup> 
     </mrow> 
    </math> the unit inventory cost (USD/hour.</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           Z 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mi>
              S 
            </mi> 
            <msub> 
             <mi>
               L 
             </mi> 
             <mi>
               j 
             </mi> 
            </msub> 
            <mo>
              ∗ 
            </mo> 
            <mi>
              C 
            </mi> 
            <mi>
              a 
            </mi> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mi>
               k 
             </mi> 
            </msub> 
            <mo>
              + 
            </mo> 
            <mi>
              i 
            </mi> 
            <msub> 
             <mi>
               n 
             </mi> 
             <mi>
               j 
             </mi> 
            </msub> 
            <mo>
              ∗ 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
              <mi>
                k 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mi>
               j 
             </mi> 
            </msub> 
            <mo>
              ∗ 
            </mo> 
            <msubsup> 
             <mi>
               c 
             </mi> 
             <mi>
               j 
             </mi> 
             <mrow> 
              <mi>
                h 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                n 
              </mi> 
              <mi>
                d 
              </mi> 
             </mrow> 
            </msubsup> 
            <mo>
              ∗ 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
              <mi>
                k 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
        </mstyle> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             k 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             K 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               j 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               P 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               j 
             </mi> 
             <mo>
               ≠ 
             </mo> 
             <mi>
               i 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               j 
             </mi> 
             <mo>
               ≠ 
             </mo> 
             <mi>
               h 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
              <mi>
                k 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              ⋅ 
            </mo> 
            <msubsup> 
             <mi>
               c 
             </mi> 
             <mi>
               h 
             </mi> 
             <mrow> 
              <mi>
                h 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                n 
              </mi> 
              <mi>
                d 
              </mi> 
             </mrow> 
            </msubsup> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                e 
              </mi> 
              <mi>
                f 
              </mi> 
              <mo>
                ∗ 
              </mo> 
              <mi>
                e 
              </mi> 
              <mi>
                c 
              </mi> 
              <mi>
                p 
              </mi> 
              <mo>
                ∗ 
              </mo> 
              <mi>
                d 
              </mi> 
              <mi>
                i 
              </mi> 
              <msub> 
               <mi>
                 s 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  j 
                </mi> 
               </mrow> 
              </msub> 
              <mo>
                ∗ 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  j 
                </mi> 
                <mi>
                  k 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
            <mi>
              v 
            </mi> 
            <mi>
              f 
            </mi> 
            <mi>
              c 
            </mi> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                f 
              </mi> 
              <mi>
                p 
              </mi> 
              <mo>
                ∗ 
              </mo> 
              <mi>
                d 
              </mi> 
              <mi>
                i 
              </mi> 
              <msub> 
               <mi>
                 s 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  j 
                </mi> 
               </mrow> 
              </msub> 
              <mo>
                ∗ 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  j 
                </mi> 
                <mi>
                  k 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
            <mi>
              v 
            </mi> 
            <mi>
              f 
            </mi> 
            <mi>
              c 
            </mi> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math></p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           Z 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mfrac> 
             <mrow> 
              <msub> 
               <mi>
                 α 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
              <mo>
                ∗ 
              </mo> 
              <mi>
                C 
              </mi> 
              <mi>
                a 
              </mi> 
              <msubsup> 
               <mi>
                 p 
               </mi> 
               <mi>
                 k 
               </mi> 
               <mrow> 
                <msub> 
                 <mi>
                   α 
                 </mi> 
                 <mn>
                   2 
                 </mn> 
                </msub> 
               </mrow> 
              </msubsup> 
             </mrow> 
             <mrow> 
              <mn>
                24 
              </mn> 
             </mrow> 
            </mfrac> 
            <mo>
              ∗ 
            </mo> 
            <msub> 
             <mi>
               w 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
              <mi>
                k 
              </mi> 
              <mo>
                + 
              </mo> 
              <mi>
                t 
              </mi> 
              <msub> 
               <mi>
                 c 
               </mi> 
               <mrow> 
                <mi>
                  h 
                </mi> 
                <mi>
                  k 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
            </msub> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mfrac> 
             <mrow> 
              <msubsup> 
               <mi>
                 c 
               </mi> 
               <mi>
                 r 
               </mi> 
               <mrow> 
                <mi>
                  l 
                </mi> 
                <mi>
                  e 
                </mi> 
                <mi>
                  a 
                </mi> 
                <mi>
                  s 
                </mi> 
                <mi>
                  e 
                </mi> 
               </mrow> 
              </msubsup> 
             </mrow> 
             <mrow> 
              <mn>
                24 
              </mn> 
             </mrow> 
            </mfrac> 
            <mo>
              ∗ 
            </mo> 
            <msub> 
             <mi>
               w 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
              <mi>
                k 
              </mi> 
              <mo>
                + 
              </mo> 
              <mi>
                t 
              </mi> 
              <msub> 
               <mi>
                 c 
               </mi> 
               <mrow> 
                <mi>
                  h 
                </mi> 
                <mi>
                  k 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
            </msub> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <msup> 
             <mi>
               c 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                v 
              </mi> 
              <mi>
                t 
              </mi> 
             </mrow> 
            </msup> 
            <mo>
              ∗ 
            </mo> 
            <msub> 
             <mi>
               w 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
              <mi>
                k 
              </mi> 
              <mo>
                + 
              </mo> 
              <mi>
                t 
              </mi> 
              <msub> 
               <mi>
                 c 
               </mi> 
               <mrow> 
                <mi>
                  h 
                </mi> 
                <mi>
                  k 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
            </msub> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             k 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             K 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              c 
            </mi> 
            <mo>
              ∗ 
            </mo> 
            <mi>
              t 
            </mi> 
            <mi>
              l 
            </mi> 
            <msub> 
             <mi>
               h 
             </mi> 
             <mi>
               k 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mstyle> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <msub> 
            <mo>
              ∑ 
            </mo> 
            <mrow> 
             <mi>
               k 
             </mi> 
             <mo>
               ∈ 
             </mo> 
             <mi>
               K 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mi>
              S 
            </mi> 
            <msub> 
             <mi>
               L 
             </mi> 
             <mi>
               j 
             </mi> 
            </msub> 
            <mo>
              ∗ 
            </mo> 
            <mi>
              L 
            </mi> 
            <mi>
              O 
            </mi> 
            <msub> 
             <mi>
               A 
             </mi> 
             <mi>
               k 
             </mi> 
            </msub> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mstyle> 
        <mo>
          + 
        </mo> 
        <mi>
          i 
        </mi> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mi>
           j 
         </mi> 
        </msub> 
        <mo>
          ∗ 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math></p>
   <p>St.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        ≤ 
      </mo> 
      <msub> 
       <mi>
         e 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> (1)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        ≤ 
      </mo> 
      <msub> 
       <mi>
         e 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> (2)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           h 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           H 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             P 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mstyle> 
       </mrow> 
      </mstyle> 
      <mo>
        ≤ 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math> (3)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             k 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             K 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mstyle> 
       </mrow> 
      </mstyle> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        i 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ≠ 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math> (4)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        − 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ≠ 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math> (5)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        ⋅ 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           ≠ 
         </mo> 
         <mi>
           i 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           ≠ 
         </mo> 
         <mi>
           h 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        ≤ 
      </mo> 
      <mi>
        C 
      </mi> 
      <mi>
        a 
      </mi> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math> (6)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        ⋅ 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           ≠ 
         </mo> 
         <mi>
           i 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           ≠ 
         </mo> 
         <mi>
           h 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        ≤ 
      </mo> 
      <mi>
        C 
      </mi> 
      <mi>
        a 
      </mi> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        + 
      </mo> 
      <mi>
        M 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mrow> 
          <mi>
            h 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (7)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           k 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           K 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           Y 
         </mi> 
         <mrow> 
          <mi>
            h 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </mstyle> 
      <mo>
        ≥ 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        j 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math> (8)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mrow> 
           <mi>
             k 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <mi>
             K 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mi>
             j 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mrow> 
            <mi>
              h 
            </mi> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mstyle> 
       </mrow> 
      </mstyle> 
      <mo>
        ≥ 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mi>
           j 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> (9)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ≥ 
      </mo> 
      <mn>
        168 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math> (10)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <mi>
        l 
      </mi> 
      <msub> 
       <mi>
         h 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        ≥ 
      </mo> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        − 
      </mo> 
      <mn>
        168 
      </mn> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        h 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mi>
         p 
       </mi> 
      </msub> 
     </mrow> 
    </math> (11)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        + 
      </mo> 
      <mi>
        P 
      </mi> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        + 
      </mo> 
      <mi>
        d 
      </mi> 
      <mi>
        i 
      </mi> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ∗ 
      </mo> 
      <mfrac> 
       <mn>
         1 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            r 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <msup> 
         <mrow></mrow> 
         <mo> 
         </mo> 
        </msup> 
       </mrow> 
      </mfrac> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ≤ 
      </mo> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        j 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ≠ 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ≠ 
      </mo> 
      <mi>
        h 
      </mi> 
     </mrow> 
    </math> (12)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           M 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ≥ 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ∗ 
        </mo> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           M 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             z 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          ∀ 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <mi>
          K 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <mi>
          P 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          ≠ 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          ≠ 
        </mo> 
        <mi>
          h 
        </mi> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math> (13)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           M 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ≥ 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mrow> 
            <mi>
              h 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            ∗ 
          </mo> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           M 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             z 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          ∀ 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <mi>
          K 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <mi>
          P 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          h 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <msub> 
         <mi>
           H 
         </mi> 
         <mi>
           p 
         </mi> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          ≠ 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          j 
        </mi> 
        <mo>
          ≠ 
        </mo> 
        <mi>
          h 
        </mi> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math> (14)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ≤ 
      </mo> 
      <msub> 
       <mi>
         z 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        j 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ≠ 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math> (15)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ≥ 
      </mo> 
      <msub> 
       <mi>
         z 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        − 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        j 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        ≠ 
      </mo> 
      <mi>
        j 
      </mi> 
     </mrow> 
    </math> (16)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         y 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        K 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        j 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        P 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        h 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mi>
         p 
       </mi> 
      </msub> 
     </mrow> 
    </math> (17)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         V 
       </mi> 
       <mrow> 
        <mi>
          r 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mi>
        Q 
      </mi> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mi>
         j 
       </mi> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        N 
      </mi> 
     </mrow> 
    </math> (18)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        l 
      </mi> 
      <mi>
        c 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        e 
      </mi> 
      <mi>
        f 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        d 
      </mi> 
      <mi>
        i 
      </mi> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        , 
      </mo> 
      <mi>
        t 
      </mi> 
      <mi>
        l 
      </mi> 
      <msub> 
       <mi>
         h 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        , 
      </mo> 
      <mi>
        P 
      </mi> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        , 
      </mo> 
      <mi>
        t 
      </mi> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        , 
      </mo> 
      <mi>
        e 
      </mi> 
      <mi>
        c 
      </mi> 
      <mi>
        p 
      </mi> 
      <mo>
        , 
      </mo> 
      <msubsup> 
       <mi>
         c 
       </mi> 
       <mi>
         j 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          d 
        </mi> 
       </mrow> 
      </msubsup> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         w 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        , 
      </mo> 
      <mi>
        s 
      </mi> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         j 
       </mi> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <msup> 
       <mi>
         R 
       </mi> 
       <mo>
         + 
       </mo> 
      </msup> 
     </mrow> 
    </math> (19)</p>
   <p>Constraints 1 and 2 bound the objective functions to an epsilon value whenever at least one objective is being solved, and the other is regarded as a constraint. Constraints set 2 - 5 are commonly used to generate the vessel’s shortest path. Constraints set 6 - 7 are the vessel capacity constraints, ensuring the number of containers transported will be at most the vessel capacity. Constraint 8 limits the number of vessels in the main route, while constraint 9 ensures that all the cargo is delivered to its final destination. Constraint 10 defines the time window constraint, where 168 refers to the hours in one week. Constraint 11 is a late array. Constraints set 12 - 16 compute the vessel transit time, and the parameter (TEU/time) expresses the product of the total number of containers on board times the total sailing time in a path. Given that the sailing time between origin-destination in this study area does not take more than 8 weeks, the strict bounds for 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> can be estimated as follows: 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        8 
      </mn> 
     </mrow> 
    </math> weeks*168/h week, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         M 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        ∗ 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           P 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mi>
           j 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math>. The constraints set 17 - 19 demonstrate the nature of parameters and variables.</p>
  </sec><sec id="s4">
   <title>4. Data Specifications</title>
   <p>For the purpose of analysis, real port and market data were collected from various sources, including previous literature, port authorities, and statistical agencies. The container trade volume (TEU) between origin-destination pairs, the port dues costs, the container handling charges, and port time were retrieved from (<xref ref-type="bibr" rid="scirp.137508-4">
     Correia &amp; Chengji, 2024
    </xref>); see <xref ref-type="table" rid="tableA1">
     Table A1
    </xref>, <xref ref-type="table" rid="tableA2">
     Table A2
    </xref> &amp; <xref ref-type="table" rid="tableA3">
     Table A3
    </xref> (Appendix A). The vessel handling cost (berth) was obtained from the port authority, whereas the vessel information (TEU, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        G 
      </mi> 
      <msub> 
       <mi>
         t 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math>—gross tonnage, LOA—length overall, and speed) was obtained from the Marine Traffic and Hapag-Lloyd websites, and the vessels parameters, such as 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         a 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         g 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
     </mrow> 
    </math> were estimated following (<xref ref-type="bibr" rid="scirp.137508-10">
     Koza, 2019
    </xref>; <xref ref-type="bibr" rid="scirp.137508-4">
     Correia &amp; Chengji, 2024
    </xref>) as displayed in <xref ref-type="table" rid="tableA4">
     Table A4
    </xref> (see Appendix A). The nautical distance (nmi) between the respective ports was obtained from searates. Furthermore, The late arrival cost parameter is set at 5000 US$/hr., the emission cost parameter at 32 US$, the emission factor at sea is set at 3.114, while fuel consumptions coefficients is set at— 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        0.012 
      </mn> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <munder accentunder="true"> 
         <mi>
           n 
         </mi> 
         <mo stretchy="true">
           _ 
         </mo> 
        </munder> 
       </mrow> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        3.0 
      </mn> 
     </mrow> 
    </math>, the inventory cost was set to- 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          v 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </msup> 
      <mo>
        = 
      </mo> 
      <mn>
        0.25 
      </mn> 
     </mrow> 
    </math> US$/hour/TEU, following (<xref ref-type="bibr" rid="scirp.137508-16">
     Pasha, et al., 2022
    </xref>; <xref ref-type="bibr" rid="scirp.137508-17">
     Rodriguez, Agrell, Manrique-de-Lara-Penate, &amp; Trujillo, 2022
    </xref>). The fuel price is assumed to be 484 US$ per ton, and the vessel charter cost parameter (USD) for the vessels daily charter and operating costs is set as follows— 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> is set at 300 US$/day· 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mrow> 
        <mtext>
          ton 
        </mtext> 
       </mrow> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        0.6257 
      </mn> 
     </mrow> 
    </math>, moreover the container lease cost is set at US$4.5/TEU/day following (<xref ref-type="bibr" rid="scirp.137508-20">
     Tu, Adiputranto, Fu, &amp; Li, 2018
    </xref>; <xref ref-type="bibr" rid="scirp.137508-9">
     Kim, Lam, &amp; Lee, 2018
    </xref>; <xref ref-type="bibr" rid="scirp.137508-4">
     Correia &amp; Chengji, 2024
    </xref>).</p>
   <p>The average transshipment time is set as follows, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        t 
      </mi> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <mo>
          ∑ 
        </mo> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </mfrac> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo>
        ∀ 
      </mo> 
      <mi>
        h 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <msub> 
       <mi>
         H 
       </mi> 
       <mi>
         p 
       </mi> 
      </msub> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        h 
      </mi> 
      <mi>
        t 
      </mi> 
     </mrow> 
    </math>—is the average container handling productivity at hub port assumed to be [75; 100; 120; 130] TEU/hr.</p>
  </sec><sec id="s5">
   <title>5. Solutions Approach and Analysis</title>
   <p>Since the proposed model is bi-objective, there exists a set of optimal solutions that constitute the pareto front. In the context of multi-objective optimization, the Pareto Front represents a set of non-dominant solutions, where improving one objective can only be accomplished at the expense of worsening the other objectives. Several techniques have been suggested to solve multi-objective and constitute the Pareto Front. This study adopted the epsilon constraint method to address the proposed bi-objective problem due to its effectiveness in handling real-world non-convex functions. Specifically, one objective is treated as the primary objective while the other is designated as a constraint.</p>
   <p>Furthermore, the Pareto Front is constructed by adjusting the epsilon value on the constrained objective. This, then, requires a priori that the epsilon upper bound interval is determined as follows: 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        e 
      </mi> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msub> 
         <mi>
           Z 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          − 
        </mo> 
        <msubsup> 
         <mi>
           Z 
         </mi> 
         <mn>
           2 
         </mn> 
         <mo>
           * 
         </mo> 
        </msubsup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             Z 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mi>
          n 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          f 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </mfrac> 
     </mrow> 
    </math>; S.t. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
       <mo>
         * 
       </mo> 
      </msubsup> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           Z 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the optimal value of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> when ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>) is regarded as a constraint, and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the value of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> for optimal 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mi>
        p 
      </mi> 
      <mi>
        f 
      </mi> 
     </mrow> 
    </math>—is the desired number of Pareto Front. Both objective functions in this study are modeled as mixed-integer nonlinear and non-convex problems. Given the complexity and the need for optimal solutions in real-world scenarios involving 12 ports, ensuring optimality is crucial for effective managerial decision-making. To achieve this, this study opted to use a commercial mixed-integer programming solver (CPLEX) specifically designed to guarantee optimality. As a result, heuristic or approximate algorithms were not applied, as they may not provide optimal solutions (<xref ref-type="bibr" rid="scirp.137508-#HYPERLINK  l R05">
     Dulebenets, 2018
    </xref>). The dual objective gap tolerance was set to default. The computation time varies at the corner points of the Pareto Front and across different instances of problems, organized as follows: 1) a single hub port of Dakar is placed within the West African region (HSN); 2) two cooperative hub port are placed and located closed together (hub port of Dakar and Banjul—HSNP); 3) Two cooperative hubs are placed and located farther apart, (hub port of Dakar and Abidjan—HSNA); For a cooperative agreement between two hubs, the transshipment handling cost was standardized as follows: 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        T 
      </mi> 
      <mi>
        H 
      </mi> 
      <msub> 
       <mi>
         C 
       </mi> 
       <mi>
         h 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msubsup> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            h 
          </mi> 
          <mo>
            ∈ 
          </mo> 
          <msub> 
           <mi>
             H 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mrow> 
          <mi>
            h 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            d 
          </mi> 
         </mrow> 
        </msubsup> 
        <mo>
          + 
        </mo> 
        <msubsup> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            h 
          </mi> 
          <mo>
            ∈ 
          </mo> 
          <msub> 
           <mi>
             H 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mrow> 
          <mi>
            h 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            d 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </mfrac> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <msub> 
         <mi>
           H 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          d 
        </mi> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         c 
       </mi> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <msub> 
         <mi>
           H 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mrow> 
        <mi>
          h 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          d 
        </mi> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math> is the container handling charge at hub port 1 and 2. Furthermore, port due costs (pilotage, towage, mooring) and transshipment handling time are assumed to be the same under the cooperative strategy. For hubs located close together, the cooperation is at the regional level, and only one acts as a getaway. The reason behind these assumptions is that both cooperative hubs located farther apart are larger hub ports with enough capacity to handle higher vessels, negating the need for just one to act as a getaway. Conversely, for hub ports close together, only one (Dakar) has adequate infrastructure for larger vessels. However, a sensitivity analysis is conducted to account for the change in the levels of cooperation: 1) hub ports cooperating only in transshipment costs; 2) both cooperative hubs located close together acting as getaways.</p>
   <p>The selections for the hub ports of Abidjan and Dakar are based on the empirical literature, indicating them as the best locations for a hub port within the West African region (<xref ref-type="bibr" rid="scirp.137508-6">
     Dyck &amp; Ismael, 2015
    </xref>; <xref ref-type="bibr" rid="scirp.137508-4">
     Correia &amp; Chengji, 2024
    </xref>). In contrast, the port of Banjul is due to its proximity (90.49/nmi apart from Dakar). <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref> shows the obtained set of non-dominant solutions, whereas <xref ref-type="table" rid="table1">
     Table 1
    </xref> illustrates the results at the corner points of the Pareto Front. that is, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
       <mo>
         * 
       </mo> 
      </msubsup> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           Z 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>—the optimal value of the objective function ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>), its costs components, and the value of the objective function ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math>) for optimal ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>). similarly, corner point 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
       <mo>
         * 
       </mo> 
      </msubsup> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           Z 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>—the optimal value of the objective function ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math>), its costs components, the value of the objective function ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>) for optimal ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math>), and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         R 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
     </mrow> 
    </math>, probability that a system will operate without failure in a given period of time t, under specific operational conditions: 1) scenarios, hub ports cooperation vs. competition; 2) data used in this paper. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         R 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        − 
      </mo> 
      <msup> 
       <mtext>
         e 
       </mtext> 
       <mrow> 
        <mo>
          − 
        </mo> 
        <mi>
          λ 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       λ 
     </mi> 
    </math> is the failure rate, t is the time of interest, and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        λ 
      </mi> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <mtext>
          number 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          of 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          failures 
        </mtext> 
       </mrow> 
       <mrow> 
        <mtext>
          total 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          operating 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          hours 
        </mtext> 
       </mrow> 
      </mfrac> 
     </mrow> 
    </math> (<xref ref-type="bibr" rid="scirp.137508-3">
     Blanchard, 2014
    </xref>).</p>
   <fig id="fig3" position="float">
    <label>Figure 3</label>
    <caption>
     <title>Figure 3. Set of non-dominant solutions.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2123455-rId247.jpeg?20241121021503" />
   </fig>
   <p>
    <xref ref-type="bibr" rid="scirp.137508-"></xref>Table 1. Solutions at the corner points of the Pareto Front.</p>
   <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
    <tr> 
     <td class="custom-bottom-td acenter" width="9.99%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <msubsup> 
          <mi>
            Z 
          </mi> 
          <mn>
            1 
          </mn> 
          <mo>
            * 
          </mo> 
         </msubsup> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              Z 
            </mi> 
            <mn>
              2 
            </mn> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">z<sub>1</sub></p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">z<sub>2</sub></p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">THC</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">PDC</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">VEC</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">VFC</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">R<sub>t</sub></p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">n. vessels</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center"></p></td> 
    </tr> 
    <tr> 
     <td class="custom-top-td acenter" width="9.99%"><p style="text-align:center">HSN</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1.26e+07</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1.14e+07</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">3.76e+06</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">8.83e+06</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1692.538</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">7954.023</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">0.00%</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">10</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center"></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="9.99%"><p style="text-align:center">HSNP</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.21e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.05e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">3.32e+06</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">8.80e+06</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1644.074</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">7718.582</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">0.00%</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">10</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center"></p></td> 
    </tr> 
    <tr> 
     <td class="custom-bottom-td acenter" width="9.99%"><p style="text-align:center">HSNA</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">1.10e+07</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">1.16e+07</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">2.39e+06</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">8.61e+06</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">1502.644</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">6903.128</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">0.00%</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center">10</p></td> 
     <td class="custom-bottom-td acenter" width="10.00%"><p style="text-align:center"></p></td> 
    </tr> 
    <tr> 
     <td class="custom-bottom-td custom-top-td acenter" width="9.99%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <msubsup> 
          <mi>
            Z 
          </mi> 
          <mn>
            2 
          </mn> 
          <mo>
            * 
          </mo> 
         </msubsup> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              Z 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">z<sub>1</sub></p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">z<sub>2</sub></p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">VOC</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">Clease</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">CINV</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">LAC</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">VHC</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">R<sub>t</sub></p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="10.00%"><p style="text-align:center">n. vessels</p></td> 
    </tr> 
    <tr> 
     <td class="custom-top-td acenter" width="9.99%"><p style="text-align:center">HSN</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1.18e+07</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">2.42e+07</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">2.09e+07</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1.01e+06</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1282335.260</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1.05e+06</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">1034.799</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">0.53%</p></td> 
     <td class="custom-top-td acenter" width="10.00%"><p style="text-align:center">4</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="9.99%"><p style="text-align:center">HSNP</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.17e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.40e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.22e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">591270.317</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">730640.423</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">484803.468</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">950.168</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">0.26%</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">5</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="9.99%"><p style="text-align:center">HSNA</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.02e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.86e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1.64e+07</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">599603.005</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">741750.675</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">887606.535</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">1988.854</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">0.39%</p></td> 
     <td class="acenter" width="10.00%"><p style="text-align:center">7</p></td> 
    </tr> 
   </table>
   <p>At the corner points of the Pareto Front, a 7% reduction in unreliability costs (Z<sub>1</sub>) can be accomplished at the expense of 61% increases in reliability costs (z<sub>2</sub>), for two cooperative hub ports located farther apart. This cost tradeoff results in a 39% chance that the liner shipping will fail to provide reliable logistics service. Conversely, reducing the probability of failure (0%) would require reducing 38% reliability cost at the expense of 8% increases in unreliability costs. Recall that reliability probability is usually measured under specific operational conditions described above for this paper.</p>
   <p>In contrast, when two cooperative hub ports are located close together, a 4% reduction in unreliability costs requires a 33% increase in reliability costs, leading to a 26% probability of failure to provide reliable logistics service. Avoiding this failure entirely would mean reducing 25% reliability costs, which, in turn, worsens unreliability costs by 4%.</p>
   <p>Similarly, for a single non-cooperative hub, improving unreliability costs by 6% necessitates a significant 112% increase in reliability costs, with a resulting 53% chance of failure if the cost-tradeoff is accepted. Conversely, reducing the failure probability to 0% would demand a 53% reduction in reliability costs at the expense of a 7% increase in unreliability costs.</p>
   <p>Cooperation between hub ports located close together demonstrated superior efficiency in marginal cost-tradeoff between the conflicting objectives, particularly when compared with cooperative hub ports located farther apart. The marginal cost-tradeoff from reliability to unreliability is only 8.2%, implying that for every 1% reduction in unreliability costs (such as emissions, fuel consumptions, port due costs, and transshipment handling costs), an 8.2% sacrifice in reliability costs is necessary. This is more favorable than the 8.7% and 18.6% sacrifices required when cooperative hubs are geographically distant or when a single non-cooperative hub strategy is employed, respectively. Conversely, the marginal tradeoff ratio from unreliability to reliability is only 13% for a single non-cooperative hub strategy. This is more advantageous than the 16% and 24% ratios observed when two cooperative hubs are located close or geographically distant, respectively.</p>
   <p>However, it’s important to note that cooperative hubs, whether located close together or farther apart, are non-dominated with respect to each other in terms of absolute cost performance <xref ref-type="fig" rid="fig4(a)">
     Figure 4(a)
    </xref>, implying that it is impossible to implement either one without worsen at least one of the liner shipping objectives. The non-dominance can be supported by the higher cargo volume from the hub port of Abidjan, which reduces the need for additional transshipment costs and the deployment of extra vessels. However, cooperative hubs located close together strictly dominate the single non-cooperative hub strategy regarding absolute cost performance. In other words, the solution on the Pareto Front for the cooperative hub is significantly better in 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> and just as good in 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Z 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> compared to any corresponding solutions in a single non-cooperative hub strategy, as presented in <xref ref-type="fig" rid="fig4(b)">
     Figure 4(b)
    </xref>. The latter can be extended to a single non-cooperative hub strategy and two geographically distant cooperative hub ports.</p>
   <p>Therefore, for liner shipping willing to accept small increases (4%) in unreliability costs (including emissions and fuel costs) to maintain a cost-effective reliable logistics service (0% chance of failure), cooperative hub ports close together offer a significant advantage. On the other hand, cooperative hub ports located farther apart are more beneficial for liner shipping prioritizing sustainable practices, such as reducing emissions and improving vessel energy efficiency within the transatlantic supply chain, and being willing to tolerate a 39% chance of reliable logistics service failures. As shown in <xref ref-type="table" rid="table1">
     Table 1
    </xref>, C02 emissions produced at sea are 9% and 13% lower under the cooperative hub’s strategy located farther apart compared to cooperative hubs located close together and the single-non-cooperative hub strategy, respectively.</p>
   <p>These findings suggest that further alliances and negotiations between liner shipping companies and port authorities could help balance these conflicting objectives, benefiting all stakeholders.</p>
   <sec id="s5_1">
    <title>The Competition Effects</title>
    <p>This section evaluates the impact of competition between hubs on the logistical network, comparing these results with the cooperative scenarios described earlier. The same scenarios are examined: 1) two competing hub ports located close together (hub port of Dakar and Banjul—CHSNP); and 2) Two competing hubs located farther apart (hub port of Dakar and Abidjan—CHSNA). The resulting Pareto solutions are displayed in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>.</p>
    <p>The results show that the effects of competition between hubs on a cost-effective and reliable logistics network are highly sensitive to competitive market dynamics. Specifically, the influence depends on which hub has lower costs or time and whether the competition between hub ports is classified as moderate or aggressive.</p>
    <p>In this paper, aggressive competition is defined as a scenario where one hub consistently strives to undercut its competitor across multiple areas, offering lower overall port due, transshipment handling costs, and time. Conversely, competition is considered moderate when hub ports offer lower costs in some areas (e.g., transshipment handling time) while maintaining higher costs in others (e.g., port dues and transshipment handling costs).</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Set of non-dominated and dominated solutions.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2123455-rId256.jpeg?20241121021504" />
    </fig>
    <p>The results indicated that when hubs engage in aggressive competition, neither cooperation nor competition dominates the other, <xref ref-type="fig" rid="fig4(c)">
      Figure 4(c)
     </xref>. However, when competition between hubs is moderate, competition completely dominates cooperation. In other words, competition is strictly better in 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          Z 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
      </mrow> 
     </math> and not worse in 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          Z 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math>, as illustrated in <xref ref-type="fig" rid="fig4(d)">
      Figure 4(d)
     </xref>. These dynamics were observed only when the hubs are geographically distant, not when they are located close together. For hubs located nearby, neither cooperation nor competition dominated, regardless of which hub had lower costs or whether the competition was aggressive or moderate. <xref ref-type="fig" rid="fig4(e)">
      Figure 4(e)
     </xref> shows that neither strategy-cooperative hub ports located close together nor competitive hubs located close or far apart-dominated the other. Cooperation was effective only in reducing 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          Z 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
      </mrow> 
     </math> but not in promoting sustainability.</p>
    <p>Sensitive analysis of changes in the levels of cooperation/competition: 1) hub ports cooperating only on transshipment costs, and 2) both cooperative hubs located close together acting as getaways-revealed Pareto solutions similar to those found under competitive conditions above, for the first scenario, and for hub ports located both close and far apart. However, the Pareto obtained when both cooperative hubs located close together acted as getaways was inferior to the Pareto obtained when only one hub functioned as a getaway. The latter highlights that implementing cooperative hubs located close together, with only one acting as a getaway, results in better cost savings, <xref ref-type="fig" rid="fig4(f)">
      Figure 4(f)
     </xref>.</p>
    <p>Further simulations were carried out to account for contemporary geopolitical uncertainty, which often entails economical events. The paper considers a case where cargo volume increases by 40%, affecting hub port handling productivity. In a second scenario, the paper considers the simultaneous occurrence of multiple economic events (i.e., cargo volume increases by 40%, while lease costs, fuel prices, and emission costs by 50%, and vessel daily charter and operational costs decrease to 100US$/day· 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mrow> 
         <mtext>
           ton 
         </mtext> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            α 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
        </mrow> 
       </msup> 
      </mrow> 
     </math>). The results are displayed in <xref ref-type="fig" rid="fig5">
      Figure 5
     </xref> and reveal that the final outcomes remain consistent across temporal data variations. In other words, a moderate competition strategy between hub ports located far apart dominates cooperation, while no dominance is observed when hubs are located close together. These findings differ from previous discussed literature, specifically (<xref ref-type="bibr" rid="scirp.137508-12">
      Li &amp; Oh, 2010
     </xref>) which generally emphasizes cooperation over competition. For hub ports located closer together, it is not possible to implement either strategy without negatively impacting at least one objective in liner shipping, e.g., sustainability and/or delivery reliability. However, for hubs located farther apart, moderate competition proves to be a strictly better strategy than cooperation.</p>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.137508-"></xref>Figure 5. Set of non-dominated and dominated solutions from the sensitivity analysis</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="" />
    </fig>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.137508-"></xref>Figure 5. Set of non-dominated and dominated solutions from the sensitivity analysis</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2123455-rId265.jpeg?20241121021504" />
    </fig>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.137508-"></xref>Figure 5. Set of non-dominated and dominated solutions from the sensitivity analysis</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2123455-rId266.jpeg?20241121021504" />
    </fig>
   </sec>
  </sec><sec id="s6">
   <title>6. Conclusion</title>
   <p>Providing reliable logistics service is crucial to enhance the overall competitive advantage of liner shipping and potentially crowd out competitors. Consequently, many liners shipping started integrating (vertically and horizontally) to increase their size and take control of the entire supply chain activities. However, the fundamental characteristic of liner shipping is its heavy reliance on port infrastructures and the managerial decisions of port authorities.</p>
   <p>This paper examines how cooperation vs. competition between hub ports impacts the design of a cost-effective and reliable logistical network for containerized liner shipping. Since cost-effective, reliable logistics services are normally inversely proportional to unreliable service, liner shipping faces a cost tradeoff. This paper reflects the latter via a bi-objective mixed integer nonlinear optimization model. Numerical experiments were conducted for the West Africa-Europe-South America transatlantic supply chain. The main focus was placed on the West African region due to its geographical characteristics (extensive coastlines and located at the Atlantic shipping crossroads). Ports in this region offer equal spatial competitive advantages to assume regional hub status, which triggers competition vs. cooperation.</p>
   <p>In addition, this paper addresses a gap in the literature, which often combines conflicting objectives in liner shipping into a single objective. Contrary with much of the prior empirical literature that emphasizes port cooperation over competition, the findings in this paper reveal that moderate competition is strictly better than cooperation for geographically distant hub ports. However, for hubs located closer together, neither cooperation nor competition can be implemented without negatively affecting at least one objective in liner shipping, such as delivery reliability and/or sustainability (e.g., emissions reduction and fuel efficiency).</p>
   <p>Given West Africa’s strategic location at the Atlantic crossroads connecting Africa, Europe, and the Americas, this paper provides valuable insight for decision-making regarding hub port cooperation or competition, helping shipping companies navigate the tradeoffs between costs, reliability and sustainability.</p>
   <p>The framework of the proposed model is that of a central planner overseeing an integrated (vertically and horizontally) liner shipping company and port operator. The central planner assumption simplifies the analysis, allowing for a focused examination of the crucial tradeoff between reliability and unreliability costs. In reality, however, port authorities may decentralize their operations through leasing contracts, and individual liners decisions are often influenced by market dynamics. Further research could investigate whether the solutions derived from the central planner model are stable under decentralized market conditions.</p>
  </sec><sec id="s7">
   <title>Appendix A</title>
   <p>
    <xref ref-type="bibr" rid="scirp.137508-"></xref>Table A1. Import and export of container trade volume in 2020 (TEU).</p>
   <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
    <tr> 
     <td rowspan="2" class="acenter" width="28.49%"><p style="text-align:center">Ports</p></td> 
     <td class="custom-bottom-td acenter" width="35.76%" colspan="2"><p style="text-align:center">Export (TEU)</p></td> 
     <td class="custom-bottom-td acenter" width="35.76%" colspan="2"><p style="text-align:center">Import (TEU)</p></td> 
    </tr> 
    <tr> 
     <td class="custom-bottom-td custom-top-td acenter" width="17.88%"><p style="text-align:center">Europe</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="17.88%"><p style="text-align:center">South America</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="17.88%"><p style="text-align:center">Europe</p></td> 
     <td class="custom-bottom-td custom-top-td acenter" width="17.88%"><p style="text-align:center">South America</p></td> 
    </tr> 
    <tr> 
     <td class="custom-top-td acenter" width="28.49%"><p style="text-align:center">Port of Abidjan</p></td> 
     <td class="custom-top-td acenter" width="17.88%"><p style="text-align:center">390,668</p></td> 
     <td class="custom-top-td acenter" width="17.88%"><p style="text-align:center">7403</p></td> 
     <td class="custom-top-td acenter" width="17.88%"><p style="text-align:center">78,668</p></td> 
     <td class="custom-top-td acenter" width="17.88%"><p style="text-align:center">6951</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Conakry</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">2933</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center"></p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">24,913</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">1463</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Freetown</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">5732</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center"></p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">6905</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">6373</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Monrovia</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">3703</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center"></p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">7008</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">2426</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Cotonou</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">1374</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center"></p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">18,022</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">952</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Nouakchott</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">23,163</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">162</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">24,760</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">1224</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Bissau Port</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">200</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">135</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">4716</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">178</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Lomé</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">3779</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center"></p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">21,279</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">668</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Lagos</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">50,455</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">150</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">136,006</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">9127</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Tema</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">175,368</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">6890</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">132,540</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">12,705</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Banjul</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">721</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">1093</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">7796</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">4639</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Dakar</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">18,214</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">351</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">74,531</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">12,188</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="28.49%"><p style="text-align:center">Port of Praia</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">4936</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center"></p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">18,211</p></td> 
     <td class="acenter" width="17.88%"><p style="text-align:center">1553</p></td> 
    </tr> 
   </table>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.137508-"></xref>Table A2. Regression equation for each port for vessel mooring, pilotage and towage<sup>1</sup>.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="28.49%"><p style="text-align:center">Ports</p></td> 
      <td class="custom-bottom-td acenter" width="23.83%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
        </math> </p></td> 
      <td class="custom-bottom-td acenter" width="23.83%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            I 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            p 
          </mi> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
        </math> </p></td> 
      <td class="custom-bottom-td acenter" width="23.85%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msup> 
           <mi>
             R 
           </mi> 
           <mn>
             2 
           </mn> 
          </msup> 
         </mrow> 
        </math> </p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="28.49%"><p style="text-align:center">Port of Abidjan</p></td> 
      <td class="custom-top-td acenter" width="23.83%"><p style="text-align:center">4.0967</p></td> 
      <td class="custom-top-td acenter" width="23.83%"><p style="text-align:center">5002.044</p></td> 
      <td class="custom-top-td acenter" width="23.85%"><p style="text-align:center">0.9996</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Conakry</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.3753</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">6141.4</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9919</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Freetown</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.3753</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">6141.4</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9919</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Monrovia</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.3753</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">6141.4</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9919</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Cotonou</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.2107</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">686.45</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9987</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Nouakchott</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">4.0967</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">5002.044</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9996</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Bissau port</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">4.0967</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">5002.044</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9996</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Lomé</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.2107</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">686.45</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9987</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Lagos</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">4.0967</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">5002.044</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9996</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Tema</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.2199</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">5916.5</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9903</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Banjul</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">4.0967</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">5002.044</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9996</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Dakar</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">4.0967</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">5002.044</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9996</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="28.49%"><p style="text-align:center">Port of Praia</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">0.0477</p></td> 
      <td class="acenter" width="23.83%"><p style="text-align:center">766.69</p></td> 
      <td class="acenter" width="23.85%"><p style="text-align:center">0.9985</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <p>
    <xref ref-type="bibr" rid="scirp.137508-"></xref>Table A3. Terminal handling charge (US$), and average port time (Pt<sub>ri</sub>/day).</p>
   <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
    <tr> 
     <td class="custom-bottom-td acenter" width="37.99%"><p style="text-align:center">Ports</p></td> 
     <td class="custom-bottom-td acenter" width="31.01%"><p style="text-align:center">THCp</p></td> 
     <td class="custom-bottom-td acenter" width="31.01%"><p style="text-align:center">Pt<sub>ri</sub>/Day</p></td> 
    </tr> 
    <tr> 
     <td class="custom-top-td acenter" width="37.99%"><p style="text-align:center">Port of Abidjan</p></td> 
     <td class="custom-top-td acenter" width="31.01%"><p style="text-align:center">130</p></td> 
     <td class="custom-top-td acenter" width="31.01%"><p style="text-align:center">1.2</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Conakry</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">86</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">1.9</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Freetown</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">215</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">0.9</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Monrovia</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">140</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">1.8</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Cotonou</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">89</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">0.9</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Nouakchott</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">155</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">2.1</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Bissau port</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">259</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">4.8</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Lomé</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">154</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">1.1</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Lagos</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">187</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">3.8</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Tema</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">120</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">1.1</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Banjul</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">105</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">4.8</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Dakar</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">122</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">0.8</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="37.99%"><p style="text-align:center">Port of Praia</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">82</p></td> 
     <td class="acenter" width="31.01%"><p style="text-align:center">1.1</p></td> 
    </tr> 
   </table>
   <p>
    <xref ref-type="bibr" rid="scirp.137508-"></xref>Table A4. Estimations of the vessel main dimensions.</p>
   <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
    <tr> 
     <td class="custom-bottom-td acenter" width="8.44%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td acenter" width="15.25%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <mi>
           C 
         </mi> 
         <mi>
           a 
         </mi> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             T 
           </mi> 
           <mi>
             E 
           </mi> 
           <mi>
             U 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td acenter" width="15.25%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <msubsup> 
          <mi>
            v 
          </mi> 
          <mrow> 
           <mi>
             r 
           </mi> 
           <mi>
             i 
           </mi> 
           <mi>
             k 
           </mi> 
          </mrow> 
          <mrow> 
           <mi>
             s 
           </mi> 
           <mi>
             p 
           </mi> 
           <mi>
             e 
           </mi> 
           <mi>
             e 
           </mi> 
           <mi>
             d 
           </mi> 
          </mrow> 
         </msubsup> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td acenter" width="15.27%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <mi>
           G 
         </mi> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td acenter" width="15.25%"><p style="text-align:center">LOA</p></td> 
     <td class="custom-bottom-td acenter" width="15.25%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </math> </p></td> 
     <td class="custom-bottom-td acenter" width="15.27%"><p style="text-align:center"> 
       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
         <msub> 
          <mi>
            g 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </math> </p></td> 
    </tr> 
    <tr> 
     <td class="custom-top-td acenter" width="8.44%"><p style="text-align:center">1</p></td> 
     <td class="custom-top-td acenter" width="15.25%"><p style="text-align:center">154</p></td> 
     <td class="custom-top-td acenter" width="15.25%"><p style="text-align:center">11.6</p></td> 
     <td class="custom-top-td acenter" width="15.27%"><p style="text-align:center">2839</p></td> 
     <td class="custom-top-td acenter" width="15.25%"><p style="text-align:center">84</p></td> 
     <td class="custom-top-td acenter" width="15.25%"><p style="text-align:center">432.5</p></td> 
     <td class="custom-top-td acenter" width="15.27%"><p style="text-align:center">2.80 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">2</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">365</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">14.5</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">3071</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">110</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">432.5</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">2.80 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">3</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">442</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">12</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">5015</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">101</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">432.5</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">2.80 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">4</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">537</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">13</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">6006</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">128</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">432.5</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">2.80 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">5</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">804</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">19</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">7852</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">140</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">432.5</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">2.80 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">6</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">1732</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">20.14</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">18,480</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">172</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">794</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">2.05 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">7</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">2556</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">20</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">26,833</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">216</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">1132.2</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">1.69 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">8</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">3868</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">20</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">42,564</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">223</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">1132.2</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">1.69 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">9</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">4432</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">22</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">44,234</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">162</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">1132.2</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">1.69 × 10<sup>−</sup><sup>2</sup></p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="8.44%"><p style="text-align:center">10</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">14,000</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">22</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">90,118</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">306</p></td> 
     <td class="acenter" width="15.25%"><p style="text-align:center">1482.2</p></td> 
     <td class="acenter" width="15.27%"><p style="text-align:center">1.45 × 10<sup>−</sup><sup>2</sup> </p></td> 
    </tr> 
   </table>
  </sec><sec id="s8">
   <title>NOTES</title>
   <p><sup>1</sup>In some countries, the absence of port dues cost (mooring, pilotage, and towage) was covered with costs following their closest strategic ports for simplifications. Moreover, for ports such as Abidjan, and Dakar, the cost was adapted from (<xref ref-type="bibr" rid="scirp.137508-9">
     Kim, Lam, &amp; Lee, 2018
    </xref>), henceforth following their closest strategic ports.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.137508-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Africa Container Shipping (2022). The Main Candidates to Become the Number 1 Regional Hub in West Africa. &gt;https://africa-container-shipping.com/en/top-10-ports-africa-port-projects-in-west-africa/ 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     African Development Bank Group (2015). The Lomé Container Terminal. &gt;https://www.afdb.org/en/documents/document/project-brief-the-lome-container-terminal-83648 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Blanchard, B. S. (2014). Reliability, Maintainability, and Availability Measures. In B. S. Blanchard, (Ed.), Logistics Engineering and Management (p. 54). Pearson Education Limited.
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Correia, P.,&amp;Chengji, L. (2024). Forward Sustainable Transportation Network: Inter-hub and Spoke Versus Multi-Gateway Port Model. Social Science Research Network. &gt;http://doi.org/10.2139/ssrn.4768446 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dulebenets, M. A. (2018). A Comprehensive Multi-Objective Optimization Model for the Vessel Scheduling Problem in Liner Shipping. International Journal of Production Economics, 196, 293-318. &gt;https://doi.org/10.1016/j.ijpe.2017.10.027
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dyck, G. K.,&amp;Ismael, H. M. (2015). Multi-Criteria Evaluation of Port Competitiveness in West Africa Using Analytic Hierarchy Process (AHP). American Journal of Industrial and Business Management, 5, 432-446. &gt;https://doi.org/10.4236/ajibm.2015.56043 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Elmi, Z., Li, B., Liang, B., Lau, Y., Borowska-Stefańska, M., Wiśniewski, S., et al. (2023). An Epsilon-Constraint-Based Exact Multi-Objective Optimization Approach for the Ship Schedule Recovery Problem in Liner Shipping. Computers&amp;Industrial Engineering, 183, Article 109472. &gt;https://doi.org/10.1016/j.cie.2023.109472
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kherallah, H. (2020). DP World and Senegal Sign Agreement to Develop Ndayane Port. &gt;https://www.dpworld.com/news/releases/dp-world-and-senegal-sign-agreement-to-develop-ndayane-port/ 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kim, H., Lam, J. S. L.,&amp;Lee, P. T. (2018). Analysis of Liner Shipping Networks and Transshipment Flows of Potential Hub Ports in Sub-Saharan Africa. Transport Policy, 69, 193-206. &gt;https://doi.org/10.1016/j.tranpol.2018.05.018
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Koza, D. F. (2019). Liner Shipping Service Scheduling and Cargo Allocation. European Journal of Operational Research, 275, 897-915. &gt;https://doi.org/10.1016/j.ejor.2018.12.011
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lezhnina, E. A.,&amp;Balykina, Y. E. (2021). Cooperation between Sea Ports and Carriers in the Logistics Chain. Journal of Marine Science and Engineering, 9, Article 774. &gt;https://doi.org/10.3390/jmse9070774
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, J.,&amp;Oh, Y. (2010). A Research on Competition and Cooperation between Shanghai Port and Ningbo-Zhoushan Port. The Asian Journal of Shipping and Logistics, 26, 67-91. &gt;https://doi.org/10.1016/s2092-5212(10)80012-4
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Meng, Q., Wang, S., Andersson, H.,&amp;Thun, K. (2014). Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions. Transportation Science, 48, 265-280. &gt;https://doi.org/10.1287/trsc.2013.0461
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Munim, Z. H.,&amp;Haralambides, H. (2018). Competition and Cooperation for Intermodal Container Transhipment: A Network Optimization Approach. Research in Transportation Business&amp;Management, 26, 87-99. &gt;https://doi.org/10.1016/j.rtbm.2018.03.004
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nations Online Project (2023). Political Map of West Africa. &gt;https://www.nationsonline.org/oneworld/map/west-africa-map.htm 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pasha, J., Dulebenets, M. A., Fathollahi-Fard, A. M., Tian, G., Lau, Y., Singh, P., et al. (2022). An Integrated Optimization Method for Tactical-Level Planning in Liner Shipping with Heterogeneous Ship Fleet and Environmental Considerations. Advanced Engineering Informatics, 48, Article 101299. &gt;https://doi.org/10.1016/j.aei.2021.101299
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rodriguez, M. H., Agrell, P. J., Manrique-de-Lara-Penate, C.,&amp;Trujillo, L. (2022). A Multi-Criteria Fleet Deployment Model for Cost, Time and Environmental Impact. International Journal of Production Economics, 243, Article 108325. &gt;https://doi.org/10.1016/j.ijpe.2021.108325 
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saeed, N.,&amp;Larsen, O. I. (2010). An Application of Cooperative Game among Container Terminals of One Port. European Journal of Operational Research, 203, 393-403. &gt;https://doi.org/10.1016/j.ejor.2009.07.019
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Trujillo, L., Campos, J.,&amp;Pérez, I. (2018). Competition vs. Cooperation between Neighbouring Ports: A Case Study in Chile. Research in Transportation Business&amp;Management, 26, 100-108. &gt;https://doi.org/10.1016/j.rtbm.2018.03.005
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tu, N., Adiputranto, D., Fu, X.,&amp;Li, Z. (2018). Shipping Network Design in a Growth Market: The Case of Indonesia. Transportation Research Part E: Logistics and Transportation Review, 117, 108-125. &gt;https://doi.org/10.1016/j.tre.2017.10.001
    </mixed-citation>
   </ref>
   <ref id="scirp.137508-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wen, X., Chen, Q., Yin, Y., Lau, Y.,&amp;Dulebenets, M. A. (2024). Multi-Objective Optimization for Ship Scheduling with Port Congestion and Environmental Considerations. Journal of Marine Science and Engineering, 12, Article 114. &gt;https://doi.org/10.3390/jmse12010114
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>