<?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">
    ojapps
   </journal-id>
   <journal-title-group>
    <journal-title>
     Open Journal of Applied Sciences
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2165-3917
   </issn>
   <issn publication-format="print">
    2165-3925
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/ojapps.2025.156108
   </article-id>
   <article-id pub-id-type="publisher-id">
    ojapps-143211
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Biomedical 
     </subject>
     <subject>
       Life Sciences, Chemistry 
     </subject>
     <subject>
       Materials Science, Computer Science 
     </subject>
     <subject>
       Communications, Engineering, Physics 
     </subject>
     <subject>
       Mathematics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Research on the Satisfaction Evaluation of High-Speed Railway Passenger Service Based on the Vague Set
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Xi
      </surname>
      <given-names>
       Chen
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Mei
      </surname>
      <given-names>
       Deng
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Xiaoyu
      </surname>
      <given-names>
       Deng
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Dengheng
      </surname>
      <given-names>
       Zheng
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref> 
     <xref ref-type="aff" rid="aff3"> 
      <sup>3</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aSchool of Transportation and Logistics, Guangzhou Railway Polytechnic, Guangzhou, China
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aSchool of Earth Science and Engineering, Sun Yat-sen University, Guangzhou, China
    </addr-line> 
   </aff> 
   <aff id="aff3">
    <addr-line>
     aGuangdong Provincial Key Laboratory of Mineral Resources&amp;Geological Processes, Guangzhou, China
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     12
    </day> 
    <month>
     06
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    15
   </volume> 
   <issue>
    06
   </issue>
   <fpage>
    1565
   </fpage>
   <lpage>
    1579
   </lpage>
   <history>
    <date date-type="received">
     <day>
      15,
     </day>
     <month>
      May
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      9,
     </day>
     <month>
      May
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      9,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </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>
    With the rapid development of high-speed railways, improving passenger service satisfaction has become an important issue facing the railway sector. Aiming at the limitations of a single evaluation method and high cost of questionnaire survey, this study constructs a high-speed railway passenger service satisfaction evaluation model based on the Vague set theory. Through the analysis of passenger demand, a complete evaluation system including three first-level indicators of station service, on-board service and extended service, as well as eight second-level indicators such as ticket service, crew service and urban traffic connection service, is established. The index is quantified based on the Vague set language variable, and the weight is determined by the expert scoring method. The model-solving algorithm is designed to realize the multi-dimensional comprehensive evaluation of service satisfaction by calculating the fitness and confidence interval of the target satisfaction criterion. The research results show that the model can effectively identify service shortcomings, provide a theoretical basis for optimizing the layout of station facilities, improving crew response capabilities, and improving emergency public services, and promote the transformation of railway passenger transport services to passenger-centric. 
   </abstract>
   <kwd-group> 
    <kwd>
     High Speed Railway
    </kwd> 
    <kwd>
      Passenger Service Satisfaction
    </kwd> 
    <kwd>
      Vague Set
    </kwd> 
    <kwd>
      Evaluation Model
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>With the improvement of people’s living standards, high-speed railways with the advantages of high running speed, high safety, high punctuality, comfort and environmental protection have been rapidly popularized in China, and even developed into other countries <xref ref-type="bibr" rid="scirp.143211-1">
     [1]
    </xref>-<xref ref-type="bibr" rid="scirp.143211-3">
     [3]
    </xref>. Compared with the ordinary speed railway, high-speed railway has the advantages of advanced equipment and facilities, higher comprehensive quality of crew, and passengers’ demand for high-speed railway passenger service quality is also higher, which requires high-speed railway passenger service personnel to fully adhere to the ‘people-oriented’ principle. In order to improve the service level, many developed countries will continue to do the passenger satisfaction questionnaire survey, and according to the results of the statistical analysis, they will make improvements and suggestions as soon as possible <xref ref-type="bibr" rid="scirp.143211-4">
     [4]
    </xref> <xref ref-type="bibr" rid="scirp.143211-5">
     [5]
    </xref>.</p>
   <p>The evaluation method of the passenger service satisfaction index is widely used in many fields. Domestic and foreign scholars have widely used this evaluation method in the field of transportation, and achieved good results, mainly including service satisfaction analysis and modeling, passenger service quality research, questionnaire design and investigation, evaluation methods <xref ref-type="bibr" rid="scirp.143211-6">
     [6]
    </xref>-<xref ref-type="bibr" rid="scirp.143211-10">
     [10]
    </xref>. However, there are still some limitations in the current research. Most of the research basically adopts fuzzy comprehensive evaluation or analytic hierarchy process, and the model is relatively simple. There is no better combination of the railway passenger service market and more advanced and reasonable model <xref ref-type="bibr" rid="scirp.143211-11">
     [11]
    </xref>. The collection method of the questionnaire has the disadvantages of great limitations, great difficulty in research, and more financial and material resources <xref ref-type="bibr" rid="scirp.143211-12">
     [12]
    </xref>; most of the research is based on the quality of service as the main evaluation target, but not the passenger satisfaction as the final foothold, can not better reflect the railway passenger service sector “people-oriented” principles and purposes <xref ref-type="bibr" rid="scirp.143211-13">
     [13]
    </xref>.</p>
   <p>The main transportation markets at home and abroad are railways, aviation and highways. The core of its competition is the quality of transportation services. However, some passenger demand has not been fully considered by the railway passenger transport department, and the passenger demand trend has not been accurately grasped <xref ref-type="bibr" rid="scirp.143211-14">
     [14]
    </xref>. Therefore, it is the only way for the development of railway passenger transport to carry out the satisfaction evaluation of high-speed railway passenger transport service in time, comprehensively and objectively evaluate the quality of high-speed railway passenger transport service, find out the defects and deficiencies in the service process, and continuously improve the satisfaction of railway passenger transport service. It is also an inevitable requirement to urge the transformation of railway passenger transport service to passenger-centered.</p>
   <p>In order to improve the competitiveness of railways in the industry, it is necessary to evaluate the satisfaction of passenger service objectively and truly, fully consider the demand of passenger transport, and make up for the defects in the service process. Therefore, the establishment of a high-speed railway passenger service satisfaction evaluation system can not only comprehensively and objectively reflect the current situation of the railway passenger service department, find specific deficiencies and defects, but also propose better designs and solutions through analysis of deficiencies. It has a strong guiding significance for improving the quality of railway passenger service, improving passenger ride comfort, and promoting modern unified management.</p>
   <p>In summary, based on the evaluation of high-speed railway passenger service satisfaction as an important part of railway passenger transport management, this study analyzes the demand for high-speed railway passenger service, quantifies the corresponding evaluation indicators according to the passenger travel demand classification, and uses Vague set to establish the high-speed railway passenger service satisfaction model. At the same time, the method of determining the index weight and the algorithm of Vague set model are systematically expounded. The research results help to better find the shortcomings of railway passenger transport services, help high-speed railway passenger transport service departments to improve their service quality faster, improve passenger travel comfort and convenience, improve passenger service satisfaction, and then enhance the competitiveness of the railway transport industry in the transport market.</p>
  </sec><sec id="s2">
   <title>2. Analysis of High-Speed Railway Passenger Service Demand</title>
   <p>In the process of selecting the evaluation model index of high-speed railway passenger service satisfaction, it is necessary to start with the demand of passenger travel to better improve passenger travel satisfaction. According to the different attributes of the service, the high-speed railway passenger service can be divided into transportation production demand and non-transportation production demand. According to the classification of the places where the service is provided, the high-speed railway passenger service can be divided into car service, car service and extended service demand. This study mainly analyzes the passenger service demand of high-speed railway from three aspects: station service, on-board service and extended service demand.</p>
   <sec id="s2_1">
    <title>2.1. Station Service Requirements</title>
    <p>The station is the basis of high-speed railway passenger transport, and the only way for passengers to travel. The station service requirements mainly include:</p>
    <p>1) Ticketing service: mainly includes the window ticketing service and the ticketing service of the vending machine. Ticketing services mainly include ticket purchase, ticket change, ticket refund, whether the station window is sufficient, whether the passenger ticket purchase is fast and convenient.</p>
    <p>2) Station infrastructure services: mainly including whether the security channel is convenient and safe; whether the automatic lift escalator and ticket checking channel are fast; whether the key passengers (old, young, sick, disabled, pregnant, etc.) are equipped with barrier-free facilities and special channels; whether the commercial stores in the station meet the various needs of passengers, including catering, specialty, charging facilities, mobile phone payment, entertainment facilities.</p>
    <p>3) Passenger station information guidance service: After entering the station, passengers need to go through the process of purchasing tickets-security check-waiting-boarding, which requires the coordination of signs, broadcasts and staff in the station. Scientific and reasonable guidance of passengers in the station, optimization of passenger station walking streamline design, and improve passenger travel satisfaction.</p>
   </sec>
   <sec id="s2_2">
    <title>2.2. On-Board Service Requirements</title>
    <p>The means of transportation for railway passenger travel is the train, and the service quality on the train will greatly affect passenger travel satisfaction. On-board service requirements mainly include:</p>
    <p>1) Crew service demand: Crew plays a vital role in high-speed passenger service, mainly including whether the passenger service can welcome passengers, remind passengers to get on and off on time, whether the etiquette is dignified, whether the behavior is elegant, whether the hygiene in the car can be cleaned up in time, and whether the emergency can be dealt with in a timely and effective manner.</p>
    <p>2) In-car equipment and facilities services: mainly including seat space and comfort, in-car restaurants, toilets, emergency switches and other signs are obvious. Secondly, whether it can provide wireless networks and wired charging sockets.</p>
    <p>3) Train catering service: Train catering service is a major feature of high-speed railway passenger service. Passengers mainly focus on the quality, price and sanitary conditions of catering, and secondly, consider the taste characteristics of passengers, the differences between the North and the South, and the differences between ethnic minorities. Establishing a reasonable meal time and scientific meat and vegetable collocation is not only conducive to improving the catering efficiency of enterprises but also to improving passenger travel satisfaction.</p>
    <p>4) Train other business services: mainly including wireless networks, television, movies, music radio, newspapers and magazines, and trolley snacks retail. These business services allow passengers to experience the same comfort as home during the ride, and can make the body and mind relax.</p>
   </sec>
   <sec id="s2_3">
    <title>2.3. Extended Service Requirements</title>
    <p>The extended service of high-speed railway passenger transport mainly includes two aspects: after-ride service and social public service. After-ride service refers to the extended service including booking service, travel planning service, transportation service, transfer service and so on, which is formulated considering the needs of passengers after taking the bus. Among them, booking services include booking hotels, booking parking spaces, booking restaurants and other services. Travel planning service refers to the travel plan provided for tourists, out-of-office and so on. Transportation service refers to the service of consigning passengers with large goods to the destination of the city. Transfer service refers to the convenient channel or guidance service provided for transferring to other trains, civil aviation or other urban transportation modes. Social public services mainly refer to that when facing sudden natural disasters (such as freezing disasters, floods, public health disasters, etc.), railway enterprise employees need to use perfect public crisis safety awareness, master basic crisis prevention measures, and improve public satisfaction with enterprise services.</p>
   </sec>
  </sec><sec id="s3">
   <title>3. High-Speed Railway Passenger Service Satisfaction Model Index Establishment and Quantification</title>
   <sec id="s3_1">
    <title>3.1. Establishment of Service Satisfaction Evaluation Index</title>
    <p>According to the analysis results of high-speed railway passenger service demand and the psychological experience and psychological needs of passengers, the service satisfaction evaluation index is divided into three first-level indicators: station service, on-board service and extended service. The index system is shown in <xref ref-type="fig" rid="fig1">
      Figure 1
     </xref>.</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.143211-"></xref>Figure 1. High-speed railway passenger service satisfaction evaluation index system.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2313182-rId12.jpeg?20250612103024" />
    </fig>
    <p>As a first-level indicator, station service mainly includes ticket purchase service, station infrastructure service and passenger information guidance service. Among them, the ticketing service refers to the railway department providing passengers who need to travel with ticketing, change, refund, exemption and other services. At present, the main ways to provide services are online ticketing and station ticketing hall offline ticketing. If passengers purchase tickets at the station, the layout of ticketing hall and window the length of waiting time for ticketing are also important aspects related to customer satisfaction. Therefore, the convenience of ticketing service is included in the secondary sub-index of station service; in view of the station infrastructure service, we should focus on whether the design of infrastructure is humanized, whether it can provide passengers with a comfortable waiting environment, and passengers on high-speed railways may pay more attention to whether the access of luggage parcels is convenient and fast, which is also an important part of customer satisfaction. Therefore, the infrastructure service of the station should be included in the secondary index of the station service; for high-speed railway stations, more attention should be paid to the work of passenger guide services. For example, by adopting advanced multimedia technology or painting significant signs in important locations, it is very convenient for passengers to find and use service facilities in the station, and guide passengers to quickly take a drop or transfer train. Whether the station staff can effectively alleviate or ease the passenger flow gathering place, whether the volunteer service in the station is in place, etc., will affect the intuitive feelings and experiences of passengers entering the station and getting on the train. Therefore, it is of great significance to put forward the information guidance service in the passenger station as the secondary index of the station service.</p>
    <p>As a first-level indicator, in-vehicle service mainly includes in-vehicle crew service, in-vehicle facilities and equipment service, and in-vehicle catering service. Crew service mainly refers to whether high-speed railway train attendants can serve passengers with dignified etiquette and sweet smiles, and master the ability of emergencies, when passengers have an emergency situation, whether they can deal with it first time, whether the crew can guide passengers well, and whether the crew has emergency ability and first aid knowledge at a critical moment. It can be seen that the service status of the crew is one of the important factors for people to choose high-speed rail as the preferred tool for travel. Therefore, the crew service is regarded as a secondary index of on-board service. In-car facilities and equipment services mainly include in-car seat guidance signs, toilet signs, whether the car is spacious and bright, whether the seat is comfortable, whether it uses a wireless network or a charging socket, etc. These factors are related to whether the passenger’s perception is good, and have reference value for improving the passenger’s ride satisfaction. Therefore, in-car facilities and equipment services are used as a secondary indicator of other in-car services. For passengers, they are more concerned about the catering service, including whether the drinking water facilities are perfect, whether the catering price is reasonable, whether the catering food standards are safe and sanitary, and so on. Passengers are more concerned about the dining on the car, so the in-car catering service is taken as the third secondary indicator of the on-board service.</p>
    <p>As a first-level indicator, extended services mainly include urban traffic connection services and social public services. Urban traffic connection service refers to the fact that different modes of transportation are often connected to each other near the railway station, which helps passengers to complete the seamless transfer of various modes of transportation. The planning and construction of high-speed rail passenger station should try to realize the intersection and docking of different modes of transportation, so that passengers can transfer quickly and conveniently through elevators, escalators or automatic walking channels without leaving the station. This way also affects passengers’ satisfaction with high-speed rail travel, so urban traffic connection service is taken as a secondary indicator of extended service. Social public services mainly include the emergency strategy and efficiency of railway passenger transport departments in the face of sudden disasters. Social public services are also of concern to the majority of passengers. The high-speed rail department should establish a crisis early warning, prevention and preparation mechanism for stations and squares, and formulate emergency plans for different events. Therefore, it is used as a secondary indicator of extended services.</p>
   </sec>
   <sec id="s3_2">
    <title>3.2. Basic Operations of Vague Sets</title>
    <p>The main purpose of Vague set model is to assist decision-making. Decision-making is defined as the process of analyzing and evaluating the methods evaluated by one or more methods and selecting the optimal scheme. In human production and life, decisions are encountered all the time. Only by adopting appropriate methods and evaluating the decision-making results can we improve the efficiency of enterprises and enhance the competitiveness of enterprises in the industry. When decision-makers make decisions, they first quickly capture decision-making information, then transform decision-making information into fuzzy values or intervals, and then establish corresponding decision-making auxiliary models. Finally, according to the decision-making results of the model, the most reasonable solution is selected.</p>
    <p>
     <xref ref-type="bibr" rid="scirp.143211-"></xref>Firstly, let 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        X 
      </mi> 
     </math> be the object space of a point fixed point, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         X 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            3 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            n 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, that is, any element in the set can be represented by 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math>. A Vague set in the definition 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        X 
      </mi> 
     </math> is represented by a false membership function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and a true membership function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, respectively. Here, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> represents the lower bound of the negative membership degree, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> represents the upper bound of the negative membership degree. Each point in 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> corresponds to each real number in the range of value interval [0, 1] one by one, as follows :</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
       <mtr> 
        <mtd> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
         <mo>
           : 
         </mo> 
         <mi>
           X 
         </mi> 
         <mo>
           → 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <mn>
             0 
           </mn> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
         <mo>
           : 
         </mo> 
         <mi>
           X 
         </mi> 
         <mo>
           → 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <mn>
             0 
           </mn> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math></p>
    <p>
     <xref ref-type="bibr" rid="scirp.143211-"></xref>where, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         0 
       </mn> 
       <mo>
         ≤ 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mo>
         ≤ 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>. 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          π 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            x 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the relative scale of the element 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        x 
      </mi> 
     </math> in Vague sets, which shows the uncertainty of the element 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        x 
      </mi> 
     </math> in Vague sets 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        A 
      </mi> 
     </math>.</p>
    <p>Assuming that Vague set is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        A 
      </mi> 
     </math>, when 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        X 
      </mi> 
     </math> is continuous, we get:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <mrow> 
         <msub> 
          <mo>
            ∫ 
          </mo> 
          <mi>
            x 
          </mi> 
         </msub> 
         <mrow> 
          <mrow> 
           <mrow> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 t 
               </mi> 
               <mrow> 
                <mi>
                  A 
                </mi> 
                <mrow> 
                 <mo>
                   ( 
                 </mo> 
                 <mi>
                   x 
                 </mi> 
                 <mo>
                   ) 
                 </mo> 
                </mrow> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <mn>
                1 
              </mn> 
              <mo>
                − 
              </mo> 
              <msub> 
               <mi>
                 f 
               </mi> 
               <mrow> 
                <mi>
                  A 
                </mi> 
                <mrow> 
                 <mo>
                   ( 
                 </mo> 
                 <mi>
                   x 
                 </mi> 
                 <mo>
                   ) 
                 </mo> 
                </mrow> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             / 
           </mo> 
           <mi>
             x 
           </mi> 
          </mrow> 
         </mrow> 
        </mrow> 
       </mstyle> 
       <mo>
         , 
       </mo> 
       <mi>
         x 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mi>
         X 
       </mi> 
      </mrow> 
     </math></p>
    <p>When 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        X 
      </mi> 
     </math> is discrete, we get:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <munderover> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </munderover> 
        <mrow> 
         <mrow> 
          <mrow> 
           <mrow> 
            <mo>
              [ 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                t 
              </mi> 
              <mrow> 
               <mi>
                 A 
               </mi> 
               <mrow> 
                <mo>
                  ( 
                </mo> 
                <mrow> 
                 <msub> 
                  <mi>
                    x 
                  </mi> 
                  <mi>
                    i 
                  </mi> 
                 </msub> 
                </mrow> 
                <mo>
                  ) 
                </mo> 
               </mrow> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                f 
              </mi> 
              <mrow> 
               <mi>
                 A 
               </mi> 
               <mrow> 
                <mo>
                  ( 
                </mo> 
                <mrow> 
                 <msub> 
                  <mi>
                    x 
                  </mi> 
                  <mi>
                    i 
                  </mi> 
                 </msub> 
                </mrow> 
                <mo>
                  ) 
                </mo> 
               </mrow> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ] 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            / 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
         </mrow> 
        </mrow> 
       </mstyle> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mi>
         X 
       </mi> 
      </mrow> 
     </math></p>
    <p>From the above definition, the membership 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        x 
      </mi> 
     </math> of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        A 
      </mi> 
     </math> can be expressed in three dimensions, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            π 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, They indicate the degree of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         x 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mi>
         A 
       </mi> 
      </mrow> 
     </math> support and opposition.</p>
    <p>For example, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           0.3 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mn>
           0.4 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, which means that the interpretation of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        x 
      </mi> 
     </math> in Vague set A is as follows: the true membership degree of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        x 
      </mi> 
     </math> in set A is 0.2, the false membership degree of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        x 
      </mi> 
     </math> in set A is 0.4, and the membership degree of uncertain factors is 0.1. The result in the analogy to the voting model is: 3 votes in favor, 4 votes against, and 1 abstention.</p>
    <p>According to the research of domestic and foreign scholars on the above theory, it is necessary to find a positive correlation strategy and a negative correlation strategy. The positive correlation strategy represents the optimal value of the attributes of the options to be selected, and the negative correlation strategy represents the lowest value of each option. The difference between the positive correlation strategy and the negative correlation strategy is analyzed and compared, and then sorted. The specific steps are as follows <xref ref-type="bibr" rid="scirp.143211-15">
      [15]
     </xref>-<xref ref-type="bibr" rid="scirp.143211-18">
      [18]
     </xref>.</p>
    <p>1) A multi-objective decision-making problem is defined. The scheme set 
     <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> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            n 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is defined, and the corresponding scheme attribute set is 
     <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> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            C 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            C 
          </mi> 
          <mi>
            n 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. Therefore, the decision matrix 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              C 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
           <mo>
             , 
           </mo> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                t 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                f 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <mi>
           n 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> of the scheme set A in the decision attribute set C is obtained.</p>
    <p>2) Define positive and negative correlation strategies:</p>
    <p>Positive correlation strategy: 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          A 
        </mi> 
        <mo>
          + 
        </mo> 
       </msup> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mn>
              1 
            </mn> 
            <mo>
              + 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mn>
              1 
            </mn> 
            <mo>
              + 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mn>
              2 
            </mn> 
            <mo>
              + 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mn>
              2 
            </mn> 
            <mo>
              + 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mn>
              3 
            </mn> 
            <mo>
              + 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mn>
              3 
            </mn> 
            <mo>
              + 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mi>
              m 
            </mi> 
            <mo>
              + 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mi>
              m 
            </mi> 
            <mo>
              + 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>Negative correlation strategy: 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          A 
        </mi> 
        <mo>
          − 
        </mo> 
       </msup> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mn>
              1 
            </mn> 
            <mo>
              − 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mn>
              1 
            </mn> 
            <mo>
              − 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mn>
              2 
            </mn> 
            <mo>
              − 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mn>
              2 
            </mn> 
            <mo>
              − 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mn>
              3 
            </mn> 
            <mo>
              − 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mn>
              3 
            </mn> 
            <mo>
              − 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
           </msubsup> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              f 
            </mi> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>Where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          t 
        </mi> 
        <mi>
          j 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
       <mo>
         − 
       </mo> 
       <msubsup> 
        <mi>
          f 
        </mi> 
        <mi>
          j 
        </mi> 
        <mo>
          + 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <mi>
         max 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <msubsup> 
        <mi>
          t 
        </mi> 
        <mi>
          j 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
       <mo>
         − 
       </mo> 
       <msubsup> 
        <mi>
          f 
        </mi> 
        <mi>
          j 
        </mi> 
        <mo>
          − 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <mi>
         min 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             j 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>3) Using Vague set difference formula:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         d 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mrow> 
         <mn>
           2 
         </mn> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </mfrac> 
       <mstyle displaystyle="true"> 
        <munderover> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            k 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           m 
         </mi> 
        </munderover> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                t 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                t 
              </mi> 
              <mi>
                j 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
           <mo>
             + 
           </mo> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                f 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                f 
              </mi> 
              <mi>
                j 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
           <mo>
             + 
           </mo> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                π 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                π 
              </mi> 
              <mi>
                j 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math></p>
    <p>4) The closeness degree of two related indexes of Vague set is calculated, and the optimal scheme is selected according to the closeness degree.</p>
    <p>The Vague set model used in this paper is based on the relative optimal membership. Firstly, the basic matrix is transformed into the optimal membership matrix, and then the weight of each Vague value is calculated. Finally, the expert scoring method is used to rank the results of the scheme, and the comprehensive evaluation of passenger service satisfaction is realized.</p>
    <p>Suppose that 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         X 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            3 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            n 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        A 
      </mi> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        B 
      </mi> 
     </math> are two Vague sets on 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        X 
      </mi> 
     </math>, then the following conclusions hold:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mi>
         B 
       </mi> 
       <mo>
         ⇔ 
       </mo> 
       <mo>
         ∀ 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mi>
         X 
       </mi> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mi>
          A 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mi>
          B 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          A 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          B 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <munderover> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </munderover> 
        <mrow> 
         <mrow> 
          <mrow> 
           <mrow> 
            <mo>
              [ 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                t 
              </mi> 
              <mrow> 
               <mi>
                 A 
               </mi> 
               <mrow> 
                <mo>
                  ( 
                </mo> 
                <mrow> 
                 <msub> 
                  <mi>
                    x 
                  </mi> 
                  <mi>
                    i 
                  </mi> 
                 </msub> 
                </mrow> 
                <mo>
                  ) 
                </mo> 
               </mrow> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                f 
              </mi> 
              <mrow> 
               <mi>
                 A 
               </mi> 
               <mrow> 
                <mo>
                  ( 
                </mo> 
                <mrow> 
                 <msub> 
                  <mi>
                    x 
                  </mi> 
                  <mi>
                    i 
                  </mi> 
                 </msub> 
                </mrow> 
                <mo>
                  ) 
                </mo> 
               </mrow> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ] 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            / 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
         </mrow> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         + 
       </mo> 
       <mi>
         B 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              A 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             + 
           </mo> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              B 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              A 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              B 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               A 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               B 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mtext>
           
       </mtext> 
       <mo>
         · 
       </mo> 
       <mtext>
           
       </mtext> 
       <mi>
         B 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              A 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              B 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               A 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               B 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
           <mo>
             + 
           </mo> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               A 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               B 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         ∪ 
       </mo> 
       <mi>
         B 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mo>
           ∨ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              A 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              B 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mo>
           ∧ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               A 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               B 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         ∩ 
       </mo> 
       <mi>
         B 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mo>
           ∧ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              A 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mi>
              B 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                x 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mo>
           ∨ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               A 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mi>
               B 
             </mi> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                x 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>Here, “ 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mo>
        ∧ 
      </mo> 
     </math>” denotes the minimum value and “ 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mo>
        ∨ 
      </mo> 
     </math>” denotes the maximum value.</p>
    <p>Suppose 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> of Vague value, then the definition of Vague value is:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            x 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         k 
       </mi> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msup> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                t 
              </mi> 
              <mi>
                x 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mi>
            k 
          </mi> 
         </msup> 
         <mo>
           , 
         </mo> 
         <msup> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                f 
              </mi> 
              <mi>
                x 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mi>
            k 
          </mi> 
         </msup> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <mi>
         k 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msubsup> 
          <mi>
            t 
          </mi> 
          <mi>
            x 
          </mi> 
          <mi>
            η 
          </mi> 
         </msubsup> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msubsup> 
          <mi>
            f 
          </mi> 
          <mi>
            x 
          </mi> 
          <mi>
            η 
          </mi> 
         </msubsup> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <mi>
         η 
       </mi> 
       <mo>
         &gt; 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math></p>
   </sec>
  </sec><sec id="s4">
   <title>4. High-Speed Railway Passenger Service Satisfaction Evaluation Model Based on Vague Set</title>
   <sec id="s4_1">
    <title>4.1. Determination of Vague Set Language Variables and Priority Membership Matrix</title>
    <p>If we make a comprehensive evaluation of a thing with high uncertainty, it is not appropriate to use accurate values to represent the preferences of decision makers. Here, we use a term set to represent, that is, Vague set language variables, which can easily determine the relative priority of the target in order to obtain the optimal solution <xref ref-type="bibr" rid="scirp.143211-19">
      [19]
     </xref>.</p>
    <p>Therefore, the set of linguistic terms represented by Vague values is shown in <xref ref-type="table" rid="table1">
      Table 1
     </xref>. It should be noted that according to the actual situation, it can also be divided into different levels, such as seven or nine.</p>
    <table-wrap id="table1">
     <label>
      <xref ref-type="table" rid="table1">
       Table 1
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.143211-"></xref>Table 1. Vague values with ten-level linguistic variables.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="28.02%"><p style="text-align:center">Order of evaluation</p></td> 
       <td class="custom-bottom-td acenter" width="21.99%"><p style="text-align:center">Value ranges</p></td> 
       <td class="custom-bottom-td acenter" width="25.00%"><p style="text-align:center">The value of typical Vague sets</p></td> 
       <td class="custom-bottom-td acenter" width="25.00%"><p style="text-align:center">Abstention value</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="28.02%"><p style="text-align:center">Absolutely good</p></td> 
       <td class="custom-top-td acenter" width="21.99%"><p style="text-align:center">[1, 1]</p></td> 
       <td class="custom-top-td acenter" width="25.00%"><p style="text-align:center">[1, 1]</p></td> 
       <td class="custom-top-td acenter" width="25.00%"><p style="text-align:center">0</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Very good</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.9, 1)</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.9, 0.95]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.05</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Good</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.85, 0.9]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.8, 0.9]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.1</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Better</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.7, 0.85]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.7, 0.85]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.15</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Medium good</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.6, 0.8]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.6, 0.8]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.2</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Medium</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.5, 0.5]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.5, 0.5]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Medium difference</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.45, 0.6]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.4, 0.6]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.2</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Poor</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.3, 0.45]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.3, 0.45]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.15</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">difference</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0.15, 0.3]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.2, 0.3]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.1</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Very poor</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">(0, 0.15]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0.1, 0.15]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0.05</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="28.02%"><p style="text-align:center">Absolute difference</p></td> 
       <td class="acenter" width="21.99%"><p style="text-align:center">[0, 0]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">[0, 0]</p></td> 
       <td class="acenter" width="25.00%"><p style="text-align:center">0</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>Firstly, the function 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is used to estimate the fitness of the scheme to the decision maker, that is:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         C 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         t 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         − 
       </mo> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         C 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>Assume that represents the fitness of scheme 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          A 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> under the condition criterion 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math>, then there is:</p>
    <p>
     <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> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           i 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math></p>
    <p>At this time, the fitness matrix of the criterion for the current scheme is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          N 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mo>
           ∗ 
         </mo> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>.</p>
    <p>Where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         1 
       </mn> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         i 
       </mi> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         m 
       </mi> 
       <mo>
         , 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         j 
       </mi> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         n 
       </mi> 
      </mrow> 
     </math>.</p>
    <p>Using Vague’s own language to represent the first-order language variables. Then, the relative fitness of each target is determined, so that the main characteristics of the target are fully displayed. At this time, the calculation results can be approximated to the relative membership of Vague. The following matrix is shown:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          M 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mtable> 
          <mtr> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                X 
              </mi> 
              <mrow> 
               <mn>
                 11 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mo>
              ⋯ 
            </mo> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                X 
              </mi> 
              <mrow> 
               <mn>
                 1 
               </mn> 
               <mi>
                 n 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mo>
              ⋮ 
            </mo> 
           </mtd> 
           <mtd> 
            <mo>
              ⋱ 
            </mo> 
           </mtd> 
           <mtd> 
            <mo>
              ⋮ 
            </mo> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                X 
              </mi> 
              <mrow> 
               <mi>
                 m 
               </mi> 
               <mn>
                 1 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mo>
              ⋯ 
            </mo> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                X 
              </mi> 
              <mrow> 
               <mi>
                 m 
               </mi> 
               <mi>
                 n 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
          </mtr> 
         </mtable> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
   </sec>
   <sec id="s4_2">
    <title>4.2. Quantification of Service Satisfaction Evaluation Index Based on Passenger Demand</title>
    <p>Through the value of the above Vague set, the service satisfaction evaluation index is corresponding to it, that is, the passenger determines the corresponding Vague value interval by rating the index, so as to realize the quantification of the evaluation index. When conducting a questionnaire survey on passengers, if passengers believe that a service is defective or missing, it needs to be improved, indicating that passengers are not satisfied with the service; if the passenger thinks that a service is particularly good, the passenger is very satisfied; if the passenger thinks that a service is general, but it is still acceptable, indicating that the passenger is basically satisfied with the service; if a passenger thinks that a service is good, but not particularly worthy of praise, it indicates that the passenger is satisfied with the service. Accordingly, we simplify the evaluation level into four levels: very satisfied, satisfied, basically satisfied, and dissatisfied. As shown in <xref ref-type="table" rid="table2">
      Table 2
     </xref> below.</p>
    <table-wrap id="table2">
     <label>
      <xref ref-type="table" rid="table2">
       Table 2
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.143211-"></xref>Table 2. Evaluation index grade and vague value corresponding table.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="25.78%"><p style="text-align:center">Index</p></td> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Order of evaluation</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">The value of typical Vague sets</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">Ticketing service</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">Station infrastructure services</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="acenter" width="25.78%"><p style="text-align:center">Passenger station information guidance service</p></td> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">Crew service</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">In-vehicle facilities and equipment services</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">In-car catering service</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">Urban traffic connection service</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="custom-bottom-td acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="25.78%"><p style="text-align:center">Social public service</p></td> 
       <td class="custom-top-td acenter" width="36.72%"><p style="text-align:center">Very satisfied</p></td> 
       <td class="custom-top-td acenter" width="37.50%"><p style="text-align:center">(0.8, 1]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.6, 0.8]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Basically satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.4, 0.6]</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="36.72%"><p style="text-align:center">Not satisfied</p></td> 
       <td class="acenter" width="37.50%"><p style="text-align:center">(0.1, 0.4]</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>Further, the weight of each index is determined by the method of expert ranking, that is, each index is quantified and scored by means of expert scoring, and then each index is refined according to the degree of influence on service satisfaction. Taking the content evaluated in this paper as an example, the indexes are ranked and scored. Finally, the following <xref ref-type="table" rid="table3">
      Table 3
     </xref> is obtained (taking station service as an example):</p>
    <table-wrap id="table3">
     <label>
      <xref ref-type="table" rid="table3">
       Table 3
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.143211-"></xref>Table 3. Expert scoring table.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="43.70%"><p style="text-align:center">Index</p></td> 
       <td class="custom-bottom-td acenter" width="13.15%"><p style="text-align:center">Expert 1</p></td> 
       <td class="custom-bottom-td acenter" width="13.15%"><p style="text-align:center">Expert 2</p></td> 
       <td class="custom-bottom-td acenter" width="13.15%"><p style="text-align:center">Expert 3</p></td> 
       <td class="custom-bottom-td acenter" width="13.15%"><p style="text-align:center">Expert 4</p></td> 
       <td class="custom-bottom-td acenter" width="13.15%"><p style="text-align:center">Expert 5</p></td> 
       <td class="custom-bottom-td acenter" width="13.15%"><p style="text-align:center">Expert 6</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td aleft" width="43.70%"><p style="text-align:left">ticketing service</p></td> 
       <td class="custom-top-td acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               11 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               12 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               13 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               14 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               15 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="custom-top-td acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               16 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="43.70%"><p style="text-align:left">Station infrastructure services</p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               21 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               22 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               23 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               24 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               25 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               26 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="43.70%"><p style="text-align:left">Passenger station information guidance service</p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               31 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               32 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               33 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               34 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               35 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
       <td class="acenter" width="13.15%"><p style="text-align:center"> 
         <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mn>
               36 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
         </math></p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>The calculation method of the secondary index weight is as follows:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <munder> 
           <mo>
             ∑ 
           </mo> 
           <mi>
             j 
           </mi> 
          </munder> 
          <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </mstyle> 
        </mrow> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <munder> 
           <mo>
             ∑ 
           </mo> 
           <mi>
             i 
           </mi> 
          </munder> 
          <mrow> 
           <mstyle displaystyle="true"> 
            <munder> 
             <mo>
               ∑ 
             </mo> 
             <mi>
               j 
             </mi> 
            </munder> 
            <mrow> 
             <msub> 
              <mi>
                w 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
           </mstyle> 
          </mrow> 
         </mstyle> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math></p>
    <p>Among them, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        i 
      </mi> 
     </math> represents the indicators, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> represents the weight of the second-level indicators of item 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        i 
      </mi> 
     </math>, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> represents the scoring of item 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        i 
      </mi> 
     </math> by the 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        j 
      </mi> 
     </math> expert. Thus, the weight of the ticket service index is calculated as follows:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mtext>
           ticketing service 
         </mtext> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mrow> 
           <mn>
             11 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mrow> 
           <mn>
             12 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mrow> 
           <mn>
             13 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mrow> 
           <mn>
             14 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mrow> 
           <mn>
             15 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            w 
          </mi> 
          <mrow> 
           <mn>
             16 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <munder> 
           <mo>
             ∑ 
           </mo> 
           <mn>
             3 
           </mn> 
          </munder> 
          <mrow> 
           <mstyle displaystyle="true"> 
            <munder> 
             <mo>
               ∑ 
             </mo> 
             <mn>
               6 
             </mn> 
            </munder> 
            <mrow> 
             <msub> 
              <mi>
                w 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
           </mstyle> 
          </mrow> 
         </mstyle> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math></p>
    <p>Similarly, the ownership weight of the second-level indicators of the same level is obtained, and the weights of all first-level indicators are obtained.</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. Solving Algorithm of Vague Set Model</title>
    <p>Let 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
      </mrow> 
     </math> the weight ratio of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          q 
        </mi> 
       </msub> 
      </mrow> 
     </math> is mainly 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          p 
        </mi> 
       </msub> 
      </mrow> 
     </math>, where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          p 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mi>
          p 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>The main steps are as follows:</p>
    <p>1) Calculate the fitness of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          A 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math> satisfying each criterion:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mrow> 
           <msub> 
            <mi>
              n 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             k 
           </mi> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           = 
         </mo> 
         <mo>
           ∂ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ∂ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           + 
         </mo> 
         <mo>
           ∂ 
         </mo> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mo>
           = 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             + 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             + 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           + 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             + 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          ω 
        </mi> 
        <mrow> 
         <mi>
           C 
         </mi> 
         <mi>
           s 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mo>
         ∂ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msubsup> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
          <mo>
            ∗ 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msubsup> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
          <mo>
            ∗ 
          </mo> 
         </msubsup> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>2) According to the following formula, the fitness of target 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          A 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> satisfying each criterion is calculated:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <msub> 
          <mi>
            T 
          </mi> 
          <mrow> 
           <msub> 
            <mi>
              n 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             k 
           </mi> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            e 
          </mi> 
          <mi>
            l 
          </mi> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           = 
         </mo> 
         <mi>
           θ 
         </mi> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mi>
           θ 
         </mi> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           + 
         </mo> 
         <mi>
           θ 
         </mi> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mo>
           = 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           + 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
            <mo>
              ∗ 
            </mo> 
           </msubsup> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mi>
           C 
         </mi> 
         <mi>
           s 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         θ 
       </mi> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msubsup> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
          <mo>
            ∗ 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msubsup> 
          <mi>
            t 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
          <mo>
            ∗ 
          </mo> 
         </msubsup> 
         <mo>
           + 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>3) From the above, the optimal membership of each criterion is obtained, and then the confidence interval of the current index is calculated:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           = 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           k 
         </mi> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <msub> 
        <mi>
          c 
        </mi> 
        <mi>
          l 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mtable columnalign="left"> 
         <mtr> 
          <mtd> 
           <msub> 
            <mi>
              ω 
            </mi> 
            <mrow> 
             <msub> 
              <mi>
                n 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
             <mo>
               = 
             </mo> 
             <mi>
               j 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               k 
             </mi> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <msub> 
            <mi>
              c 
            </mi> 
            <mi>
              l 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mfrac> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                T 
              </mi> 
              <mrow> 
               <msub> 
                <mi>
                  n 
                </mi> 
                <mn>
                  1 
                </mn> 
               </msub> 
               <mo>
                 = 
               </mo> 
               <mi>
                 j 
               </mi> 
               <mo>
                 , 
               </mo> 
               <mi>
                 k 
               </mi> 
               <mo>
                 , 
               </mo> 
               <mo>
                 ⋯ 
               </mo> 
               <mo>
                 , 
               </mo> 
               <mi>
                 p 
               </mi> 
              </mrow> 
             </msub> 
             <msub> 
              <mi>
                c 
              </mi> 
              <mi>
                l 
              </mi> 
             </msub> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mrow> 
               <msub> 
                <mi>
                  A 
                </mi> 
                <mi>
                  i 
                </mi> 
               </msub> 
              </mrow> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
            <mn>
              2 
            </mn> 
           </mfrac> 
           <mo>
             , 
           </mo> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <msub> 
            <mi>
              ω 
            </mi> 
            <mrow> 
             <msub> 
              <mi>
                n 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
             <mo>
               = 
             </mo> 
             <mi>
               j 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               k 
             </mi> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <msub> 
            <mi>
              c 
            </mi> 
            <mi>
              l 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             + 
           </mo> 
           <mfrac> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                T 
              </mi> 
              <mrow> 
               <msub> 
                <mi>
                  n 
                </mi> 
                <mn>
                  1 
                </mn> 
               </msub> 
               <mo>
                 = 
               </mo> 
               <mi>
                 j 
               </mi> 
               <mo>
                 , 
               </mo> 
               <mi>
                 k 
               </mi> 
               <mo>
                 , 
               </mo> 
               <mo>
                 ⋯ 
               </mo> 
               <mo>
                 , 
               </mo> 
               <mi>
                 p 
               </mi> 
              </mrow> 
             </msub> 
             <msub> 
              <mi>
                c 
              </mi> 
              <mi>
                l 
              </mi> 
             </msub> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mrow> 
               <msub> 
                <mi>
                  A 
                </mi> 
                <mi>
                  i 
                </mi> 
               </msub> 
              </mrow> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
            <mn>
              2 
            </mn> 
           </mfrac> 
          </mtd> 
         </mtr> 
        </mtable> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mi>
           C 
         </mi> 
         <mi>
           s 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mtable columnalign="left"> 
         <mtr> 
          <mtd> 
           <msub> 
            <mi>
              R 
            </mi> 
            <mrow> 
             <mi>
               C 
             </mi> 
             <mi>
               s 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             − 
           </mo> 
           <mfrac> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                T 
              </mi> 
              <mrow> 
               <msub> 
                <mrow></mrow> 
                <mrow> 
                 <mi>
                   C 
                 </mi> 
                 <mi>
                   s 
                 </mi> 
                </mrow> 
               </msub> 
              </mrow> 
             </msub> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mrow> 
               <msub> 
                <mi>
                  A 
                </mi> 
                <mi>
                  i 
                </mi> 
               </msub> 
              </mrow> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
            <mn>
              2 
            </mn> 
           </mfrac> 
           <mo>
             , 
           </mo> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <msub> 
            <mi>
              W 
            </mi> 
            <mrow> 
             <mi>
               C 
             </mi> 
             <mi>
               s 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             + 
           </mo> 
           <mfrac> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               − 
             </mo> 
             <msub> 
              <mi>
                T 
              </mi> 
              <mrow> 
               <msub> 
                <mrow></mrow> 
                <mrow> 
                 <mi>
                   C 
                 </mi> 
                 <mi>
                   s 
                 </mi> 
                </mrow> 
               </msub> 
              </mrow> 
             </msub> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mrow> 
               <msub> 
                <mi>
                  A 
                </mi> 
                <mi>
                  i 
                </mi> 
               </msub> 
              </mrow> 
              <mo>
                ) 
              </mo> 
             </mrow> 
            </mrow> 
            <mn>
              2 
            </mn> 
           </mfrac> 
          </mtd> 
         </mtr> 
        </mtable> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           = 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           k 
         </mi> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <msub> 
        <mi>
          c 
        </mi> 
        <mi>
          l 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mi>
           C 
         </mi> 
         <mi>
           s 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         i 
       </mi> 
       <mo>
         ≤ 
       </mo> 
       <mi>
         m 
       </mi> 
      </mrow> 
     </math>.</p>
    <p>4) Determine the sort function to define, determine the minimum, maximum, and intermediate:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mi>
           min 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         min 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mrow> 
           <msub> 
            <mi>
              n 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             k 
           </mi> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            C 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           − 
         </mo> 
         <mfrac> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              T 
            </mi> 
            <mrow> 
             <msub> 
              <mi>
                n 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
             <mo>
               = 
             </mo> 
             <mi>
               j 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               k 
             </mi> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </mfrac> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            W 
          </mi> 
          <mrow> 
           <mi>
             C 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           − 
         </mo> 
         <mfrac> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              T 
            </mi> 
            <mrow> 
             <mi>
               C 
             </mi> 
             <mi>
               s 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </mfrac> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mi>
           max 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         max 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mrow> 
           <msub> 
            <mi>
              n 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             k 
           </mi> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            C 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <mfrac> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              T 
            </mi> 
            <mrow> 
             <msub> 
              <mi>
                n 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
             <mo>
               = 
             </mo> 
             <mi>
               j 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               k 
             </mi> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </mfrac> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            W 
          </mi> 
          <mrow> 
           <mi>
             C 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <mfrac> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msub> 
            <mi>
              T 
            </mi> 
            <mrow> 
             <mi>
               C 
             </mi> 
             <mi>
               s 
             </mi> 
            </mrow> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                A 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </mfrac> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mtext>
           center 
         </mtext> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            A 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         max 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            ω 
          </mi> 
          <mrow> 
           <msub> 
            <mi>
              n 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
           <mo>
             = 
           </mo> 
           <mi>
             j 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             k 
           </mi> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            C 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            W 
          </mi> 
          <mrow> 
           <mi>
             C 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>5) Finally, according to the decision maker’s attitude towards risk, the maximum-minimum method is adopted, that is, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         max 
       </mi> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            R 
          </mi> 
          <mrow> 
           <mtext>
             min 
           </mtext> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>; the maximum-midway method, that is, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         max 
       </mi> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            R 
          </mi> 
          <mrow> 
           <mtext>
             center 
           </mtext> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              A 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> sorts each scheme to select the optimal scheme.</p>
    <p>In summary, this method first calculates the fitness of each objective to meet the criteria according to the two ranking functions of Vague value, then defines the confidence interval of each objective to meet the criteria according to the fitness, and then defines the weighted minimum, maximum and intermediate ranking functions of the scheme according to the confidence interval. Finally, according to the different attitudes of decision makers to risks, conservative decision makers use the maximum-minimum method, aggressive decision makers use the maximum-maximum method, and neutral decision makers use the maximum-middle method to rank each scheme to select the optimal scheme.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusions</title>
   <p>1) Based on the analysis of high-speed railway passenger service demand, the service satisfaction evaluation index system is established, including three first-level indicators of station service, on-board service and extended service, and eight second-level indicators of ticketing service, station infrastructure service, passenger information guidance service, crew service, in-vehicle facilities and equipment service, in-vehicle catering service, urban traffic connection service and social public service.</p>
   <p>2) Combined with the characteristics of high-speed railway passenger service, the Vague set theory and technical methods are introduced. The concept, basic operation and research status of Vague set are summarized and analyzed, and its applicability in the satisfaction evaluation of high-speed railway passenger service is illustrated.</p>
   <p>3) A high-speed railway passenger service satisfaction evaluation model based on Vague set is established, and the algorithm of index weight and the solution method of the model are determined. The model should calculate the fitness of each objective to meet the criteria according to the two ranking functions of Vague value, then define the confidence interval of each objective to meet the criteria according to the fitness, and then define the weighted minimum, maximum and intermediate ranking functions of the scheme according to the confidence interval, so as to select the final optimal scheme.</p>
  </sec><sec id="s6">
   <title>Acknowledgements</title>
   <p>This research was supported by the Foundation for 2024 Guangzhou Railway Polytechnic’s “Double Hundred Action” project and Education Integration Project (No.1201241012).</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.143211-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sun, L. (2022) Study on Evaluation Index System of Passenger Service Quality Study on Evaluation Index System of Passenger Service Quality. Science&amp;Technology Information, 20, 239-241.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Eboli, L., Fu, Y. and Mazzulla, G. (2016) Multilevel Comprehensive Evaluation of the Railway Service Quality. Procedia Engineering, 137, 21-30. 
     <u>&gt;https://doi.org/10.1016/j.proeng.2016.01.230</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, D., Wu, G., Li, Y.H., et al. (2017) Review on Passenger Service Management Research. Journal of Transportation Engineering and Information, 15, 14-20, 28.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yang, Y., Zhang, X., Gao, D., Xu, X. and Zheng, B. (2023) Research on Choice Preference of Parallel Trains for High-Speed Rail Heterogeneous Passengers. Transportation Research Record: Journal of the Transportation Research Board, 2678, 841-854. 
     <u>&gt;https://doi.org/10.1177/03611981231192995</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pawar, S., Tandyekkal, A. and Gaddam, H.K. (2025) Point Based System for Assessing Passenger Level of Service at Public Transport Terminals: A Railway Case Study. Transportation Research Procedia, 82, 1753-1770. 
     <u>&gt;https://doi.org/10.1016/j.trpro.2024.12.153</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, Y.L. (2020) Research on the Index System of Technical and Economic Evaluation of Integrated Transport Services. Ph.D. Thesis, Chang’an University.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, J.Q. (2019) Selection of Optimal Travel Mode of Public Transport under Competitive Condition. Journal of highway and transportation research and development, 36, 121-127.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yuan, Y. and Chen, J. (2023) Passenger Satisfaction Evaluation of High-Speed Railway Station Based on Bayesian Network. 3rd International Conference on Internet of Things and Smart City (IoTSC 2023), Chongqing, 24-26 March 2023, e12708. 
     <u>&gt;https://doi.org/10.1117/12.2683907</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Shan, X., Zhang, Z., Ning, F., Li, S. and Dai, L. (2023) Application and Realization of Key Technologies in China Railway E-Ticketing System. Railway Sciences, 2, 140-156. 
     <u>&gt;https://doi.org/10.1108/rs-01-2023-0005</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Prahara, E. and Putri, L. (2024) The Analysis of Passenger’s Facilities Level of Service on Jakarta—Bogor Commuter Line’s Stations Using PTV Viswalk. IOP Conference Series: Earth and Environmental Science, 1324, Article ID: 012004. 
     <u>&gt;https://doi.org/10.1088/1755-1315/1324/1/012004</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Velastegui-Hernández, R., Melo-Fiallos, D., Mayorga-Ases, M., Hernández-Del-Salto, S., Manobanda-Tenelema, E. and Garcia, M.V. (2024) Perceived Quality of Service in Tourist Transportation in the City of Baños De Agua Santa, Ecuador. Sustainability, 16, Article 7245. 
     <u>&gt;https://doi.org/10.3390/su16177245</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dong, W., Qi, R., Wang, D., Zhang, W. and Liu, X. (2025) Service Quality Assessment and Optimization of High-Speed Railway Waiting Halls Using a Kano Model and Multidimensional Questionnaire Analysis. Buildings, 15, Article 1212. 
     <u>&gt;https://doi.org/10.3390/buildings15081212</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Khademi-Vidra, A., Nemecz, G. and Mária Bakos, I. (2024) Satisfaction Measurement in the Sustainable Public Transport of Budapest. Transportation Research Interdisciplinary Perspectives, 23, Article ID: 100989. 
     <u>&gt;https://doi.org/10.1016/j.trip.2023.100989</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sun, Z., Wang, L., Zhu, X. and Chi, M. (2024) Service Quality Evaluation for High-Speed Rail Express Transportation with EAHP. In: Qin, Y., Jia, L., Yang, J., Diao, L., Yao, D. and An, M., Eds., Proceedings of the 6th International Conference on Electrical Engineering and Information Technologies for Rail Transportation (EITRT) 2023, Springer, 202-210. 
     <u>&gt;https://doi.org/10.1007/978-981-99-9311-6_22</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     He, J.L. (2019) Evaluation of Emergency Capability of Dangerous Air Cargo Transportation Ground Accident Based on PSR-Vague Set. Journal of Binzhou University, 35, 33-39.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lian, X.M. (2021) The Risk Management Method of Tunnel Engineering Based in Vague Set Fuzzy Decision Model. Ph.D. Thesis, Tianjin University.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, J., Liu, S. and Zhang, J. (2005) An Extension of TOPSIS for Fuzzy MCDM Based on Vague Set Theory. Journal of Systems Science and Systems Engineering, 14, 73-84. 
     <u>&gt;https://doi.org/10.1007/s11518-006-0182-y</u>
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, W. and Yu, B.G. (2014) Theory and Application Study on Modified TOPSIS Method Based on Vague Soft Set. Computer Engineering and Applications, 50, 214-218.
    </mixed-citation>
   </ref>
   <ref id="scirp.143211-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, C., Wu, P. and Huang, D.J. (2013) Research on Credit Rating Evaluation of Technology-Based Small and Medium-Sized Enterprises Based on Fuzzy Set Theory. Science and Technology Progress and Policy, 30, 170-176.
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>