<?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">
    jtts
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Transportation Technologies
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2160-0473
   </issn>
   <issn publication-format="print">
    2160-0481
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jtts.2024.143024
   </article-id>
   <article-id pub-id-type="publisher-id">
    jtts-134653
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Engineering
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Choosing Multimodal Freight Mix: An Integrated Multi-Objective Multicriteria Approach
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Mohammad Anwar
      </surname>
      <given-names>
       Rahman
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aSchool of Engineering, Science&amp;Technology, Central Connecticut State University, New Britain, CT, USA
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     15
    </day> 
    <month>
     05
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    14
   </volume> 
   <issue>
    03
   </issue>
   <fpage>
    402
   </fpage>
   <lpage>
    422
   </lpage>
   <history>
    <date date-type="received">
     <day>
      17,
     </day>
     <month>
      April
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      16,
     </day>
     <month>
      April
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      16,
     </day>
     <month>
      July
     </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>
    Multimodal freight transportation emerges as the go-to strategy for cost-effectively and sustainably moving goods over long distances. In a multimodal freight system, where a single contract includes various transportation methods, businesses aiming for economic success must make well-informed decisions about which modes of transport to use. These decisions prioritize secure deliveries, competitive cost advantages, and the minimization of environmental footprints associated with transportation-related pollution. Within the dynamic landscape of logistics innovation, various multicriteria decision-making (MCDM) approaches empower businesses to evaluate freight transport options thoroughly. In this study, we utilize a case study to demonstrate the application of the Technique for Order Preference by Similarity to the Ideal Solution (TOPSIS) algorithm for MCDM decision-making in freight mode selection. We further enhance the TOPSIS framework by integrating the entropy weight coefficient method. This enhancement aids in assigning precise weights to each criterion involved in mode selection, leading to a more reliable decision-making process. The proposed model provides cost-effective and timely deliveries, minimizing environmental footprint and meeting consumers’ needs. Our findings reveal that freight carbon footprint is the primary concern, followed by freight cost, time sensitivity, and service reliability. The study identifies the combination of Rail/Truck as the ideal mode of transport and containers in flat cars (COFC) as the next best option for the selected case. The proposed algorithm, incorporating the enhanced TOPSIS framework, benefits companies navigating the complexities of multimodal transport. It empowers making more strategic and informed transportation decisions. This demonstration will be increasingly valuable as companies navigate the ever-growing trade within the global supply chains.
   </abstract>
   <kwd-group> 
    <kwd>
     Multimodal Freight Transport
    </kwd> 
    <kwd>
      MCDM
    </kwd> 
    <kwd>
      TOPSIS
    </kwd> 
    <kwd>
      Entropy Technique
    </kwd> 
    <kwd>
      COFC
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>In today’s interconnected global economy, efficient freight transport is crucial. Businesses involved in international markets rely on real-time tracking, optimized route planning, and improved logistics to remain competitive. The rise of containerized shipping, along with multimodal and intermodal transport, has significantly improved supply chain efficiency, boosted national economies, and contributed to global GDP growth. The selection of freight transport modes and understanding of the selection criteria are critical for seamless material flow. Businesses import goods from suppliers, transport them to the manufacturing facilities, and finally deliver them to the retailers or consumers. Unimodal transport (using a single mode like truck) can be expensive for certain situations. Businesses consider multimodal, and intermodal as open options for transportation of goods. Multimodal transportation utilizes multiple modes of transport, such as truck, rail, and ship, within a single journey under one contract. This logistics company acts as a single point of contact that handles all documentation, contracts, and insurance and gets goods from origin to destination using various modes. In intermodal shipping, a business contracts with different carriers for each leg of the journey (trucking company, rail operator, etc.) until the final destinations. The business is responsible for coordinating between contracts and handling any issues during transfers. In multimodal, a single bill of lading contract (a document listing cargo details) covers the entire journey. Meanwhile, intermodal requires separate bills of lading for each transport mode used. Many businesses find the single point of contact with multimodal transportation is convenient, more secure, and easy to handle. In many countries, the road mode accounts for more than 75% of total inland freight transportation <xref ref-type="bibr" rid="scirp.134653-1">
     [1]
    </xref>. Due to their flexibility, trucks, and trailers are the most common freight shipment modes in many situations. However, the environmental impact of road transport, including congestion, accidents, and substantial CO<sub>2</sub> emissions, is a growing concern for many corporations. This has led to a push towards greener practices in the industry, with companies increasingly adopting eco-friendly transportation modes and investing in sustainable logistics solutions to reduce carbon emissions and improve efficiency. Companies realize that the appropriate selection of freight carriers by evaluating the right policy attributes reduces transportation costs, increases reliability, and minimizes harmful emissions while speeding up delivery to the end customer. Multimodal transportation has the potential to be less expensive and more sustainable than unimodal road transportation <xref ref-type="bibr" rid="scirp.134653-2">
     [2]
    </xref>. Trains, barges, and ships have lower costs and emissions per ton/km than trucks. Businesses are considering more efficient transportation modes, such as intermodal and multimodal, to reduce environmental impact and costs.</p>
   <p>The share of GDP attributed to freight transportation varies across the regions. In the US, it accounts for approximately 6% of the GDP, with the value of imports and exports projected to grow from 18.907 trillion dollars in 2017 to $20.328 in 2023 and is expected to reach almost $36.283 trillion in 2050 <xref ref-type="bibr" rid="scirp.134653-3">
     [3]
    </xref>. In Europe, the transport sector contributes around 5% to the EU’s GDP, supporting over 10 million jobs <xref ref-type="bibr" rid="scirp.134653-4">
     [4]
    </xref>. Rapidly developing economies like China have an even higher percentage than the developed economy. In the fourth quarter of 2023 alone, GDP from transport in China increased to 578.198 billion CNY from the previous quarter’s 431.239 billion CNY. This sector includes the freight and logistics market and passenger transport. The China freight and logistics market is projected to reach approximately USD 1.224 trillion in 2024, with a predicted growth rate of 6.39% annually through 2030, reaching 1.78 trillion in 2030 <xref ref-type="bibr" rid="scirp.134653-5">
     [5]
    </xref>. The market size expanded steadily due to the country’s strong economic growth, increasing international trade, and the development of e-commerce. The rise of e-commerce platforms like Alibaba has significantly impacted this growth. Like China, other developing Asian economies have a significant share of freight transportation in their GDP. Latin America’s intra-regional trade lags other major regions <xref ref-type="bibr" rid="scirp.134653-6">
     [6]
    </xref>. Freight transport contribution to Latin America’s GDP growth can help with better infrastructure and transportation logistics. <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref> shows a comparative value of major inter-regional trades.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. Intra-regional trade among major regions. Source: Picture; data from IMF, Direction of trade statistics; and IMF staff calculations <xref ref-type="bibr" rid="scirp.134653-4">
       [4]
      </xref>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3500920-rId13.jpeg?20240719033932" />
   </fig>
   <p>
    <xref ref-type="bibr" rid="scirp.134653-"></xref>Given the trade growth and logistics challenges, many governments implemented policies to promote the development of the logistics industry while ensuring environmental safety. Companies increasingly embrace eco-friendly transportation and sustainable logistics solutions to reduce carbon emissions and improve efficiency <xref ref-type="bibr" rid="scirp.134653-7">
     [7]
    </xref>. Multimodal transportation is a promising avenue, offering economic viability and environmental sustainability. Imagine an imported shipment arriving in Southern California and destined for a Chicago suburb. Multimodal transport offers an efficient and environmentally friendly solution. The long-haul portion can be covered by a trailer or a train (using a container on a flatbed—COFC) or a cargo plane for about 2200 miles. Upon reaching a rail terminal or the cargo airport near Illinois, a truck completes the final short-distance delivery. Businesses will investigate which long-haul transport mode and truck will be cost-effective for the final leg delivery.</p>
   <p>Multicriteria Decision Making (MCDM) methods influence route selection and mode of transport choice. This study integrates MCDM techniques and intermodal cost models to help companies swiftly respond to customer demands and adapt to market changes. Businesses require a robust approach to selecting the proper freight transport mode to minimize costs, improve competitiveness, and enhance customer satisfaction. This study proposes an integrated multicriteria modeling framework that evaluates service quality, cost, and environmental impact, optimizing freight flows on a multimodal transportation network. It offers a user-friendly alternative to expensive software or complex mathematical models, allowing managers to create a simple criteria-based matrix for route selection. The proposed model is a practical decision-making tool for businesses to navigate the complex world of freight transport. By considering service quality, cost, and environmental impact, companies can select the most suitable multimodal or intermodal transportation option while optimizing their supply chains.</p>
   <p>The organization of the rest of the paper is as follows: Section 2 is the literature on multicriteria decision-making models for transportation selection. Section 3 demonstrates a case study of multimodal transport related to multimodal transport cost functions, modal selection matrix, and the background of the entropy model and TOPSIS algorithm. Subsequently, Section 4 proposes the numerical results of this proposed method for modal selection using the TOPSIS model integrated with the entropy technique. Section 5 provides the conclusion, a discussion of future research direction, and concluding remarks.</p>
  </sec><sec id="s2">
   <title>2. Literature Review</title>
   <p>In the globalized economy, the success of a business relies upon efficient decision-making in selecting the transport carrier and orchestrating distribution across the supply chain connections designed to meet the company’s specific requirements. Several factors influence this decision, including a facility’s location relative to intermodal infrastructure, reliability of a transport logistics company, transport cost, greenhouse gas emissions, and government regulations. Researchers have explored how companies can evaluate and select freight transport models using multicriteria decision-making (MCDM) methods. These methods help compare multiple transport options based on various factors, allowing businesses to choose the best route that balances cost, speed, safety, and environmental impact. Over the years, the adoption of multicriteria decision models has risen due to their user-friendly solution approaches and the capability to integrate subjective expert judgments into the decision-making process. One prominent MCDM approach is the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS). This fact-based model prioritizes feasible alternatives while minimizing conflicting objectives. It can handle qualitative and quantitative data, considering factors like reducing cost and maximizing service reliability. Transport selection requires many different types of factors, such as cost, delivery speed, safety, and environmental impact, and sometimes ranking these factors needs to be more explicit. Fuzzy techniques offer a valuable approach when precise data is difficult to obtain. Fuzzy logic assigns “fuzzy scores” to reflect the importance of various factors, such as delivery speed or safety. This approach has been used with methods like Fuzzy AHP (Analytic Hierarchy Process) and Fuzzy TOPSIS for transport selection. Authors use fuzzy techniques to incorporate fuzzy numbers as a set of discrete values assigned to linguistic variables when it is difficult or impossible to assign a numerical value to the criteria <xref ref-type="bibr" rid="scirp.134653-8">
     [8]
    </xref>. The fuzzy AHP (Analytic Hierarchy Process) method helps establish by comparing factors in pairs and assigning fuzzy scores to reflect importance. The fuzzy TOPSIS method identifies the transport option closest to an ideal scenario based on all criteria. A fuzzy analysis network process (FANP) is used to avoid ambiguity in selecting a transportation mode between two countries <xref ref-type="bibr" rid="scirp.134653-9">
     [9]
    </xref>, and a hybrid Fuzzy-Analytic Network Process is used in the supplier evaluation process <xref ref-type="bibr" rid="scirp.134653-10">
     [10]
    </xref>. Further study implemented the fuzzy TOPSIS method to obtain a sustainable solution for a transportation system <xref ref-type="bibr" rid="scirp.134653-11">
     [11]
    </xref>; the TOPSIS approach for solving multicriteria decision-making problems with interval data considering environment-friendly and sustainable factors <xref ref-type="bibr" rid="scirp.134653-12">
     [12]
    </xref>; and an extended TOPSIS to solve multi-objective nonlinear-programming-problems <xref ref-type="bibr" rid="scirp.134653-13">
     [13]
    </xref>.</p>
   <p>Researchers have explored several other MCDM methods. One study implemented the Markov Decision Process (MDP) method to compare transportation options based on cost, carrier, and inventory levels <xref ref-type="bibr" rid="scirp.134653-14">
     [14]
    </xref>. The author used MDP to transport materials in a JIT (just-in-time) based production system. A freight transport modal selection method combining MCDM and geographic information systems used transport price, transport time, congestion time, CO2 emissions, accident risk, and noise as their criteria for container transport route selection <xref ref-type="bibr" rid="scirp.134653-15">
     [15]
    </xref>. A study of a decision support model using an analytic hierarchy process (AHP) and zero-one goal programming (ZOGP) determined an optimal multimodal transportation route. In a hybrid model, one study used AHP to determine the weights of the factor, relying on expert judgments and integrating with the ZOGP model to generate the optimal route. The model combined the MCDM with geographic information systems (GIS) for route selection, considering congestion time and CO<sub>2</sub> emissions <xref ref-type="bibr" rid="scirp.134653-16">
     [16]
    </xref>. A study on the multicriteria model with blockchain concept resolved synchronized transportation (using trains, ships, and trucks together) to find the best balance by balancing cost, speed, emissions, and blockchain costs and ranked the best options in the context of security, efficiency, and eco-friendly way to move things <xref ref-type="bibr" rid="scirp.134653-17">
     [17]
    </xref>. There are certain limitations that researchers have tried to overcome, such as situation selection factors being interrupted and new data becoming continuously available as the activity progresses. Several recent studies provide in-depth analyses of multicriteria decision models integrating Bayesian analysis to improve the selection process and satisfy customer needs. Fuzzy models can become complex, especially with many criteria. The fuzzy method’s limitation is evident in determining the relative importance or weight of different criteria in multicriteria decision-making (MCDM). The entropy method uses information theory to determine each criterion’s weights based on the data objectively. It is beneficial in reducing subjectivity and providing a more data-driven approach to weight determination. A study on the entropy method demonstrated the weight factors using quantitative information to rate each alternative based on criteria in the data matrix <xref ref-type="bibr" rid="scirp.134653-18">
     [18]
    </xref>. The entropy method enumerates the weights of various attributes without directly involving decision makers’ subjective choice for weight selection <xref ref-type="bibr" rid="scirp.134653-19">
     [19]
    </xref>. <xref ref-type="table" rid="table1">
     Table 1
    </xref> presents a brief model description of primary MCDM methods and their origin.</p>
   <p>Although MCDM methods offer valuable tools, complexities arise with models like fuzzy logic when dealing with numerous criteria. The entropy method tackles this by objectively assigning data-driven weights to each criterion, minimizing bias, and promoting a data-centric approach. By integrating the entropy weight coefficient method with the TOPSIS algorithm, we create a powerful MCDM tool. This combined approach refines the TOPSIS platform, enabling us to evaluate the ideal transportation mode among various multimodal and intermodal options (truck-rail, air-truck). This blended method enhances multicriteria decision-making (MCDM) by minimizing conflicting objectives when selecting optimal transportation modes and carriers. Based on a comprehensive set of criteria, this technique accurately evaluates the best options among various multi/intermodal combinations, ultimately aiding businesses in strategically choosing transportation methods that align with customer demands and enhance their overall performance. This decision-making process is crucial for freight companies to identify and select the most efficient and effective transport planning strategies.</p>
  </sec><sec id="s3">
   <title>3. Case Study: Selecting Multimodal Carrier</title>
   <p>In the realm of business, transportation preferences are often shaped by service commitments, costs, and customer service standards. This case study demonstrates how a company can choose the best carrier among a few multimodal</p>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 1. Origin of major MCDM methods.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="53.48%"><p style="text-align:center">Method [Original Source]</p></td> 
      <td class="custom-bottom-td acenter" width="55.40%"><p style="text-align:center">Brief Model Description</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-20">
        [20]
       </xref><p style="text-align:left">AHP (Analytical Hierarchical Process) </p></td> 
      <td class="custom-top-td aleft" width="55.40%"><p style="text-align:left">Prioritize alternate pairwise based comparisons</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-21">
        [21]
       </xref><p style="text-align:left">DEA (Data Envelopment Analysis) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Assesses relative efficiency of alternatives using mathematical modeling</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-22">
        [22]
       </xref><p style="text-align:left">TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Identifies closest alternative to an ideal solution</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-23">
        [23]
       </xref><p style="text-align:left">FST (Fuzzy Set Theory) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Framework for dealing with uncertainty and vagueness</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-24">
        [24]
       </xref><p style="text-align:left">Goal Programming (GP) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Achieves a set of goals with minimal deviations using mathematical programming</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-25">
        [25]
       </xref><p style="text-align:left">GRA/GRM (Grey Relational Analysis/Grey Relational Model) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Evaluates alternatives with limited data using grey system theory</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-26">
        [26]
       </xref><p style="text-align:left">ANP (Analytic Network Process) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">ANP extends AHP by allowing for dependence and feedback loops between criteria.</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-27">
        [27]
       </xref><p style="text-align:left">CBR (Case-Based Reasoning) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Solves new problems by adapting solutions from similar past cases.</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-28">
        [28]
       </xref><p style="text-align:left">PROMETHEE (Preference Ranking Organization Method for Enrichment Evaluate) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Ranks alternatives based on pairwise outranking comparisons.</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-29">
        [29]
       </xref><p style="text-align:left">ELECTRE (Serbian for Multicriteria Optimization and Compromise Solution) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Multi-criteria decision analysis methods that emphasize outranking relationships.</p></td> 
     </tr> 
     <tr> 
      <td class="aleft" width="53.48%">
       <xref ref-type="bibr" rid="scirp.134653-30">
        [30]
       </xref><p style="text-align:left">VIKOR (French for Elimination and Choice Expressing Reality) </p></td> 
      <td class="aleft" width="55.40%"><p style="text-align:left">Multi-criteria decision-making method focused on ranking and selecting from alternatives.</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <p>transport alternatives implementing the TOPSIS algorithm integrated entropy weight coefficient method. Multimodality involves employing multiple transportation modes to move goods, while intermodalism emphasizes seamless transfer using standardized loading units such as containers (Intermodal Transportation Units, or ITUs). Despite the prevalence of multimodal options, unimodal road transport still plays a substantial role in long-haul continental freight movement <xref ref-type="bibr" rid="scirp.134653-31">
     [31]
    </xref>. This persistence is attributed to factors like cost-effectiveness, flexibility in pick-up and delivery, and inadequate infrastructure for intermodal transfers in certain regions. Multimodality can involve any combination of transport methods, such as rail, road, air, and sea. This case study focuses on transporting a large quantity of lightweight backpacking equipment. The journey starts from a warehouse near a West Coast maritime terminal and ends at the company’s Midwestern warehouse. The analysis will determine the most suitable transportation mode(s) for this specific scenario. Employing the entropy method for assigning weights to evaluation criteria ensures a more objective evaluation process. By considering all relevant criteria and their importance, this method empowers decision-makers to identify the multimodal solution closest to the ideal state, ultimately selecting the best carrier for their specific needs. The efficacy of each transport mode hinges on performance criteria and empirical data samples. Managers examine available transportation options with pertinent facts and quantifiable data to effectively compare and rank alternatives. <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref> details the steps involved in this combined TOPSIS-entropy framework.</p>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. Unimodal and multimodal freight selection.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3500920-rId14.jpeg?20240719033933" />
   </fig>
   <sec id="s3_1">
    <title>3.1. Carrier Alternatives</title>
    <p>The study evaluates four distinct modes of transportation: 1) a unimodal transport chain involving trailer transport from the origin to destination, and two multimodal transport chains utilizing; 2) rail/truck and 3) air/truck and an intermodal 4) container on flat car (COFC)/Truck for the transport. Therefore, the four potential carrier alternates are considered: A<sub>1</sub> (All along trailer), A<sub>2</sub> (Rail/Truck combination), A<sub>3</sub> (Air/Truck combination), and A<sub>4</sub> (Container on Flat Car (COFC) intermodal and truck). The configurations of alternative multimodal freight transportation are visually depicted in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>.</p>
    <p>Definition: An intermodal becomes a multimodal when it operates under a single freight transportation contract.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Multimodal transports between points of origin (O) to the destination (D).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3500920-rId15.jpeg?20240719033933" />
    </fig>
    <p>Modal transportation offers a powerful tool for businesses to optimize their supply chains. By combining different modes of transport (truck, rail, ship), multimodal systems leverage the strengths of each to achieve greater efficiency and cost-effectiveness compared to traditional single-mode options <xref ref-type="bibr" rid="scirp.134653-32">
      [32]
     </xref>. As illustrated in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>, most modal systems involve three key stages:</p>
    <p>Pre-Haulage (First Mile): Trucks are typically the most efficient way to move goods short distances from factories or warehouses to the initial transport hub (port, rail yard). Businesses often use their own trucks for this leg due to the proximity of facilities to these hubs.</p>
    <p>Long-Haul (The Main Event): The long-distance journey utilizes the most suitable mode (rail, ship, air) or even a combination of modes depending on cost, speed, and distance. Trailers on flatcars (TOFC) and containers on flatcars (COFC) are commonly used for efficient rail transport.</p>
    <p>Post-Haulage (Last Mile): Like pre-haulage, trucks are often the best choice for final delivery to urban centers, warehouses, and distribution centers. This “last mile” delivery is often referred to as drayage.</p>
    <p>The distance between the main modal starts and ends is Z miles. Here, pre-haulage distance, a is considered from the origin (facility) to the main modal start point. The post-haulage distance b is from the main modal start point to the destination. Therefore, total transport travel distance = Z + (a + b).</p>
    <p>Intermodal transport offers a strategic advantage when the total costs (including pre and post-haulage) become competitive with traditional trucking for the entire distance. <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref> presents pre-haulage, long haulage, and post-haulage transport cost functions.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Intermodal: pre-haulage (“first mile”), long-haulage, and post-haulage (“last mile”).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3500920-rId16.jpeg?20240719033933" />
    </fig>
    <p>Total Cost:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mrow> 
           <msub> 
            <mi>
              a 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              S 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
         </mfrac> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              U 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            F 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mrow> 
           <msub> 
            <mi>
              Z 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              S 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
         </mfrac> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              U 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            F 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mrow> 
           <msub> 
            <mi>
              b 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              S 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
         </mfrac> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              U 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            F 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
       <mo>
         × 
       </mo> 
       <mi>
         U 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>Here, subscript m is modal: truck, Rail/Truck, Air/Truck, COFC/Truck etc.</p>
    <p>where</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
      </mrow> 
     </math>: Total cost for modal transportation</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            Z 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            S 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            U 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
      </mrow> 
     </math>: Main modal transport cost ($)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            U 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math>: Pre-haulage transport cost ($)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            b 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            S 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            U 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
      </mrow> 
     </math>: Post-haulage transport cost ($)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          W 
        </mi> 
        <mrow> 
         <mi>
           R 
         </mi> 
         <mo>
           / 
         </mo> 
         <mi>
           T 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>: Transshipment cost</p>
    <p>Z: Distance, (mile)</p>
    <p>a<sub>m</sub>: Pre-haulage distances (road transport) (miles)</p>
    <p>b<sub>m</sub>: Post-haulage distances (road transport) (miles)</p>
    <p>S<sub>m</sub>: Transport speed (transport mode) (mile/hour)</p>
    <p>F<sub>m</sub>: Main transport tariff, ($/Container mile)</p>
    <p>k: Transshipment time at the intermodal terminal (hours)</p>
    <p>U: Value of time (by transport mode) ($/Container/hour)</p>
    <p>U(k): Transship time: Time to transfer container at modal terminal</p>
    <p>W: Transship cost: Cost for modal transport ($/Container)</p>
    <p>F<sub>1</sub>: Pre-haulage tariff ($/Container mile)</p>
    <p>F<sub>2</sub>: Post-haulage tariff ($/Container mile)</p>
    <p>Freight transportation modeling requires fixed and variable expenses related to transport modes, vehicle types, product groups, origin-destination data, route networks, and terminal information for transferring containers between transport modes. In <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>, A<sub>1</sub> is unimodal freight transport by trailer; A<sub>2</sub> is (Rail/Truck) and there is no pre-haulage, so the distance is travelled by rail transport as the main mode and truck for the post-haulage transport. The corresponding equation for the main mode of rail freight and truck for the post-haulage transport is below.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mrow> 
         <mi>
           R 
         </mi> 
         <mo>
           / 
         </mo> 
         <mi>
           T 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          Z 
        </mi> 
        <mi>
          R 
        </mi> 
       </msub> 
       <mo>
         × 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mrow> 
           <msub> 
            <mi>
              β 
            </mi> 
            <mi>
              R 
            </mi> 
           </msub> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              h 
            </mi> 
            <mi>
              R 
            </mi> 
           </msub> 
          </mrow> 
         </mfrac> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            τ 
          </mi> 
          <mi>
            R 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          b 
        </mi> 
        <mi>
          T 
        </mi> 
       </msub> 
       <mo>
         × 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mrow> 
           <msub> 
            <mi>
              β 
            </mi> 
            <mi>
              T 
            </mi> 
           </msub> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              h 
            </mi> 
            <mi>
              T 
            </mi> 
           </msub> 
          </mrow> 
         </mfrac> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            g 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <mi>
         β 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          r 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
   </sec>
   <sec id="s3_2">
    <title>3.2. MCDM Freight Selection Model</title>
    <p>The TOPSIS method with entropy weighting helps select the best carrier among discrete performance data by objectively assigning weights to criteria (e.g., cost, time) and ranking alternatives based on their closeness to an ideal scenario. The entropy method is useful when policymakers conflict with the values of weights <xref ref-type="bibr" rid="scirp.134653-19">
      [19]
     </xref>. This approach reduces bias from subjective weighting and helps businesses find the most efficient carrier for cost savings and market advantage. The procedure involves ranking alternative carriers structured into a series of systematic steps.</p>
    <p>Step 1: Identify Alternatives and Evaluation Criteria</p>
    <p>Determine potential transport routes and measurable characteristics, forming a decision matrix of discrete choices between alternatives and criteria. A decision maker identify n selection criteria 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         C 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            C 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mo>
           | 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           n 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> through which m alternative transportation modes 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           | 
         </mo> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           m 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. The data is expressed in a (m × n) matrix, representing the discrete choices between the criteria and alternatives. The Freight selection MCDM matrix is shown in <xref ref-type="table" rid="table2">
      Table 2
     </xref>:</p>
    <table-wrap id="table2">
     <label>
      <xref ref-type="table" rid="table2">
       Table 2
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 2. Freight selection MCDM matrix.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="25.83%"><p style="text-align:center">FSM Matrix</p></td> 
       <td class="custom-bottom-td acenter" width="19.15%"><p style="text-align:center">C<sub>1</sub></p></td> 
       <td class="custom-bottom-td acenter" width="17.58%"><p style="text-align:center">C<sub>2</sub></p></td> 
       <td class="custom-bottom-td acenter" width="17.58%"><p style="text-align:center">···</p></td> 
       <td class="custom-bottom-td acenter" width="17.58%"><p style="text-align:center">C<sub>n</sub></p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="25.83%"><p style="text-align:center">A<sub>1</sub></p></td> 
       <td class="custom-top-td acenter" width="19.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               11 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               12 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="17.58%"><p style="text-align:center">···</p></td> 
       <td class="custom-top-td acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mi>
               n 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="25.83%"><p style="text-align:center">A<sub>2</sub></p></td> 
       <td class="acenter" width="19.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               21 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               22 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center">···</p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               2 
             </mn> 
             <mi>
               n 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="25.83%"><p style="text-align:center">A<sub>3</sub></p></td> 
       <td class="acenter" width="19.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               31 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               32 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center">···</p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mn>
               3 
             </mn> 
             <mi>
               n 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="25.83%"><p style="text-align:center">A<sub>m</sub></p></td> 
       <td class="acenter" width="19.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mn>
               1 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mn>
               2 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center">···</p></td> 
       <td class="acenter" width="17.58%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               x 
             </mi> 
             <mo>
               ˜ 
             </mo> 
            </mover> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mi>
               n 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>Matrix element, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           x 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the performance rating of criteria C<sub>j</sub> for each alternative mode A<sub>i</sub>. The normalized value 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is calculated as</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msqrt> 
          <mrow> 
           <mstyle displaystyle="true"> 
            <msubsup> 
             <mo>
               ∑ 
             </mo> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mo>
                = 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
             <mi>
               m 
             </mi> 
            </msubsup> 
            <mrow> 
             <msubsup> 
              <mi>
                x 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
              <mn>
                2 
              </mn> 
             </msubsup> 
            </mrow> 
           </mstyle> 
          </mrow> 
         </msqrt> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           m 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         j 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           n 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (1)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> represents the numerical evaluation of alternative A<sub>i</sub> for criterion C<sub>j</sub>. The squared normalization of the data eliminates the differences of measurement units and inconsistent scale.</p>
    <p>Step 2: Entropy Coefficient Method to Evaluate Weight Criteria</p>
    <p>Apply the entropy method to determine the weight 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         W 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mover accent="true"> 
           <mi>
             w 
           </mi> 
           <mo>
             ˜ 
           </mo> 
          </mover> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mo>
           | 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           n 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> for each criterion, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           n 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. Using the normalized decision matrix, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          q 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, the entropy weight coefficient E<sub>j</sub> is calculated as follows:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mi>
         k 
       </mi> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            q 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <mi>
           ln 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              q 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (2)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          q 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msubsup> 
           <mo>
             ∑ 
           </mo> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             m 
           </mi> 
          </msubsup> 
          <mrow> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </mstyle> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math>, and k (constant) = 1/ln(m).</p>
    <p>The larger the entropy within the criteria the more likely it is to be an important criterion. Note, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          q 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> are not same. The measurement of dispersion D<sub>j</sub> for a criterion is calculated as, the following:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          D 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math>. (3)</p>
    <p>The higher D<sub>j</sub> value indicates the importance of the criterion in the decision matrix. The weight w<sub>j</sub> for each attribute C<sub>j</sub> is calculated by using the following formula:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            D 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mrow> 
         <msubsup> 
          <mstyle mathsize="140%" displaystyle="true"> 
           <mo>
             ∑ 
           </mo> 
          </mstyle> 
          <mrow> 
           <mi>
             k 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mi>
            n 
          </mi> 
         </msubsup> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            D 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> (4)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mover accent="true"> 
         <mi>
           w 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mover accent="true"> 
         <mi>
           w 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mover accent="true"> 
         <mi>
           w 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mi>
          n 
        </mi> 
       </msub> 
      </mrow> 
     </math>, where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           w 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the weight of jth criterion C<sub>j</sub>.</p>
    <p>Step 3: Construct Weighted Normalized Decision Matrix</p>
    <p>Update the matrix elements by multiplying the entropy-derived weights with normalized performance ratings as follows:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
       <mo>
         = 
       </mo> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
       <mo>
         × 
       </mo> 
       <mo> 
       </mo> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
      </mrow> 
     </math> (5)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
      </mrow> 
     </math> is weight. 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           m 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         j 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           2 
         </mn> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           n 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> element in decision matrix.</p>
    <p>Step 4: Determine Intuitionistic Positive and Negative Ideal Solution.</p>
    <p>
     <xref ref-type="bibr" rid="scirp.134653-"></xref>This step is to identify the positive ideal reference point V<sup>+</sup> and the negative ideal reference point V<sup>−</sup>. Among the evaluation criteria, J<sub>b</sub> ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         J 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <msub> 
        <mi>
          J 
        </mi> 
        <mi>
          b 
        </mi> 
       </msub> 
      </mrow> 
     </math>) is the set of benefit criteria, and J<sub>c</sub> ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         J 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <msub> 
        <mi>
          J 
        </mi> 
        <mi>
          c 
        </mi> 
       </msub> 
      </mrow> 
     </math>) is the set of cost criteria. The V<sup>+</sup> and V<sup>−</sup> are obtained as follows.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          V 
        </mi> 
        <mo>
          + 
        </mo> 
       </msup> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mrow> 
             <mi>
               max 
             </mi> 
            </mrow> 
            <mi>
              i 
            </mi> 
           </msub> 
           <msub> 
            <mi>
              V 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             | 
           </mo> 
           <mi>
             J 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <msub> 
            <mi>
              J 
            </mi> 
            <mi>
              b 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mrow> 
             <mi>
               min 
             </mi> 
            </mrow> 
            <mi>
              i 
            </mi> 
           </msub> 
           <msub> 
            <mi>
              V 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             | 
           </mo> 
           <mi>
             J 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <msub> 
            <mi>
              J 
            </mi> 
            <mi>
              c 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mn>
            1 
          </mn> 
          <mo>
            + 
          </mo> 
         </msubsup> 
         <mo>
           , 
         </mo> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mn>
            2 
          </mn> 
          <mo>
            + 
          </mo> 
         </msubsup> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mi>
            n 
          </mi> 
          <mo>
            + 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (6a)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          V 
        </mi> 
        <mo>
          − 
        </mo> 
       </msup> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mrow> 
             <mi>
               min 
             </mi> 
            </mrow> 
            <mi>
              i 
            </mi> 
           </msub> 
           <msub> 
            <mi>
              V 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             | 
           </mo> 
           <mi>
             J 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <msub> 
            <mi>
              J 
            </mi> 
            <mi>
              c 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mrow> 
             <mi>
               max 
             </mi> 
            </mrow> 
            <mi>
              i 
            </mi> 
           </msub> 
           <msub> 
            <mi>
              V 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             | 
           </mo> 
           <mi>
             J 
           </mi> 
           <mo>
             ∈ 
           </mo> 
           <msub> 
            <mi>
              J 
            </mi> 
            <mi>
              c 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
         </msubsup> 
         <mo>
           , 
         </mo> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mn>
            2 
          </mn> 
          <mo>
            − 
          </mo> 
         </msubsup> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mi>
            n 
          </mi> 
          <mo>
            − 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (6b)</p>
    <p>Step 5: Determine the Separation Measures between the Alternatives</p>
    <p>The distance of each alternative from the positive ideal reference point ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> from V<sup>+</sup>) and negative ideal reference point, ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> from V<sup>−</sup>) is obtained as follows:</p>
    <p>Positive Ideal Separation: 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msubsup> 
           <mo>
             ∑ 
           </mo> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
          <mi>
            d 
          </mi> 
         </mstyle> 
         <msup> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                V 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msubsup> 
              <mi>
                V 
              </mi> 
              <mi>
                j 
              </mi> 
              <mo>
                + 
              </mo> 
             </msubsup> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </msup> 
        </mrow> 
       </msqrt> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         m 
       </mi> 
      </mrow> 
     </math> (7a)</p>
    <p>Negative Ideal Separation: 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msubsup> 
           <mo>
             ∑ 
           </mo> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
          <mi>
            d 
          </mi> 
         </mstyle> 
         <msup> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                V 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msubsup> 
              <mi>
                V 
              </mi> 
              <mi>
                j 
              </mi> 
              <mo>
                − 
              </mo> 
             </msubsup> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </msup> 
        </mrow> 
       </msqrt> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         m 
       </mi> 
      </mrow> 
     </math> (7b)</p>
    <p>Here, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         d 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mi>
            j 
          </mi> 
          <mo>
            + 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> represents the distance between a given element and the maximum value. 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> denotes the distance of an alternative from V<sup>+</sup> (the positive ideal solution), while 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> indicates the distance of the alternative from V<sup>−</sup> (the negative ideal solution).</p>
    <p>Step 6: Obtain the Closeness Co-efficient to Rank the Alternatives.</p>
    <p>The TOPSIS method assigns a closeness index (U<sub>i</sub>) to each carrier, indicating its proximity to the ideal option. The value of U<sub>i</sub> is obtained as follows:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          U 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msubsup> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
          <mo>
            − 
          </mo> 
         </msubsup> 
        </mrow> 
        <mrow> 
         <msubsup> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
          <mo>
            + 
          </mo> 
         </msubsup> 
         <mo>
           + 
         </mo> 
         <msubsup> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
          <mo>
            − 
          </mo> 
         </msubsup> 
        </mrow> 
       </mfrac> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <mtext>
           
       </mtext> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         m 
       </mi> 
       <mo>
         ; 
       </mo> 
       <mtext>
           
       </mtext> 
       <mn>
         0 
       </mn> 
       <mo>
         ≤ 
       </mo> 
       <msub> 
        <mi>
          U 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ≤ 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>. (8)</p>
    <p>A U<sub>i</sub> closer to 1 signifies a higher priority carrier, as it’s closer to the best possible scenario and furthest from the worst.</p>
   </sec>
  </sec><sec id="s4">
   <title>4. Numerical Results</title>
   <p>This example illustrates the use of the TOPSIS method with entropy weighting to select the optimal carrier for shipping lightweight backpacking equipment from a West Coast warehouse to the Midwest. The method evaluates various multimodal options, with entropy weighting providing an objective basis for assigning importance to different criteria, thus reducing bias. The selection process integrates expert opinions from logistics professionals and findings from a literature review, focusing on key factors such as cost, time, emissions, risk, reliability, and environmental impact. These criteria are applied to assess the different transportation options, as depicted in <xref ref-type="fig" rid="fig5">
     Figure 5
    </xref>, ensuring a comprehensive evaluation of the entire transport chain.</p>
   <fig id="fig5" position="float">
    <label>Figure 5</label>
    <caption>
     <title>Figure 5. Alternative freight transports and selected criteria.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3500920-rId125.jpeg?20240719033934" />
   </fig>
   <p>These options represent different combinations of transport modes:</p>
   <p>A<sub>1</sub>: Unimodal Truck: This option involves using a single trailer for the entire journey from origin to destination.</p>
   <p>A<sub>2</sub>: Rail-Truck (Multimodal): This multimodal option combines rail transport for a portion of the journey with final delivery by truck.</p>
   <p>A<sub>3</sub>: Air-Truck (Multimodal): This multimodal option utilizes airfreight for a faster but potentially more expensive leg, followed by truck delivery.</p>
   <p>A<sub>4</sub>: COFC/Truck (Intermodal): This intermodal option leverages a container on a flatcar (COFC) for efficient rail transport, followed by truck for final delivery.</p>
   <p>In transportation logistics, the assessment of carrier selection transcends mere point-to-point shipment movement. Businesses are interested in the quality of physical handling, dispatch, reception, planning, and control activities on the freight’s trajectory from origin to destination. The study guides a step-by-step logistic pathway for this specialized backpacking equipment, a substantial volume of lightweight backpacking equipment, from a West Coast company to a company-owned warehouse nestled in a Midwestern city in the United States. The priority of transport modal option is based on service reliability, time sensitivity, environmental commitment, and transportation costs. Businesses review the selected performance criteria and collect sample data to rank the best transport mode for an instant. Four key criteria to assess potential carriers:</p>
   <sec id="s4_1">
    <title>4.1. Determining Transportation Cost</title>
    <p>The illustrative case is a data-driven approach that offers the selecting most suitable carrier for the specific freight scenario. The numerical findings of the case study illustrate the practical application of the TOPSIS method integrated with the entropy weight coefficient technique, facilitating the thorough analysis of carriers’ selection from a range of multimodal/intermodal transportation alternatives. The total cost of transportation for each modal includes pre-haulage, main modal, and post-haulage transport costs, along with transshipment costs. The distance between the point of origin and destination, equivalent to California and Midwest city (Chicago), is assumed to be 2000 miles. <xref ref-type="table" rid="table3">
      Table 3
     </xref> provides the comparative intermodal cost elements.</p>
    <table-wrap id="table3">
     <label>
      <xref ref-type="table" rid="table3">
       Table 3
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 3. Comparative intermodal cost elements.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="50.42%"><p style="text-align:center">Variables</p></td> 
       <td class="custom-bottom-td acenter" width="12.65%"><p style="text-align:center">Road</p></td> 
       <td class="custom-bottom-td acenter" width="14.84%"><p style="text-align:center">Rail/Truck</p></td> 
       <td class="custom-bottom-td acenter" width="15.46%"><p style="text-align:center">Air/Truck</p></td> 
       <td class="custom-bottom-td acenter" width="12.47%"><p style="text-align:center">COFC</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td aleft" width="50.42%"><p style="text-align:left">z: Distance, (mile)</p></td> 
       <td class="custom-top-td acenter" width="12.65%"><p style="text-align:center">2000</p></td> 
       <td class="custom-top-td acenter" width="14.84%"><p style="text-align:center">1970</p></td> 
       <td class="custom-top-td acenter" width="15.46%"><p style="text-align:center">1950</p></td> 
       <td class="custom-top-td acenter" width="12.47%"><p style="text-align:center">1960</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">a: Pre-haul distance, (mile)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">n/a</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">n/a</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">25</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">n/a</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">b: Post-haul distance, (mile)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">n/a</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">30</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">25</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">40</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">r: Transshipment time (hours)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">n/a</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">2</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">3</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">1</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">w: Transshipment costs, ($/container)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">n/a</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">25</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">50</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">15</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">τ: Transport tariff, ($/Container mile)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">1.1</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">0.5</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">1.1</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">0.7</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">h: Transshipment speed (mile/hour)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">40</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">50</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">300</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">50</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">g: Post-haul tariff, ($/Container mile)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">0.0</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">3</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">3</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">3</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="50.42%"><p style="text-align:left">β: Value of time ($/Container/hour)</p></td> 
       <td class="acenter" width="12.65%"><p style="text-align:center">1</p></td> 
       <td class="acenter" width="14.84%"><p style="text-align:center">1</p></td> 
       <td class="acenter" width="15.46%"><p style="text-align:center">1</p></td> 
       <td class="acenter" width="12.47%"><p style="text-align:center">1</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>The distance traveled by a primary transport mode is Z + (a + b), where Z is the long haulage distance and a and b are the pre-haulage and post-haulage distance, respectively. Road transport only uses pre- and post-haulage. Freight transportation costs fluctuate over time due to fuel prices, infrastructure maintenance, and market conditions. The context for cost evaluation includes the average freight transportation prices (percent/ton-mile) across different modes are $2.50 for the railway, $25.08 for truck/motorway, $0.73 for water/seaway, and $58.75 for airway. Total transport cost is represented by the cost derived using Equation (1). The transport cost comparison of the selected freight transport mode is shown in <xref ref-type="table" rid="table4">
      Table 4
     </xref>.</p>
    <table-wrap id="table4">
     <label>
      <xref ref-type="table" rid="table4">
       Table 4
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 4. Transport cost comparison of selected freight transport modes.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.16%"><p style="text-align:center">Mode</p></td> 
       <td class="custom-bottom-td acenter" width="38.30%"><p style="text-align:center">Total cost</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="36.16%"><p style="text-align:center">TC (Trailer)</p></td> 
       <td class="custom-top-td acenter" width="38.30%"><p style="text-align:center">$1840.00</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.16%"><p style="text-align:center">TC (Rail/Truck)</p></td> 
       <td class="acenter" width="38.30%"><p style="text-align:center">$1151.85</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.16%"><p style="text-align:center">TC (Air/Truck)</p></td> 
       <td class="acenter" width="38.30%"><p style="text-align:center">$2280.00</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.16%"><p style="text-align:center">TC (COFC)</p></td> 
       <td class="acenter" width="38.30%"><p style="text-align:center">$1361.80</p></td> 
      </tr> 
     </table>
    </table-wrap>
   </sec>
   <sec id="s4_2">
    <title>4.2. Rank the Multimodal Transports</title>
    <p>Following Step 1, the performance rate of each carrier alternative and the corresponding criteria are presented in <xref ref-type="table" rid="table5">
      Table 5
     </xref>. The freight carrier alternatives A<sub>j</sub>(j = 1, 2, ···, 4), evaluated against the selected attributes C<sub>i</sub>(i = 1, 2, ···, 4), the data is expressed in a (4 × 4) matrix that represents the discrete choice between the attributes and alternatives.</p>
    <p>Squired normalization value 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msqrt> 
          <mrow> 
           <mstyle displaystyle="true"> 
            <msubsup> 
             <mo>
               ∑ 
             </mo> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mo>
                = 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
             <mi>
               m 
             </mi> 
            </msubsup> 
            <mrow> 
             <msubsup> 
              <mi>
                x 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
              <mn>
                2 
              </mn> 
             </msubsup> 
            </mrow> 
           </mstyle> 
          </mrow> 
         </msqrt> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math>., presented in <xref ref-type="table" rid="table6">
      Table 6
     </xref>.</p>
    <table-wrap id="table5">
     <label>
      <xref ref-type="table" rid="table5">
       Table 5
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 5. Data matrix to evaluate transportation mode by criteria.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="24.67%"><p style="text-align:center"></p></td> 
       <td class="custom-bottom-td acenter" width="16.12%"><p style="text-align:center">Freight Cost</p></td> 
       <td class="custom-bottom-td acenter" width="18.03%"><p style="text-align:center">Time-sensitive</p></td> 
       <td class="custom-bottom-td acenter" width="19.27%"><p style="text-align:center">Carbon Footprint</p></td> 
       <td class="custom-bottom-td acenter" width="13.55%"><p style="text-align:center">Reliability</p></td> 
       <td class="custom-bottom-td acenter" width="8.36%"><p style="text-align:center"></p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="24.67%"><p style="text-align:center">Transport Mode</p></td> 
       <td class="custom-top-td acenter" width="16.12%"><p style="text-align:center">C<sub>1</sub></p></td> 
       <td class="custom-top-td acenter" width="18.03%"><p style="text-align:center">C<sub>2</sub></p></td> 
       <td class="custom-top-td acenter" width="19.27%"><p style="text-align:center">C<sub>3</sub></p></td> 
       <td class="custom-top-td acenter" width="13.55%"><p style="text-align:center">C<sub>4</sub></p></td> 
       <td class="custom-top-td acenter" width="8.36%"><p style="text-align:center">Sum</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.67%"><p style="text-align:center">A<sub>1</sub>: Trailer</p></td> 
       <td class="acenter" width="16.12%"><p style="text-align:center">5</p></td> 
       <td class="acenter" width="18.03%"><p style="text-align:center">7</p></td> 
       <td class="acenter" width="19.27%"><p style="text-align:center">5</p></td> 
       <td class="acenter" width="13.55%"><p style="text-align:center">8</p></td> 
       <td class="acenter" width="8.36%"><p style="text-align:center">25</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.67%"><p style="text-align:center">A<sub>2</sub>: Rail/Truck</p></td> 
       <td class="acenter" width="16.12%"><p style="text-align:center">9</p></td> 
       <td class="acenter" width="18.03%"><p style="text-align:center">6</p></td> 
       <td class="acenter" width="19.27%"><p style="text-align:center">8</p></td> 
       <td class="acenter" width="13.55%"><p style="text-align:center">6</p></td> 
       <td class="acenter" width="8.36%"><p style="text-align:center">29</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.67%"><p style="text-align:center">A<sub>3</sub>: Air/Truck</p></td> 
       <td class="acenter" width="16.12%"><p style="text-align:center">4</p></td> 
       <td class="acenter" width="18.03%"><p style="text-align:center">9</p></td> 
       <td class="acenter" width="19.27%"><p style="text-align:center">6</p></td> 
       <td class="acenter" width="13.55%"><p style="text-align:center">9</p></td> 
       <td class="acenter" width="8.36%"><p style="text-align:center">28</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.67%"><p style="text-align:center">A<sub>4</sub>: COFC*</p></td> 
       <td class="acenter" width="16.12%"><p style="text-align:center">8</p></td> 
       <td class="acenter" width="18.03%"><p style="text-align:center">6</p></td> 
       <td class="acenter" width="19.27%"><p style="text-align:center">8</p></td> 
       <td class="acenter" width="13.55%"><p style="text-align:center">5</p></td> 
       <td class="acenter" width="8.36%"><p style="text-align:center">27</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>COFC* = Container on Flat Car, (Rail-Truck).</p>
    <table-wrap id="table6">
     <label>
      <xref ref-type="table" rid="table6">
       Table 6
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 6. Normalized value in decision matrix.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="25.38%"><p style="text-align:center">Transport Mode</p></td> 
       <td class="custom-bottom-td acenter" width="18.65%"><p style="text-align:center">C<sub>1</sub></p></td> 
       <td class="custom-bottom-td acenter" width="18.66%"><p style="text-align:center">C<sub>2</sub></p></td> 
       <td class="custom-bottom-td acenter" width="18.65%"><p style="text-align:center">C<sub>3</sub></p></td> 
       <td class="custom-bottom-td acenter" width="18.66%"><p style="text-align:center">C<sub>4</sub></p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="25.38%"><p style="text-align:center">A<sub>1</sub></p></td> 
       <td class="custom-top-td acenter" width="18.65%"><p style="text-align:center">0.3666</p></td> 
       <td class="custom-top-td acenter" width="18.66%"><p style="text-align:center">0.4925</p></td> 
       <td class="custom-top-td acenter" width="18.65%"><p style="text-align:center">0.3637</p></td> 
       <td class="custom-top-td acenter" width="18.66%"><p style="text-align:center">0.5574</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="25.38%"><p style="text-align:center">A<sub>2</sub></p></td> 
       <td class="acenter" width="18.65%"><p style="text-align:center">0.6599</p></td> 
       <td class="acenter" width="18.66%"><p style="text-align:center">0.4222</p></td> 
       <td class="acenter" width="18.65%"><p style="text-align:center">0.5819</p></td> 
       <td class="acenter" width="18.66%"><p style="text-align:center">0.4180</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="25.38%"><p style="text-align:center">A<sub>3</sub></p></td> 
       <td class="acenter" width="18.65%"><p style="text-align:center">0.2933</p></td> 
       <td class="acenter" width="18.66%"><p style="text-align:center">0.6332</p></td> 
       <td class="acenter" width="18.65%"><p style="text-align:center">0.4364</p></td> 
       <td class="acenter" width="18.66%"><p style="text-align:center">0.6271</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="25.38%"><p style="text-align:center">A<sub>4</sub></p></td> 
       <td class="acenter" width="18.65%"><p style="text-align:center">0.5866</p></td> 
       <td class="acenter" width="18.66%"><p style="text-align:center">0.4222</p></td> 
       <td class="acenter" width="18.65%"><p style="text-align:center">0.5819</p></td> 
       <td class="acenter" width="18.66%"><p style="text-align:center">0.3484</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>For weight calculation using the entropy method, we used normalized method such that 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msubsup> 
           <mo>
             ∑ 
           </mo> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             m 
           </mi> 
          </msubsup> 
          <mrow> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </mstyle> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math>. Here, the number of criteria, m = 4. Following is the entropy weight coefficient discussed in Step 2, presented in <xref ref-type="table" rid="table7">
      Table 7
     </xref>.</p>
    <table-wrap id="table7">
     <label>
      <xref ref-type="table" rid="table7">
       Table 7
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 7. Criteria weight using is determined as follows.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="40.24%"><p style="text-align:center">Entropy weight method</p></td> 
       <td class="custom-bottom-td acenter" width="15.88%"><p style="text-align:center">C<sub>1</sub></p></td> 
       <td class="custom-bottom-td acenter" width="18.72%"><p style="text-align:center">C<sub>2</sub></p></td> 
       <td class="custom-bottom-td acenter" width="16.65%"><p style="text-align:center">C<sub>3</sub></p></td> 
       <td class="custom-bottom-td acenter" width="14.70%"><p style="text-align:center">C<sub>4</sub></p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="40.24%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              E 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mo>
             − 
           </mo> 
           <mi>
             k 
           </mi> 
           <mstyle displaystyle="true"> 
            <msubsup> 
             <mo>
               ∑ 
             </mo> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mo>
                = 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
             <mi>
               n 
             </mi> 
            </msubsup> 
            <mrow> 
             <msub> 
              <mi>
                q 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
             <mi>
               ln 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mrow> 
               <msub> 
                <mi>
                  q 
                </mi> 
                <mrow> 
                 <mi>
                   i 
                 </mi> 
                 <mi>
                   j 
                 </mi> 
                </mrow> 
               </msub> 
              </mrow> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </mstyle> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="15.88%"><p style="text-align:center">0.9863</p></td> 
       <td class="custom-top-td acenter" width="18.72%"><p style="text-align:center">0.9919</p></td> 
       <td class="custom-top-td acenter" width="16.65%"><p style="text-align:center">0.8823</p></td> 
       <td class="custom-top-td acenter" width="14.70%"><p style="text-align:center">0.9086</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="40.24%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              D 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              E 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="15.88%"><p style="text-align:center">0.0155</p></td> 
       <td class="acenter" width="18.72%"><p style="text-align:center">0.0155</p></td> 
       <td class="acenter" width="16.65%"><p style="text-align:center">0.00350</p></td> 
       <td class="acenter" width="14.70%"><p style="text-align:center">0.0137</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="40.24%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              W 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mrow> 
            <mrow> 
             <msub> 
              <mi>
                D 
              </mi> 
              <mi>
                j 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              / 
            </mo> 
            <mrow> 
             <mstyle displaystyle="true"> 
              <msubsup> 
               <mo>
                 ∑ 
               </mo> 
               <mrow> 
                <mi>
                  j 
                </mi> 
                <mo>
                  = 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
               <mi>
                 n 
               </mi> 
              </msubsup> 
              <mrow> 
               <msub> 
                <mi>
                  D 
                </mi> 
                <mi>
                  j 
                </mi> 
               </msub> 
              </mrow> 
             </mstyle> 
            </mrow> 
           </mrow> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="15.88%"><p style="text-align:center">0.2046</p></td> 
       <td class="acenter" width="18.72%"><p style="text-align:center">0.1520</p></td> 
       <td class="acenter" width="16.65%"><p style="text-align:center">0.4630</p></td> 
       <td class="acenter" width="14.70%"><p style="text-align:center">0.1804</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>In <xref ref-type="table" rid="table7">
      Table 7
     </xref>, Row 1, the value E<sub>j</sub> is calculated using Equation (2),</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mi>
         k 
       </mi> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            q 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <mi>
           ln 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              q 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math>. Therefore, the value of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> for 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> with respect to</p>
    <p>attributes A<sub>1</sub>, A<sub>2</sub>, A<sub>3</sub> and A<sub>4</sub> are 5/25, 7/25, 5/25, and 8/25, respectively.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is calculated as follows: 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <mo>
           − 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             0.20 
           </mn> 
           <mo>
             × 
           </mo> 
           <mi>
             ln 
           </mi> 
           <mn>
             0.20 
           </mn> 
           <mo>
             + 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             + 
           </mo> 
           <mn>
             0.32 
           </mn> 
           <mo>
             × 
           </mo> 
           <mi>
             ln 
           </mi> 
           <mn>
             0.32 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <mi>
           ln 
         </mi> 
         <mn>
           4 
         </mn> 
        </mrow> 
       </mrow> 
       <mo>
         = 
       </mo> 
      </mrow> 
     </math> 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         0.9863 
       </mn> 
      </mrow> 
     </math>. High entropy suggests that criteria with considerable variation across options play a more crucial role in decision-making.</p>
    <p>In <xref ref-type="table" rid="table7">
      Table 7
     </xref>, Row 2, following Equation (3), 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          D 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <mn>
         0.9863 
       </mn> 
       <mo>
         = 
       </mo> 
       <mn>
         0.0155 
       </mn> 
      </mrow> 
     </math>. In <xref ref-type="table" rid="table7">
      Table 7
     </xref>, Row 3, the weight, W<sub>j</sub> using Equation (4). 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            D 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
       <mo>
         = 
       </mo> 
       <mn>
         0.0155 
       </mn> 
       <mo>
         + 
       </mo> 
       <mn>
         0.0155 
       </mn> 
       <mo>
         + 
       </mo> 
       <mn>
         0.00350 
       </mn> 
       <mo>
         + 
       </mo> 
       <mn>
         0.0137 
       </mn> 
       <mo>
         = 
       </mo> 
       <mn>
         0.0757 
       </mn> 
      </mrow> 
     </math>. Thus, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          W 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <mn>
           0.0155 
         </mn> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <mn>
           0.0757 
         </mn> 
        </mrow> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mn>
         0.2046 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>To construct the weighted normalized decision matrix, as described in Step 3, the weight factors (determined in Step 2 and listed in the last row of <xref ref-type="table" rid="table7">
      Table 7
     </xref> multiplied with the normalized value 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (obtained in Step 1 and listed in <xref ref-type="table" rid="table6">
      Table 6
     </xref>) to produce the results shown in <xref ref-type="table" rid="table8">
      Table 8
     </xref>.</p>
    <table-wrap id="table8">
     <label>
      <xref ref-type="table" rid="table8">
       Table 8
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 8. Weighted normalized decision matrix.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="32.64%"><p style="text-align:center">Transport Mode</p></td> 
       <td class="custom-bottom-td acenter" width="20.56%"><p style="text-align:center">C<sub>1</sub></p></td> 
       <td class="custom-bottom-td acenter" width="17.80%"><p style="text-align:center">C<sub>2</sub></p></td> 
       <td class="custom-bottom-td acenter" width="19.51%"><p style="text-align:center">C<sub>3</sub></p></td> 
       <td class="custom-bottom-td acenter" width="15.43%"><p style="text-align:center">C<sub>4</sub></p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="32.64%"><p style="text-align:center">A<sub>1</sub></p></td> 
       <td class="custom-top-td acenter" width="20.56%"><p style="text-align:center">0.0750</p></td> 
       <td class="custom-top-td acenter" width="17.80%"><p style="text-align:center">0.0749</p></td> 
       <td class="custom-top-td acenter" width="19.51%"><p style="text-align:center">0.1684</p></td> 
       <td class="custom-top-td acenter" width="15.43%"><p style="text-align:center">0.1006</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="32.64%"><p style="text-align:center">A<sub>2</sub></p></td> 
       <td class="acenter" width="20.56%"><p style="text-align:center">0.1350</p></td> 
       <td class="acenter" width="17.80%"><p style="text-align:center">0.0642</p></td> 
       <td class="acenter" width="19.51%"><p style="text-align:center">0.2694</p></td> 
       <td class="acenter" width="15.43%"><p style="text-align:center">0.0754</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="32.64%"><p style="text-align:center">A<sub>3</sub></p></td> 
       <td class="acenter" width="20.56%"><p style="text-align:center">0.0600</p></td> 
       <td class="acenter" width="17.80%"><p style="text-align:center">0.0963</p></td> 
       <td class="acenter" width="19.51%"><p style="text-align:center">0.2021</p></td> 
       <td class="acenter" width="15.43%"><p style="text-align:center">0.1131</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="32.64%"><p style="text-align:center">A<sub>4</sub></p></td> 
       <td class="acenter" width="20.56%"><p style="text-align:center">0.1200</p></td> 
       <td class="acenter" width="17.80%"><p style="text-align:center">0.0642</p></td> 
       <td class="acenter" width="19.51%"><p style="text-align:center">0.2694</p></td> 
       <td class="acenter" width="15.43%"><p style="text-align:center">0.0629</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>In <xref ref-type="table" rid="table8">
      Table 8
     </xref>, we calculate the following equation: 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
       <mo>
         = 
       </mo> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            Q 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
       <mo>
         × 
       </mo> 
       <mo> 
       </mo> 
       <mover accent="true"> 
        <mrow> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mo stretchy="true">
          ˜ 
        </mo> 
       </mover> 
      </mrow> 
     </math>. Using values in <xref ref-type="table" rid="table6">
      Table 6
     </xref> and <xref ref-type="table" rid="table7">
      Table 7
     </xref>, the cell, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mn>
           11 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          A 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         × 
       </mo> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mrow> 
         <mi>
           w 
         </mi> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.3666 
       </mn> 
       <mo>
         × 
       </mo> 
       <mn>
         0.2046 
       </mn> 
       <mo>
         = 
       </mo> 
       <mn>
         0.0821 
       </mn> 
      </mrow> 
     </math>, given A<sub>1 </sub>(Trailer) and C<sub>1</sub> (Cost). The reference points discussed in Step 4 are the Positive Ideal Reference Point (v<sup>+</sup>) and Negative Ideal Reference Point (v<sup>−</sup>). From <xref ref-type="table" rid="table8">
      Table 8
     </xref>, the v<sup>+</sup> and v<sup>−</sup> are the maximum and minimum values corresponding to each criterion, shown in <xref ref-type="table" rid="table9">
      Table 9
     </xref>.</p>
    <table-wrap id="table9">
     <label>
      <xref ref-type="table" rid="table9">
       Table 9
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 9. Ideal reference points (positive, v<sup>+</sup> and negative, v<sup>−</sup>).</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="35.37%"><p style="text-align:center">Ideal reference points</p></td> 
       <td class="custom-bottom-td acenter" width="17.67%"><p style="text-align:center">C<sub>1</sub></p></td> 
       <td class="custom-bottom-td acenter" width="17.61%"><p style="text-align:center">C<sub>2</sub></p></td> 
       <td class="custom-bottom-td acenter" width="19.39%"><p style="text-align:center">C<sub>3</sub></p></td> 
       <td class="custom-bottom-td acenter" width="16.89%"><p style="text-align:center">C<sub>4</sub></p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="35.37%"><p style="text-align:center">v<sup>+</sup></p></td> 
       <td class="custom-top-td acenter" width="17.67%"><p style="text-align:center">0.1232</p></td> 
       <td class="custom-top-td acenter" width="17.61%"><p style="text-align:center">0.1424</p></td> 
       <td class="custom-top-td acenter" width="19.39%"><p style="text-align:center">0.1594</p></td> 
       <td class="custom-top-td acenter" width="16.89%"><p style="text-align:center">0.0978</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="35.37%"><p style="text-align:center">v<sup>−</sup></p></td> 
       <td class="acenter" width="17.67%"><p style="text-align:center">0.0821</p></td> 
       <td class="acenter" width="17.61%"><p style="text-align:center">0.0791</p></td> 
       <td class="acenter" width="19.39%"><p style="text-align:center">0.0996</p></td> 
       <td class="acenter" width="16.89%"><p style="text-align:center">0.2201</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>Criteria 2-3 are benefit criteria meaning the highest value is preferred. Criteria 1 is a cost criterion meaning the lowest value is preferred. Calculation in Step 5 represents the distance from the ideal reference points. The S<sub>i</sub><sup>+</sup> and S<sub>i</sub><sup>-</sup> follows the Equation (7a) and Equation 7(b).</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <munderover> 
          <mstyle mathsize="140%" displaystyle="true"> 
           <mo>
             ∑ 
           </mo> 
          </mstyle> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mi>
            n 
          </mi> 
         </munderover> 
         <msup> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                v 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msubsup> 
              <mi>
                v 
              </mi> 
              <mi>
                j 
              </mi> 
              <mo>
                + 
              </mo> 
             </msubsup> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </msup> 
        </mrow> 
       </msqrt> 
      </mrow> 
     </math> ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> from <xref ref-type="table" rid="table6">
      Table 6
     </xref>, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          v 
        </mi> 
        <mi>
          j 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> from <xref ref-type="table" rid="table7">
      Table 7
     </xref>)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <munderover> 
          <mstyle mathsize="140%" displaystyle="true"> 
           <mo>
             ∑ 
           </mo> 
          </mstyle> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mo>
             = 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mi>
            n 
          </mi> 
         </munderover> 
         <msup> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                v 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msubsup> 
              <mi>
                v 
              </mi> 
              <mi>
                j 
              </mi> 
              <mo>
                − 
              </mo> 
             </msubsup> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </msup> 
        </mrow> 
       </msqrt> 
      </mrow> 
     </math> ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> from <xref ref-type="table" rid="table6">
      Table 6
     </xref>, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          v 
        </mi> 
        <mi>
          j 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> from <xref ref-type="table" rid="table7">
      Table 7
     </xref>)</p>
    <p>The relative closeness of the alternate transport modes concerning S<sup>+</sup> and S<sup>−</sup> has been defined in Equation (8) as 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          U 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msubsup> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
          <mo>
            − 
          </mo> 
         </msubsup> 
        </mrow> 
        <mrow> 
         <msubsup> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
          <mo>
            + 
          </mo> 
         </msubsup> 
         <mo>
           + 
         </mo> 
         <msubsup> 
          <mi>
            S 
          </mi> 
          <mi>
            i 
          </mi> 
          <mo>
            − 
          </mo> 
         </msubsup> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> for 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         m 
       </mi> 
      </mrow> 
     </math>; 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         0 
       </mn> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         U 
       </mi> 
       <mo>
         ≤ 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>. Since S<sup>+</sup> &gt; 0 and S<sup>−</sup> &gt; 0, the relative closeness index, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. The 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          S 
        </mi> 
        <mi>
          i 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> and closeness index U<sub>i</sub>, in Step 6 for each alternate carrier mode ranking, is presented in <xref ref-type="table" rid="table10">
      Table 10
     </xref>.</p>
    <p>The selection of freight involves optimizing delivery time, cost, and the ability to transport products effectively. Factors like cost, timeliness, and damage prevention are key when choosing freight. As shown in <xref ref-type="table" rid="table8">
      Table 8
     </xref>, the Rail/Truck combo mode ranks number one, being the most economical, widely used, reliable, and flexible option with on-time service. In this numerical study, the COCF (Container on Container Freight) mode ranks second best, presenting a viable alternative to the Rail/Truck mode. As companies grow within their supply</p>
    <table-wrap id="table10">
     <label>
      <xref ref-type="table" rid="table10">
       Table 10
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134653-"></xref>Table 10. 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msubsup> 
   
          <mi>
           
    S
   
          </mi> 
   
          <mi>
           
    i
   
          </mi> 
   
          <mo>
           
    +
   
          </mo> 
  
         </msubsup> 
 
        </mrow>

       </math> and 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msubsup> 
   
          <mi>
           
    S
   
          </mi> 
   
          <mi>
           
    i
   
          </mi> 
   
          <mo>
           
    −
   
          </mo> 
  
         </msubsup> 
 
        </mrow>

       </math> for each transport carrier (distance from 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msubsup> 
   
          <mi>
           
    v
   
          </mi> 
   
          <mi>
           
    j
   
          </mi> 
   
          <mo>
           
    +
   
          </mo> 
  
         </msubsup> 
 
        </mrow>

       </math> and 

       <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msubsup> 
   
          <mi>
           
    v
   
          </mi> 
   
          <mi>
           
    j
   
          </mi> 
   
          <mo>
           
    −
   
          </mo> 
  
         </msubsup> 
 
        </mrow>

       </math>).</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="31.34%"><p style="text-align:center">Transport Mode</p></td> 
       <td class="custom-bottom-td acenter" width="22.75%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msubsup> 
            <mi>
              S 
            </mi> 
            <mi>
              i 
            </mi> 
            <mo>
              + 
            </mo> 
           </msubsup> 
          </mrow> 
         </math></p></td> 
       <td class="custom-bottom-td acenter" width="17.21%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msubsup> 
            <mi>
              S 
            </mi> 
            <mi>
              i 
            </mi> 
            <mo>
              − 
            </mo> 
           </msubsup> 
          </mrow> 
         </math></p></td> 
       <td class="custom-bottom-td acenter" width="18.99%"><p style="text-align:center">C<sub>i</sub></p></td> 
       <td class="custom-bottom-td acenter" width="18.23%"><p style="text-align:center">Rank</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="31.34%"><p style="text-align:center">A<sub>1</sub>: Trailer</p></td> 
       <td class="custom-top-td acenter" width="22.75%"><p style="text-align:center">0.1252</p></td> 
       <td class="custom-top-td acenter" width="17.21%"><p style="text-align:center">0.0223</p></td> 
       <td class="custom-top-td acenter" width="18.99%"><p style="text-align:center">0.1512</p></td> 
       <td class="custom-top-td acenter" width="18.23%"><p style="text-align:center">3</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="31.34%"><p style="text-align:center">A<sub>2</sub>: Rail/Truck</p></td> 
       <td class="acenter" width="22.75%"><p style="text-align:center">0.0345</p></td> 
       <td class="acenter" width="17.21%"><p style="text-align:center">0.1314</p></td> 
       <td class="acenter" width="18.99%"><p style="text-align:center">0.7922</p></td> 
       <td class="acenter" width="18.23%"><p style="text-align:center">1</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="31.34%"><p style="text-align:center">A<sub>3</sub>: Air/Truck</p></td> 
       <td class="acenter" width="22.75%"><p style="text-align:center">0.1127</p></td> 
       <td class="acenter" width="17.21%"><p style="text-align:center">0.0465</p></td> 
       <td class="acenter" width="18.99%"><p style="text-align:center">0.2922</p></td> 
       <td class="acenter" width="18.23%"><p style="text-align:center">4</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="31.34%"><p style="text-align:center">A<sub>4</sub>: COFC</p></td> 
       <td class="acenter" width="22.75%"><p style="text-align:center">0.0354</p></td> 
       <td class="acenter" width="17.21%"><p style="text-align:center">0.1278</p></td> 
       <td class="acenter" width="18.99%"><p style="text-align:center">0.7830</p></td> 
       <td class="acenter" width="18.23%"><p style="text-align:center">2</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>chain industries, they increasingly recognize the benefits of managing transportation processes through strategic contract negotiations and optimizing costs, reliability, time sensitivity, and carrier capabilities.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusions</title>
   <p>Modern trade requires extensive transportation links between producers and consumers for the seamless flow of goods to create value. This study explores using multimodal transportation for better logistics coordination. The TOPSIS method with entropy weighting helps choose the best carrier objectively. This approach is simple to understand yet reduces subjective decision-making in identifying weight priority in pursuing the best alternative along a network of facilities. The entropy method offers a promising alternative to address the limitations of fuzzy techniques in weight determination for transport selection.</p>
   <p>Transporting goods across the continent or interstate may use any primary mode of transportation, i.e., trailers, rail, air, or COFC options, depending on geographical location and customer service levels. The freight by rail/truck or COFC may be much cheaper but takes longer, necessitating companies to hold relatively large amounts of inventory in WIP to buffer against the resulting longer lead times and the inherent uncertainty associated with the carrier. In the illustrative example, the rail/truck option is preferable for freight moving. The solution takes advantage of modal flexibility and rail’s long-haul economic benefit.</p>
   <p>With the increasing computational power of computers, MCDM methods have become more accessible and user-friendly. This accessibility empowers various entities, from business corporations to logistics providers, to apply these methods in carrier selection. These methods enable businesses to identify the best option in terms of price, reliability, time, and flexibility, leading to significant cost savings and improved customer service. The flexibility of these methods allows businesses to align the criteria with their policies, market dynamics, customer demands, quality standards, and competitive advantages. The decision maker should consider the service capabilities of the carrier and their perspective weights, as services can vary widely between carriers. The preference rating of the criteria is based on the company values, historical data, and unbiased subjective assessment while developing the framework of the decision matrix. Other selection criteria and variables can be used, such as trip distances, the maximum legal capacity of transportation modes, infrastructures, cargo weight, operational cost, the total number of available vehicles, demand, and ability to accommodate product size or a particular product to obtain more precise results.</p>
   <p>Multimodal transportation leverages multiple forms of transport, holds the promise of being a cost-effective and environmentally friendly alternative to solo trailers. However, it faces challenges in growth, maintaining quality, and ensuring smooth operations across different transport modes. A future exercise could involve a sensitivity analysis of variables such as energy usage and fuel consumption (ton-miles per gallon of fuel), infrastructure, availability, and transport accessibility in the freight selection process.</p>
  </sec><sec id="s6">
   <title>Acknowledgements</title>
   <p>The author thanks the anonymous reviewers whose suggestions improved this paper and appreciates the support from the editor.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.134653-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Marzano, V., Tinessa, F., Fiori, C., Tocchi, D., Papola, A., Aponte, D., et al. (2022) Impacts of Truck Platooning on the Multimodal Freight Transport Market: An Exploratory Assessment on a Case Study in Italy. Transportation Research Part A: Policy and Practice, 163, 100-125. &gt;https://doi.org/10.1016/j.tra.2022.07.001
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Oudani, M. (2021) A Simulated Annealing Algorithm for Intermodal Transportation on Incomplete Networks. Applied Sciences, 11, Article 4467. &gt;https://doi.org/10.3390/app11104467
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bureau of Transportation Statistics (2024) Value of Shipments by Transportation Mode.&gt;https://www.bts.gov/browse-statistical-products-and-data/freight-facts-and-figures/value-shipments-transportation-mode 
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     European Commission (2024) Transport and the Green Deal.&gt;https://commission.europa.eu/strategy-and-policy/priorities-2019-2024/european-green-deal/transport-and-green-deal_en 
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mordor Intelligence (2024) China Freight and Logistics Market Size&amp;Share Analysis—Growth Trends&amp;Forecasts up to 2030.&gt;https://www.mordorintelligence.com/industry-reports/china-freight-and-logistics-market 
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     IMF BLOG (2024) How Latin America Can Use Trade to Boost Growth. &gt;https://www.imf.org/en/Blogs/Articles/2023/11/16/how-latin-america-can-use-trade-to-boost-growth 
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pamucar, D., Deveci, M., Gokasar, I., Martínez, L. and Köppen, M. (2022) Prioritizing Transport Planning Strategies for Freight Companies towards Zero Carbon Emission Using Ordinal Priority Approach. Computers&amp;Industrial Engineering, 169, Article ID; 108259. &gt;https://doi.org/10.1016/j.cie.2022.108259
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zavadskas, E.K. and Turskis, Z. (2011) Multiple Criteria Decision Making (MCDM) Methods in Economics: An Overview [Daugiatiksliai Sprendimų Priėmimo Metodai Ekonomikoje: Apžvalga]. Technological and Economic Development of Economy, 17, 397-427. &gt;https://doi.org/10.3846/20294913.2011.593291
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tuzkaya, U.R. and Önüt, S. (2008) A Fuzzy Analytic Network Process Based Approach to Transportation-Mode Selection between Türkiye and Germany: A Case Study. Information Sciences, 178, 3133-3146. &gt;https://doi.org/10.1016/j.ins.2008.03.015
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tuzkaya, G., Ozgen, A., Ozgen, D. and Tuzkaya, U.R. (2009) Environmental Performance Evaluation of Suppliers: A Hybrid Fuzzy Multi-Criteria Decision Approach. International Journal of Environmental Science&amp;Technology, 6, 477-490. &gt;https://doi.org/10.1007/bf03326087
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Awasthi, A., Chauhan, S.S., Omrani, H. and Panahi, A. (2011) A Hybrid Approach Based on SERVQUAL and Fuzzy TOPSIS for Evaluating Transportation Service Quality. Computers&amp;Industrial Engineering, 61, 637-646. &gt;https://doi.org/10.1016/j.cie.2011.04.019
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jahanshahloo, G.R., Lotfi, F.H. and Izadikhah, M. (2006) An Algorithmic Method to Extend TOPSIS for Decision-Making Problems with Interval Data. Applied Mathematics and Computation, 175, 1375-1384. &gt;https://doi.org/10.1016/j.amc.2005.08.048
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Abo-Sinna, M.A. and Amer, A.H. (2005) Extensions of TOPSIS for Multi-Objective Large-Scale Nonlinear Programming Problems. Applied Mathematics and Computation, 162, 243-256. &gt;https://doi.org/10.1016/j.amc.2003.12.087
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhao, Q.H., Chen, S., Leung, S.C.H. and Lai, K.K. (2010) Integration of Inventory and Transportation Decisions in a Logistics System. Transportation Research Part E: Logistics and Transportation Review, 46, 913-925. &gt;https://doi.org/10.1016/j.tre.2010.03.001
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Macharis, C., Meers, D. and Lier, T.V. (2015) Modal Choice in Freight Transport: Combining Multi-Criteria Decision Analysis and Geographic Information Systems. International Journal of Multicriteria Decision Making, 5, 355-371. &gt;https://doi.org/10.1504/ijmcdm.2015.074087
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kaewfak, K., Ammarapala, V. and Huynh, V. (2021) Multi-Objective Optimization of Freight Route Choices in Multimodal Transportation. International Journal of Computational Intelligence Systems, 14, 794-807. &gt;https://doi.org/10.2991/ijcis.d.210126.001
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Oudani, M. (2023) A Combined Multi-Objective Multi Criteria Approach for Blockchain-Based Synchromodal Transportation. Computers&amp;Industrial Engineering, 176, Article ID: 108996. &gt;https://doi.org/10.1016/j.cie.2023.108996
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pomerol, J. and Barba-Romero, S. (2000) Multicriterion Decision in Practice. In: Pomerol, J. and Barba-Romero, S., Eds., Multicriterion Decision in Management, Springer, 299-326. &gt;https://doi.org/10.1007/978-1-4615-4459-3_11
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Singh, R.K. and Benyoucef, L. (2011) A Fuzzy TOPSIS Based Approach for E-Sourcing. Engineering Applications of Artificial Intelligence, 24, 437-448. &gt;https://doi.org/10.1016/j.engappai.2010.09.006
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saaty, T.L. (1980) The Analytic Hierarchy Process. McGraw-Hill.
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Charnes, A., Cooper, W.W. and Rhodes, E. (1978) Measuring the Efficiency of Decision Making Units. European Journal of Operational Research, 2, 429-444. &gt;https://doi.org/10.1016/0377-2217(78)90138-8
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hwang, C.L. and Yoon, K. (1981) Multiple Attribute Decision Making Methods and Applications. Springer.
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zadeh, L.A. (1965) Fuzzy Sets. Information and Control, 8, 338-353. &gt;https://doi.org/10.1016/s0019-9958(65)90241-x
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Charnes, A. and Cooper, W.W. (1977) Goal Programming and Multiple Objective Optimizations. European Journal of Operational Research, 1, 39-54. &gt;https://doi.org/10.1016/s0377-2217(77)81007-2
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ju-Long, D. (1982) Control Problems of Grey Systems. Systems&amp;Control Letters, 1, 288-294. &gt;https://doi.org/10.1016/s0167-6911(82)80025-x
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saaty, T.L. (1996), Decision Making with Dependence and Feedback: The Analytic Network Process. RWS Publications.
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kolodner, J.L. (1994) Understanding Creativity: A Case-Based Approach. In: Wess, S., Althoff, K.D. and Richter, M.M., Eds., Topics in Case-Based Reasoning, Springer, 1-20. &gt;https://doi.org/10.1007/3-540-58330-0_73
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Brans, J.P. (1982) Lingenierie de la Decision. Elaboration DinstrumentsDaide a la Decision, Methode PROMETHEE. In: Nadeau, R. and Landry, M. (Eds.), Laide a la Decision: Nature, Instruments et Perspectives Davenir, de Universite Laval, 183-214.
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Roy, B. (1968) Classement et choix en présence de points de vue multiples. Revue française d’informatique et de recherche opérationnelle, 2, 57-75. &gt;https://doi.org/10.1051/ro/196802v100571
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref30">
    <label>30</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Opricovic, S. (1998) Multicriteria Optimization of Civil Engineering Systems [Vi-sekriterijumskaoptimizacijasistema u gradjevinarstvu]. Faculty of Civil Engineering.
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref31">
    <label>31</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ibnoulouafi, E.M., Oudani, M., Aouam, T. and Ghogho, M. (2022) Intermodal Green P-Hub Median Problem with Incomplete Hub-network. Sustainability, 14, Article 11714. &gt;https://doi.org/10.3390/su141811714
    </mixed-citation>
   </ref>
   <ref id="scirp.134653-ref32">
    <label>32</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tavasszy, L. and de Jong, G. (2014) Introduction. In: Tavasszy, L. and de Jong, G., Eds., Modelling Freight Transport, Elsevier, 1-12. &gt;https://doi.org/10.1016/b978-0-12-410400-6.00001-x
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>