<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1d1 20130915//EN" "http://jats.nlm.nih.gov/publishing/1.1d1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="research-article" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">JTSCM</journal-id>
<journal-title-group>
<journal-title>Journal of Transport and Supply Chain Management</journal-title>
</journal-title-group>
<issn pub-type="ppub">2310-8789</issn>
<issn pub-type="epub">1995-5235</issn>
<publisher>
<publisher-name>AOSIS</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">JTSCM-11-267</article-id>
<article-id pub-id-type="doi">10.4102/jtscm.v11i0.267</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Original Research</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A multi-objective fuzzy mathematical approach for sustainable reverse supply chain configuration</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Darbari</surname>
<given-names>Jyoti D.</given-names>
</name>
<xref ref-type="aff" rid="AF0001">1</xref>
</contrib>
<contrib contrib-type="author">
<contrib-id contrib-id-type="orcid">http://orcid.org/0000-0003-4577-773X</contrib-id>
<name>
<surname>Agarwal</surname>
<given-names>Vernika</given-names>
</name>
<xref ref-type="aff" rid="AF0001">1</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yadavalli</surname>
<given-names>Venkata S.S.</given-names>
</name>
<xref ref-type="aff" rid="AF0002">2</xref>
</contrib>
<contrib contrib-type="author">
<contrib-id contrib-id-type="orcid">http://orcid.org/0000-0002-4107-0991</contrib-id>
<name>
<surname>Galar</surname>
<given-names>Diego</given-names>
</name>
<xref ref-type="aff" rid="AF0003">3</xref>
</contrib>
<contrib contrib-type="author">
<contrib-id contrib-id-type="orcid">http://orcid.org/0000-0002-1709-511X</contrib-id>
<name>
<surname>Jha</surname>
<given-names>Prakash C.</given-names>
</name>
<xref ref-type="aff" rid="AF0001">1</xref>
</contrib>
<aff id="AF0001"><label>1</label>Department of Operational Research, University of Delhi, India</aff>
<aff id="AF0002"><label>2</label>Department of Industrial and Systems Engineering, University of Pretoria, South Africa</aff>
<aff id="AF0003"><label>3</label>Division of Operation and Maintenance Engineering, Lule&#x00E5; University of Technology, Sweden</aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><bold>Corresponding author:</bold> Jyoti Darbari, <email xlink:href="jydbr@hotmail.com">jydbr@hotmail.com</email></corresp>
<fn><p><bold>How to cite this article:</bold> Darbari, J.D., Agarwal, V., Yadavalli, V.S.S., Galar, D. &#x0026; Jha, P.C., 2017, &#x2018;A multi-objective fuzzy mathematical approach for sustainable reverse supply chain configuration&#x2019;, <italic>Journal of Transport and Supply Chain Management</italic> 11(0), a267. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4102/jtscm.v11i0.267">https://doi.org/10.4102/jtscm.v11i0.267</ext-link></p></fn>
</author-notes>
<pub-date pub-type="epub"><day>27</day><month>03</month><year>2017</year></pub-date>
<pub-date pub-type="collection"><year>2017</year></pub-date>
<volume>11</volume>
<issue>0</issue>
<elocation-id>267</elocation-id>
<history>
<date date-type="received"><day>04</day><month>09</month><year>2016</year></date>
<date date-type="accepted"><day>16</day><month>12</month><year>2016</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2017. The Authors</copyright-statement>
<copyright-year>2017</copyright-year>
<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.0/">
<license-p>Licensee: AOSIS. This work is licensed under the Creative Commons Attribution License.</license-p>
</license>
</permissions>
<abstract>
<sec id="st1">
<title>Background</title>
<p>Designing and implementation of reverse logistics (RL) network which meets the sustainability targets have been a matter of emerging concern for the electronics companies in India.</p>
</sec>
<sec id="st2">
<title>Objectives</title>
<p>The present study developed a two-phase model for configuration of sustainable RL network design for an Indian manufacturing company to manage its end-of-life and end-of-use electronic products. The notable feature of the model was the evaluation of facilities under financial, environmental and social considerations and integration of the facility selection decisions with the network design.</p>
</sec>
<sec id="st3">
<title>Method</title>
<p>In the first phase, an integrated Analytical Hierarchical Process Complex Proportional Assessment methodology was used for the evaluation of the alternative locations in terms of their degree of utility, which in turn was based on the three dimensions of sustainability. In the second phase, the RL network was configured as a bi-objective programming problem, and fuzzy optimisation approach was utilised for obtaining a properly efficient solution to the problem.</p>
</sec>
<sec id="st4">
<title>Results</title>
<p>The compromised solution attained by the proposed fuzzy model demonstrated that the cost differential for choosing recovery facilities with better environmental and social performance was not significant; therefore, Indian manufacturers must not compromise on the sustainability aspects for facility location decisions.</p>
</sec>
<sec id="st5">
<title>Conclusion</title>
<p>The results reaffirmed that the bi-objective fuzzy decision-making model can serve as a decision tool for the Indian manufacturers in designing a sustainable RL network. The multi-objective optimisation model captured a reasonable trade-off between the fuzzy goals of minimising the cost of the RL network and maximising the sustainable performance of the facilities chosen.</p>
</sec>
</abstract>
</article-meta>
</front>
<body>
<sec id="s0001">
<title>Introduction</title>
<p>Resource depletion and e-waste generation through electronics use have reached an alarming stage in developing countries, posing a serious threat to the environment and human health (Wath, Dutt &#x0026; Chakrabarti <xref ref-type="bibr" rid="CIT0046">2011</xref>:260). During the last decade, there has been an exponential increase in the use of electronics in India, and most of these are discarded irresponsibly by consumers (Wath et al. <xref ref-type="bibr" rid="CIT0046">2011</xref>:252). In the framework of sustainable development, discarding the electronics products that are no longer in use by their original users is not a viable option (Achillas et al. <xref ref-type="bibr" rid="CIT0002">2010</xref>:870). Reverse logistics (RL) has gained immense relevance in this regard, as it plays a crucial role in utilising the residual value still existing in the discarded electronics. Disposing off the unwanted parts and materials responsibly is having a positive impact on the environment (Khor et al. <xref ref-type="bibr" rid="CIT0026">2016</xref>:97; Mutha &#x0026; Pokharel <xref ref-type="bibr" rid="CIT0033">2009</xref>:334). Though government regulations and policies in India require Original Electronics Manufacturers (OEMs) to incorporate sustainable recovery strategies for extending the entire life cycle of their products, consumer returns are still not managed by manufacturers but mostly by an informal sector involving &#x2018;kabadiwallahs&#x2019;, recyclers and dismantlers (Dwivedy &#x0026; Mittal <xref ref-type="bibr" rid="CIT0017">2012</xref>:230). Lack of government support and awareness among manufacturers, as well as consumers, are some of the major reasons for the disinterest of OEMs in India towards developing an efficient recovery system (Ravi &#x0026; Shankar <xref ref-type="bibr" rid="CIT0036">2015</xref>:887). The implementation of RL can be a costly endeavour as it involves the processes of collection, refurbishing, disassembly and reprocessing. Therefore, OEMs prefer outsourcing all the RL operations to specialised third-party reverse logistics providers (3PRLPs) (Subramoniam, Huisingh &#x0026; Chinnam <xref ref-type="bibr" rid="CIT0042">2010</xref>:1577). However, firms can seek to perform the RL operations independently or jointly with 3PRLs to gain maximum benefits from the returns (Agarwal et al. <xref ref-type="bibr" rid="CIT0004">2016</xref>:481).</p>
<p>Recent years have witnessed the growing interest of OEMs in redesigning their logistics network for managing the RL activities sustainably. Although deriving maximum economic benefits from the returns is the primary objective of RL, it inherently helps in creating a positive impact on the environment and society. Incorporating strategic recovery decisions within their logistics network can also help manufacturers enhance their bottom line. To begin with the process of implementation, it is fundamental for the OEM to focus on establishing new recovery facilities (RFs) and expanding existing facilities. The selection of location for setting up of facilities across the supply chain (SC) is an important decision, as it entails long-term cost obligations on the firms (Ertu&#x011F;rul <xref ref-type="bibr" rid="CIT0018">2011</xref>:725). The right choice of location can assist the firm in gaining a competitive edge while simultaneously improving on the operational performance, not only in the short term but also in the long term. In this regard, the present article aims to contribute further to the area of RL network design problems, integrating optimal facility location decisions for creating a sustainable channel for consumer returns. Furthermore, in view of the growing concern for sustainable development, it has become increasingly important for the firms to incorporate all the sustainability factors in facility location decision making (Chen, Olhager &#x0026; Tang <xref ref-type="bibr" rid="CIT0012">2014</xref>:155). In this context, the main focus of the present work is to develop a mathematical model for designing a sustainable RL network from the OEM&#x2019;s perspective wherein the collection, inspection and repairing of returns is done by the OEM independently, and the other RL operations including disassembly, recycling and disposal are outsourced to 3PRLPs. For the purpose of establishing new centres for repair and refurbishing activities, few collection centres (CCs) are chosen for accommodating these activities. It would require appropriate expansion of the CCs depending on space availability, cost of expansion, available budget and the number of returns. The notable feature of the model is the evaluation of CCs under financial, environmental and social considerations and integration of the facility selection decisions within the network design. The CCs are evaluated taking into account qualitative and quantitative criteria based on the three dimensions of sustainability, using integrated multi-criteria decision making (MCDM), which combines the efficiencies of the Analytical Hierarchical Process (AHP) and the Complex Proportional Assessment (COPRAS) method. A fuzzy mixed integer linear programming model is proposed for determining the optimum number, locations and capacities of the RFs, penalty cost for under-utilisation of the capacities and number of returns to be repaired at the selected RFs. Fuzzy programming approach is used for effectively obtaining a properly efficient solution, which satisfies the decision maker&#x2019;s (DM&#x2019;s) desired aspiration levels for the conflicting objectives of minimising the cost and maximising the sustainable performance of selected RFs. As per our knowledge, an optimisation model for an integrated RL network design focussing on sustainable evaluation and selection of RFs, capacity expansion as well as penalty for under-utilisation of capacities of selected RFs, along with flow allocation decisions has not been considered in the previous studies. Another notable contribution of the present work is that the model is illustrated using a case study of an electronic manufacturing firm in India. The fuzzy decision-making model can be effectively used by SC managers of the firm for configuring a sustainable RL network with conflicting goals.</p>
<p>The rest of the article includes the relevant literature review, the problem definition, and the proposed RL network followed by the proposed methodology. A brief description of the fuzzy programming approach is presented, which is applied to validate the proposed RL model using the data set of a real case study. Furthermore, the results are discussed, and finally, the concluding remarks are provided in the end.</p>
</sec>
<sec id="s0002">
<title>Literature review</title>
<p>In the last few years, the growing &#x2018;take-back&#x2019; laws are challenging the manufacturing firms to redesign their logistics network to incorporate RL into their network. Although there is a plethora of literature on RL network designing (Darbari et al. <xref ref-type="bibr" rid="CIT0013">2015</xref>:2; Dehghanian &#x0026; Mansour <xref ref-type="bibr" rid="CIT0015">2009</xref>:560; Ilgin &#x0026; Gupta <xref ref-type="bibr" rid="CIT0023">2010</xref>:567; Kannan et al. <xref ref-type="bibr" rid="CIT0025">2012</xref>:76), most of the studies in the literature have focussed on establishing RL network designs only from a 3PRLP&#x2019;s perspective (Mahmoudzadeh, Mansour &#x0026; Karimi <xref ref-type="bibr" rid="CIT0030">2011a</xref>:338; Mahmoudzadeh et al. <xref ref-type="bibr" rid="CIT0031">2011b</xref>:30; Min &#x0026; Ko <xref ref-type="bibr" rid="CIT0032">2008</xref>:176), while the OEM&#x2019;s perspective has been not been considered. From the OEM&#x2019;s perspective, there are various strategic, tactical and operational decisions that the OEM must ponder upon, for creating an effective RL network (Aras et al. <xref ref-type="bibr" rid="CIT0008">2015</xref>:325). The strategic choices have long-term significance on the recovery network. These include network design models comprising the location of the CCs (Aras, Aksen &#x0026; Tanu&#x011F;ur <xref ref-type="bibr" rid="CIT0007">2008</xref>:1223), inspection centres (Alumur et al. <xref ref-type="bibr" rid="CIT0006">2012</xref>:71), recycling centres (Aras et al. <xref ref-type="bibr" rid="CIT0008">2015</xref>:324), remanufacturing facilities (Diabat, Abdallah &#x0026; Henschel <xref ref-type="bibr" rid="CIT0016">2015</xref>:245), et cetera. The second class of decisions are tactical decisions that have a medium-term impact on RL. These decisions include policies for inventory management of returned products (Zhang <xref ref-type="bibr" rid="CIT0050">2013</xref>:598), transportation decisions (Shaik &#x0026; Abdul-Kadir <xref ref-type="bibr" rid="CIT0040">2013</xref>:495), et cetera. Finally, there are operational decisions that impact the RL on a short-term basis. These include decisions pertaining to the flow of products, components and material across various facilities of the network (Darbari, Agarwal &#x0026; Jha <xref ref-type="bibr" rid="CIT0014">2016</xref>:791).</p>
<p>Deciding on the locations of warehouses, CCs and repair facilities are key aspects of the strategic plan of reverse SC configuration. However, the decisions regarding the facility locations must not be made in isolation but must be integrated within the RL network design to achieve an efficient recovery system. Many researchers have focussed on developing mathematical models for configuring logistics network design integrating facility location decisions and RL functions (Achillas et al. <xref ref-type="bibr" rid="CIT0002">2010a</xref>:2594; Alumur et al. <xref ref-type="bibr" rid="CIT0006">2012</xref>:67, <xref ref-type="bibr" rid="CIT0005">2015</xref>:419; Assavapokee &#x0026; Wongthatsanekorn <xref ref-type="bibr" rid="CIT0009">2012</xref>:129; Gomes, Barbosa-Povoa &#x0026; Novais <xref ref-type="bibr" rid="CIT0022">2011</xref>:1645; Xianfeng, Jianwei &#x0026; Meilian <xref ref-type="bibr" rid="CIT0047">2010</xref>:403; Zhang &#x0026; Lee <xref ref-type="bibr" rid="CIT0051">2013</xref>:1348). Most previous studies have focussed only on economic considerations and there is a lack of research addressing social and environmental issues in facility location problems within the context of RL network design (Abdessalem, Hadj-Alouane &#x0026; Riopel <xref ref-type="bibr" rid="CIT0001">2012</xref>:139; Kim &#x0026; Lee <xref ref-type="bibr" rid="CIT0027">2013</xref>:1132; Queiruga et al. <xref ref-type="bibr" rid="CIT0035">2008</xref>:182; Tari &#x0026; Alumur <xref ref-type="bibr" rid="CIT0043">2014</xref>:157). Very few studies have considered factors of evaluation, which address all three dimensions of sustainability (Achillas et al. <xref ref-type="bibr" rid="CIT0003">2010b</xref>:870; Temur, Kaya &#x0026; Kahraman <xref ref-type="bibr" rid="CIT0044">2014</xref>:591; Zhou &#x0026; Zhou <xref ref-type="bibr" rid="CIT0052">2015</xref>:61). Although a lot of research has been done on the aspects of facility location selection within the domain of RL network designing, selection of CCs as RFs based on all three indicators of sustainability, particularly in the context of the Indian electronics sector as done in the present article, has been missing in the literature. In addition, the novelty of the present research work also lies in developing an integrated RL optimisation model, which can capture a trade-off between the conflicting objectives of minimising cost and maximising the sustainable performance of the RFs, while making crucial facility location and flow allocation decisions.</p>
</sec>
<sec id="s0003">
<title>Problem definition</title>
<p>The present RL network of the company consists of retail zones each having a designated CC, which is the collection point for the entire zone. All the returns consolidated at the CCs are collected by a 3PRLP, which pays a fixed price for all the returns irrespective of the quality. The 3PRLP then takes responsibility of the returns and the company&#x2019;s legal duty of handling its returns is fulfilled. Because of customer pressure, market competence and environmental consciousness, the company aims to act more responsibly and design its RL network so as to take control of the processes independently or jointly with service providers. To realise the potential of huge economic benefits from the sale of secondary products, the company plans to perform the processes of collection, inspection, repairing and redistribution to secondary markets (SM) on its own. Strategic decisions are to be made regarding how many new RFs are required and where they should be located. Official dismantlers and recyclers must manage the process of dismantling, recycling and proper disposal as per the laws mandated by the government (Borthakur &#x0026; Singh <xref ref-type="bibr" rid="CIT0011">2012</xref>:360). Therefore, these activities are outsourced to 3PRLPs. The company in association with non-governmental organisations (NGOs) seeks to play an influential role in providing opportunities to the lesser privileged section of the society. As a consequence, it plans to donate some of its returns that are in reasonable good working condition to those in need through the NGO. This initiative is to be carried out at the RFs. In view of this, a fuzzy decision-making model is proposed for developing an economically, environmentally and socially sound RL network, which addresses the following concerns:
<list list-type="bullet">
<list-item><p>Quick collection and redistribution to ensure a steady flow of returns across every facility.</p></list-item>
<list-item><p>Choosing suitable RFs, with adequate infrastructure, to carry out the repairing, refurbishing and repacking processes.</p></list-item>
<list-item><p>The location, number and capacity of RFs are determined within budgetary limits.</p></list-item>
<list-item><p>The RL network has positive environmental as well as social significance.</p></list-item>
</list></p>
</sec>
<sec id="s0004">
<title>Proposed reverse logistics network</title>
<p>The proposed RL network designed to address the above concerns consists of CCs, an integrated dismantling centre (DMC), a SM, a scrap yard and an NGO as illustrated in <xref ref-type="fig" rid="F0001">Figure 1</xref>. Because all the recovery options were previously managed by 3PRLP, the company was losing out on the revenue generated from selling the repaired products at the SM, which is a substantial amount. In this regard, the company plans to take charge of the repairing of products. Repairing of electronic returns requires replacement and refurbishment of parts to renovate the product so that it can be easily reused. It is a manual process that can be handled by the trained staff of the company. Opening new RFs for repairing and refurbishing is not required as the process can be easily managed manually by a team of skilled technicians and can be carried at CCs with proper expansion of space and infrastructure. However, because the number of returns to be repaired and refurbished is not significantly large, not all CCs are to function as RFs. The selection of a CC as RF is to be made based on a number of sustainable factors and requires a careful analysis of the existing scenario and future plans.</p>
<fig id="F0001">
<label>FIGURE 1</label>
<caption><p>Reverse logistics network design.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-g001.tif"/>
</fig>
<p>The flow of returns of the above network begins with the collection and inspection process at CCs. The initial level of inspection determines the buyback value based on the working state, type and age of the model. The returns are then segregated for repair, donation to an NGO, dismantling or sent to the scrap yard. The returns not fit to be reused or donated are to be disassembled for recovery of parts and materials and sent to the DMC for part recovery or to the scrap yard for material recovery or safe disposal. The DMC is third-party owned, and the returns to be dismantled are collected by the 3PRLP from the CCs. Legal recyclers who take care of the discarded returns and parts for valuable material recovery and safe disposal manage the scrap yard.</p>
</sec>
<sec id="s0005">
<title>Proposed methodology</title>
<p>The methodology adopted for configuring the proposed network can be outlined as follows:
<list list-type="bullet">
<list-item><p>For selection of CCs as RFs, the CCs are evaluated under a comprehensive list of sustainable criteria using the AHP-COPRAS method. The output of the AHP-COPRAS method is the utility of each CC that represents the relative performance of one CC over the other.</p></list-item>
<list-item><p>A bi-objective fuzzy mathematical model is formulated, which selects the CC to function as RF, determines the level of capacity expansion and allocates each CC to exactly one RF for sending the returns to be repaired. The key decisions are made while capturing a trade-off between the fuzzy objectives of minimising cost of the network and maximising the sustainable performance of the RFs.</p></list-item>
</list></p>
<sec id="s20006">
<title>Integrated Analytical Hierarchical Process &#x2013; Complex Proportional Assessment application for the evaluation of collection centres</title>
<p>The decision regarding the selection of CCs to function as RFs is of strategic importance and has major environmental and social significance because of the expansion of space, job creation and the community development initiatives undertaken.</p>
<p>For this reason, the following sustainable quantitative and qualitative criteria are chosen after an extensive literature survey and intensive interaction with the decision makers: Distance from DMC and centre of gravity (C1), Running cost (C2), Rent Cost (C3), Customer Service Rating (C4), Effectiveness of RL (C5), Environmental Considerations (C6), Technical Qualifications (C7) and Scope for Community Developments (C8) (Ertu&#x011F;rul <xref ref-type="bibr" rid="CIT0018">2011</xref>:734; Liu, Chan &#x0026; Chung <xref ref-type="bibr" rid="CIT0029">2011</xref>:430; Pochampally, Nukala &#x0026; Gupta <xref ref-type="bibr" rid="CIT0034">2008</xref>:87; Rezaeiniya, Zolfani &#x0026; Zavadskas <xref ref-type="bibr" rid="CIT0037">2012</xref>:188; Yang et al. <xref ref-type="bibr" rid="CIT0048">2008</xref>).</p>
<p>The evaluation process based on the above tangible and intangible criteria is a complex and time-consuming group decision-making problem and an integrated MCDM is proposed, which combines the efficiencies of AHP and COPRAS method. Firstly, the weights of the criteria are determined through AHP (Saaty <xref ref-type="bibr" rid="CIT0038">1987</xref>:70) and then COPRAS (Zavadskas et al. <xref ref-type="bibr" rid="CIT0049">2008</xref>:88) is employed to evaluate the alternatives based on mutually conflicting criteria along with the derived criteria weights. The procedure measures the performance of the alternatives (CCs) in terms of their relative preferences and utility.</p>
<p>The procedure for applying the AHP-COPRAS method is as follows: Suppose there are <italic>n</italic> alternatives and <italic>m</italic> criteria. We first evaluate the importance of <italic>w<sub>j</sub></italic>&#x2019;s (in terms of weights) of the criteria using AHP. Pairwise comparisons of the <italic>m</italic> criteria are done by <italic>k</italic> DMs using a nominal scale of 1&#x2013;9 (1, 3, 5, 7 and 9 represent equal, moderate, strong, very strong and absolutely essential, respectively, and 2, 4, 6 and 8 are intermediate values). We generate <italic>k</italic> matrices (<italic>mxm</italic>) with the (<italic>r,s</italic>)<sup>th</sup> element representing the relative importance of criteria <italic>r</italic> over criteria <italic>s</italic>. The average of these matrices yields the final decision matrix A whose consistency ratio is:
<disp-formula id="FD1"><alternatives><mml:math display="block" id="M1"><mml:mrow><mml:mi>C</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>C</mml:mi><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e001.tif"/></alternatives></disp-formula>
where CI is the consistency index, which is calculated as follows:
<disp-formula id="FD2"><alternatives><mml:math display="block" id="M2"><mml:mrow><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>max</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e002.tif"/></alternatives><label>[Eqn 1]</label></disp-formula>
where &#x03BB;<sub>max</sub> is the largest eigenvalue of A.</p>
<p>Because there are eight criteria of evaluation, <italic>m</italic> = 8. The value of RI is 1.40 as obtained from the study by Saaty (<xref ref-type="bibr" rid="CIT0038">1987</xref>:71). A value of CR less than 0.01 is acceptable. The eigenvector (priority vector) <italic>w</italic> = (<italic>w</italic><sub>1</sub>,<italic>w</italic><sub>2</sub>,&#x2026;,<italic>w<sub>m</sub></italic>) of A is calculated using the following equation:
<disp-formula id="FD3"><alternatives><mml:math display="block" id="M3"><mml:mrow><mml:mi>A</mml:mi><mml:mi>w</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>max</mml:mi></mml:mrow></mml:msub><mml:mi>w</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e003.tif"/></alternatives></disp-formula></p>
<p>The priority vector is the weighted vector, which represents the importance weights of the criteria.</p>
<p>We now proceed on to evaluate the performance of the alternatives subject to the criteria by applying the following steps of the COPRAS method (Gadakh <xref ref-type="bibr" rid="CIT0019">2014</xref>:25).</p>
<p><bold>Step 1:</bold> Formulate the <italic>nxm</italic> decision matrix X. Let all the columns corresponding to beneficial criteria (the more the better) be arranged before those corresponding to non-beneficial criteria (lesser the better). The matrix X is then:
<disp-formula id="FD4"><alternatives><mml:math display="block" id="M4"><mml:mrow><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo> <mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow> <mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>X</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo> <mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>21</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow> <mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e004.tif"/></alternatives><label>[Eqn 2]</label></disp-formula>
where <italic>x<sub>ij</sub></italic> is the value of criterion <italic>j</italic> of alternative <italic>i</italic>. The values are derived from the quantitative data provided by the company. In the case of criteria for which values cannot be quantified, alternatives are evaluated with respect to that criteria using AHP and the column vector is the derived priority vector from the AHP calculations.</p>
<p><bold>Step 2:</bold> Derive the normalised decision matrix <italic>Y</italic> as follows:
<disp-formula id="FD5"><alternatives><mml:math display="block" id="M5"><mml:mrow><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo><mml:mi>w</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:mfrac></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e005.tif"/></alternatives><label>[Eqn 3]</label></disp-formula></p>
<p><bold>Step 3:</bold> Construct the weighted normalised decision matrix:
<disp-formula id="FD6"><alternatives><mml:math display="block" id="M6"><mml:mrow><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e006.tif"/></alternatives></disp-formula>
where <italic>d<sub>ij</sub> = y<sub>ij</sub> w<sub>j</sub></italic> and <italic>w<sub>j</sub></italic> is the criterion weight (derived using the AHP).</p>
<p><bold>Step 4:</bold> For each alternative <italic>i</italic>, calculate the sums of values <italic>d<sub>ij</sub></italic>&#x2019;s for all beneficial criteria and the sums of values <italic>d<sub>ij</sub></italic>&#x2019;s for all non-beneficial criteria using the following equations:
<disp-formula id="FD7"><alternatives><mml:math display="block" id="M7"><mml:mrow><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>B</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e007.tif"/></alternatives><label>[Eqn 4]</label></disp-formula>
<disp-formula id="FD8"><alternatives><mml:math display="block" id="M8"><mml:mrow><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e008.tif"/></alternatives><label>[Eqn 5]</label></disp-formula></p>
<p><bold>Step 5:</bold> The relative weight <italic>Q<sub>i</sub></italic> is determined using the following equation:
<disp-formula id="FD9"><alternatives><mml:math display="block" id="M9"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup></mml:mrow></mml:mstyle></mml:mrow><mml:mrow><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msubsup><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:mfrac></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e009.tif"/></alternatives><label>[Eqn 6]</label></disp-formula></p>
<p>Greater values of <italic>Q<sub>i</sub></italic> signify higher priority.</p>
<p><bold>Step 6:</bold> The utility <italic>U<sub>i</sub></italic> of each alternative, a percentage value between 0 and 100, shows by what percentage one alternative performs better than the other and is computed by comparing the priorities of alternatives with the best one as shown below:
<disp-formula id="FD10"><alternatives><mml:math display="block" id="M10"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>max</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x002A;</mml:mo><mml:mn>100</mml:mn><mml:mi>&#x0025;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e010.tif"/></alternatives><label>[Eqn 7]</label></disp-formula>
where <italic>Q</italic><sub>max</sub> = max{<italic>Q<sub>i</sub></italic> : <italic>i</italic>&#x2208;<italic>I</italic>}</p>
</sec>
<sec id="s20007">
<title>Bi-objective fuzzy model formulation</title>
<p>A fuzzy optimisation model is formulated for configuring the proposed RL network using the assumptions and notations given below.</p>
<sec id="s30008">
<title>Assumptions</title>
<list list-type="bullet">
<list-item><p>Locations and capacities of the CCs and DMC are known.</p></list-item>
<list-item><p>The demand of the SM is high.</p></list-item>
<list-item><p>The cost parameters are deterministic.</p></list-item>
<list-item><p>Activities outsourced to 3PRLP do not incur any extra cost to the company.</p></list-item>
</list>
</sec>
<sec id="s30009">
<title>Notations</title>
<p>Sets:</p>
<list list-type="bullet">
<list-item><p><italic>i</italic>: set of CCs</p></list-item>
<list-item><p><italic>p</italic>: dismantling centre.</p></list-item>
</list>
<p>Parameters:</p>
<list list-type="bullet">
<list-item><p><italic>c<sup>trans</sup></italic> cost of transportation (per km)</p></list-item>
<list-item><p><inline-formula id="ID1"><alternatives><mml:math display="inline" id="I1"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>x</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i001.tif"/></alternatives></inline-formula> fixed cost of expansion of <italic>i</italic>th CC</p></list-item>
<list-item><p><inline-formula id="ID2"><alternatives><mml:math display="inline" id="I2"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>exp</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i002.tif"/></alternatives></inline-formula> variable cost of expansion of <italic>i</italic>th CC(per square feet)</p></list-item>
<list-item><p><italic>c<sup>rep</sup></italic> per unit cost of repair</p></list-item>
<list-item><p><italic>c<sup>penalty</sup></italic> penalty cost</p></list-item>
<list-item><p><italic>c<sup>budget</sup></italic> total budget for expansion</p></list-item>
<list-item><p><italic>d<sub>ij</sub></italic> distance between CCs (in km)</p></list-item>
<list-item><p><italic>M<sub>i</sub></italic> capacity of <italic>i</italic>th CC(in units of returns)</p></list-item>
<list-item><p><inline-formula id="ID3"><alternatives><mml:math display="inline" id="I3"><mml:mrow><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i003.tif"/></alternatives></inline-formula> lower limit of capacity of the <italic>i</italic>th CC</p></list-item>
<list-item><p><inline-formula id="ID4"><alternatives><mml:math display="inline" id="I4"><mml:mrow><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>h</mml:mi></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i004.tif"/></alternatives></inline-formula> upper limit of capacity of the <italic>i</italic>th CC</p></list-item>
<list-item><p><italic>u<sub>i</sub></italic> utility of the <italic>i</italic>th CC as obtained from hybrid AHP-COPRAS</p></list-item>
<list-item><p><italic>u</italic><sub>min</sub> minimum threshold of utility</p></list-item>
<list-item><p><italic>k</italic> maximum number of repair facilities</p></list-item>
<list-item><p>&#x03B1;<sub><italic>j</italic></sub> percentage of products to be repaired</p></list-item>
<list-item><p><inline-formula id="ID5"><alternatives><mml:math display="inline" id="I5"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i005.tif"/></alternatives></inline-formula> environmental criteria of the <italic>i</italic>th CC</p></list-item>
<list-item><p><inline-formula id="ID6"><alternatives><mml:math display="inline" id="I6"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i006.tif"/></alternatives></inline-formula> minimum threshold for environmental criteria</p></list-item>
<list-item><p><inline-formula id="ID7"><alternatives><mml:math display="inline" id="I7"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i007.tif"/></alternatives></inline-formula> social criteria of the <italic>i</italic>th CC</p></list-item>
<list-item><p><inline-formula id="ID8"><alternatives><mml:math display="inline" id="I8"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i008.tif"/></alternatives></inline-formula> minimum threshold for the social criteria</p></list-item>
<list-item><p><italic>X<sub>j</sub></italic> total number of returns at the <italic>j</italic>th CC.</p></list-item>
</list>
<p>Decision variables:</p>
<list list-type="bullet">
<list-item><p><italic>B<sub>ij</sub></italic> a binary variable whose value is 1 if the <italic>j</italic>th CC sends its returns to the <italic>i</italic>th selected CC, 0 otherwise</p></list-item>
<list-item><p><italic>A<sub>i</sub></italic> a binary variable whose value is 1 if the CC is selected for expansion, 0 otherwise</p></list-item>
<list-item><p><inline-formula id="ID9"><alternatives><mml:math display="inline" id="I9"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i009.tif"/></alternatives></inline-formula> the number of products repaired at the <italic>i</italic>th CC</p></list-item>
<list-item><p><inline-formula id="ID10"><alternatives><mml:math display="inline" id="I10"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i010.tif"/></alternatives></inline-formula> total number of products repaired</p></list-item>
</list>
</sec>
<sec id="s30010">
<title>Fuzzy multi-objective programming problem</title>
<p><disp-formula id="FD11"><alternatives><mml:math display="block" id="M11"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2245;</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:msup><mml:mi>c</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msup><mml:mi>c</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:msup><mml:mi>c</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x2009;</mml:mtext><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:mrow><mml:mo>[</mml:mo> <mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>x</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>exp</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mi>c</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>h</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow> <mml:mo>]</mml:mo></mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x2003;</mml:mo><mml:mo>&#x2003;</mml:mo><mml:mo>&#x2003;</mml:mo><mml:mo>&#x2003;</mml:mo><mml:mo>&#x2003;</mml:mo><mml:mo>&#x2003;</mml:mo><mml:mo>&#x2003;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mtext>P</mml:mtext><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e011.tif"/></alternatives><label>[Eqn 8]</label></disp-formula>
<disp-formula id="FD12"><alternatives><mml:math display="block" id="M12"><mml:mrow><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x2245;</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e012.tif"/></alternatives><label>[Eqn 9]</label></disp-formula></p>
<p>The first objective of the fuzzy multi-objective programming (FMOP) problem minimises the total cost of the network encompassing the cost of transportation (from CCs to RF and from RFs to DMC), cost of repair, fixed and variable cost of expansion and penalty cost for under-utilisation of capacities of selected RFs. As the focus is largely on minimising costs, the profit from selling of repaired products is not considered in the objective. The second objective maximises the overall utility of the CCs selected for expansion, which ensures that CCs with better performance value are chosen.</p>
<p>Constraints:
<disp-formula id="FD13"><alternatives><mml:math display="block" id="M13"><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e013.tif"/></alternatives><label>[Eqn 10]</label></disp-formula>
<disp-formula id="FD14"><alternatives><mml:math display="block" id="M14"><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e014.tif"/></alternatives><label>[Eqn 11]</label></disp-formula>
<disp-formula id="FD15"><alternatives><mml:math display="block" id="M15"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x2009;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e015.tif"/></alternatives><label>[Eqn 12]</label></disp-formula>
<disp-formula id="FD16"><alternatives><mml:math display="block" id="M16"><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>I</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e016.tif"/></alternatives><label>[Eqn 13]</label></disp-formula>
<disp-formula id="FD17"><alternatives><mml:math display="block" id="M17"><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mtext>&#x2009;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e017.tif"/></alternatives><label>[Eqn 14]</label></disp-formula>
<disp-formula id="FD18"><alternatives><mml:math display="block" id="M18"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>h</mml:mi></mml:msubsup><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e018.tif"/></alternatives><label>[Eqn 15]</label></disp-formula>
<disp-formula id="FD19"><alternatives><mml:math display="block" id="M19"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2265;</mml:mo><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi></mml:msubsup><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e019.tif"/></alternatives><label>[Eqn 16]</label></disp-formula>
<disp-formula id="FD20"><alternatives><mml:math display="block" id="M20"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e020.tif"/></alternatives><label>[Eqn 17]</label></disp-formula>
<disp-formula id="FD21"><alternatives><mml:math display="block" id="M21"><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e021.tif"/></alternatives><label>[Eqn 18]</label></disp-formula>
<disp-formula id="FD22"><alternatives><mml:math display="block" id="M22"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e022.tif"/></alternatives><label>[Eqn 19]</label></disp-formula>
<disp-formula id="FD23"><alternatives><mml:math display="block" id="M23"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x003C;</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e023.tif"/></alternatives><label>[Eqn 20]</label></disp-formula>
<disp-formula id="FD24"><alternatives><mml:math display="block" id="M24"><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mrow><mml:mrow><mml:mo>[</mml:mo> <mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>x</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>exp</mml:mi></mml:mrow></mml:msubsup></mml:mrow> <mml:mo>]</mml:mo></mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msup><mml:mi>c</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>u</mml:mi><mml:mi>d</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mstyle></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e024.tif"/></alternatives><label>[Eqn 21]</label></disp-formula>
<disp-formula id="FD25"><alternatives><mml:math display="block" id="M25"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e025.tif"/></alternatives><label>[Eqn 22]</label></disp-formula>
<disp-formula id="FD26"><alternatives><mml:math display="block" id="M26"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e026.tif"/></alternatives><label>[Eqn 23]</label></disp-formula>
<disp-formula id="FD27"><alternatives><mml:math display="block" id="M27"><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>min</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x2003;</mml:mtext><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e027.tif"/></alternatives><label>[Eqn 24]</label></disp-formula>
<disp-formula id="FD28"><alternatives><mml:math display="block" id="M28"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e028.tif"/></alternatives><label>[Eqn 25]</label></disp-formula>
<disp-formula id="FD29"><alternatives><mml:math display="block" id="M29"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mtext>&#x2009;</mml:mtext><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e029.tif"/></alternatives><label>[Eqn 26]</label></disp-formula></p>
<p>Equation (<xref ref-type="disp-formula" rid="FD13">10</xref>) ensures that at least one CC should be selected for expansion to RF. Equation (<xref ref-type="disp-formula" rid="FD14">11</xref>) limits the number of CCs selected for expansion. Equations (<xref ref-type="disp-formula" rid="FD15">12</xref>)&#x2013;(<xref ref-type="disp-formula" rid="FD17">14</xref>) determine that each CC is allocated to exactly one RF for sending their returns to be repaired. Equation (<xref ref-type="disp-formula" rid="FD18">15</xref>) and (<xref ref-type="disp-formula" rid="FD19">16</xref>) give the minimum and maximum scope of expansion of CCs. Equation (<xref ref-type="disp-formula" rid="FD20">17</xref>)&#x2013;(<xref ref-type="disp-formula" rid="FD22">19</xref>) ensure that the total number of returns that need to be repaired, calculated as a fraction of the total number of returns, are all sent for repair. Equation (<xref ref-type="disp-formula" rid="FD23">20</xref>) ensures that the number of returns sent to each RF must be less than its capacity for expansion (it is zero if the CC is not selected). Equation (<xref ref-type="disp-formula" rid="FD24">21</xref>) is the budgetary constraint, which states that the total fixed and variable cost of expansion should be less than the total budget allocation for expansion. Equation (<xref ref-type="disp-formula" rid="FD25">22</xref>), (<xref ref-type="disp-formula" rid="FD26">23</xref>) and (<xref ref-type="disp-formula" rid="FD27">24</xref>) make sure that the selected CC must satisfy the minimum threshold level for environmental and social criteria and must meet the minimum desired utility value. Equation (<xref ref-type="disp-formula" rid="FD28">25</xref>) and (<xref ref-type="disp-formula" rid="FD29">26</xref>) ensure the binary restrictions as well as the non-negativity restrictions.</p>
</sec>
</sec>
<sec id="s20011">
<title>Fuzzy solution approach for multi-objective optimisation</title>
<p>Fuzzy optimisation approach permits adequate solutions of real-world RL network problems having objectives that are normally fuzzy or imprecise in nature and cannot be quantified by crisp mathematical programming approaches. In the FMOP problem (P1) defined above, we have two conflicting objectives to be optimised simultaneously, and clearly, a trade-off is required between the objectives leading to a compromised solution. The fuzziness in the objectives is considered to provide flexibility to the DMs for choosing a preferred efficient solution.</p>
<p>Fundamental to multi-objective optimisation is the concept of efficient and properly efficient solutions. However, if the goals are fuzzy, the concept is extended to fuzzy efficient and fuzzy, properly efficient solutions, defined in terms of membership functions, instead of objective functions (Jim&#x00E9;nez &#x0026; Bilbao <xref ref-type="bibr" rid="CIT0024">2009</xref>:2716; Sakawa <xref ref-type="bibr" rid="CIT0039">2013</xref>:7). The corresponding terms are defined below.</p>
<sec id="s30012">
<title>Definition 1: Membership function</title>
<p>We utilise fuzzy set theory (Bellman &#x0026; Zadeh <xref ref-type="bibr" rid="CIT0010">1970</xref>:B141) to mathematically represent the fuzzy objectives <italic>f<sub>1</sub></italic> (minimisation) and <italic>f<sub>2</sub></italic> (maximisation) in terms of membership functions as follows:
<disp-formula id="FD30"><alternatives><mml:math display="block" id="M30"><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>1</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>f</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mn>0</mml:mn></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mn>2</mml:mn><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e030.tif"/></alternatives><label>[Eqn 27]</label></disp-formula></p>
<p>Where <inline-formula id="ID11"><alternatives><mml:math display="inline" id="I11"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mn>0</mml:mn></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i011.tif"/></alternatives></inline-formula> and <inline-formula id="ID12"><alternatives><mml:math display="inline" id="I12"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i012.tif"/></alternatives></inline-formula> represent the aspiration and tolerance values of the <italic>i</italic>th goal. These values can be specified by the DM or can also be chosen by solving the two single-objective problems under system constraints (1)&#x2013;(17) (<inline-formula id="ID13"><alternatives><mml:math display="inline" id="I13"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mn>0</mml:mn></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i013.tif"/></alternatives></inline-formula> is taken as the best possible value and <inline-formula id="ID14"><alternatives><mml:math display="inline" id="I14"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i014.tif"/></alternatives></inline-formula> is the worst possible value obtained of the <italic>i</italic>th goal).</p>
</sec>
<sec id="s30013">
<title>Definition 2: Fuzzy efficient solution</title>
<p><italic>x</italic>&#x002A; &#x2208; <italic>S</italic> is a fuzzy efficient solution of (P1) if there does not exist any <italic>x</italic> &#x2208; <italic>S</italic> such that <inline-formula id="ID15"><alternatives><mml:math display="inline" id="I15"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2200;</mml:mo><mml:mtext>i</mml:mtext><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i015.tif"/></alternatives></inline-formula> and <inline-formula id="ID16"><alternatives><mml:math display="inline" id="I16"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-i016.tif"/></alternatives></inline-formula> for at least one <italic>j</italic>.</p>
</sec>
<sec id="s30014">
<title>Definition 3: Fuzzy, properly efficient solution</title>
<p>A fuzzy efficient solution <italic>x</italic>&#x002A;of (P1) is said to be a fuzzy, properly efficient solution if there exists a scalar <italic>M</italic> &#x003E; 0 such that for each <italic>x</italic> &#x2208; <italic>S</italic>:
<disp-formula id="FD31"><alternatives><mml:math display="block" id="M31"><mml:mrow><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mi>M</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>with&#x00A0;</mml:mtext><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>for&#x00A0;some&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mtext>&#x00A0;and&#x00A0;</mml:mtext><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mo>&#x03BC;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x002A;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>for&#x00A0;each&#x00A0;</mml:mtext><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e031.tif"/></alternatives><label>[Eqn 28]</label></disp-formula></p>
</sec>
<sec id="s30015">
<title>Solution approach for obtaining a fuzzy, properly efficient solution</title>
<p>Using Zimmermann&#x2019;s max&#x2013;min operator approach (Zimmermann <xref ref-type="bibr" rid="CIT0053">1978</xref>:49), problem (P1) can be transformed into the following equivalent crisp single-objective linear programming problem:
<disp-formula id="FD32"><alternatives><mml:math display="block" id="M32"><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>subject&#x2009;to</mml:mtext></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mtext>P</mml:mtext><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e032.tif"/></alternatives><label>[Eqn 29]</label></disp-formula></p>
<p>The auxiliary variable &#x03B1; represents the degree of satisfaction to which the objective is satisfied.</p>
<p>The max&#x2013;min approach used in (P2) ensures that if it has a unique optimal solution, then it is a fuzzy efficient solution of (P1). However, in the case of multiple optimal solutions, not every optimal solution of (P2) is a fuzzy efficient solution of (P1). To overcome the issue, the following weighted problem (P3) can be formulated in an endeavour to finding a fuzzy efficient solution (Tiwari, Dharmar &#x0026; Rao <xref ref-type="bibr" rid="CIT0045">1987</xref>:30):
<disp-formula id="FD33"><alternatives><mml:math display="block" id="M33"><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>subject&#x2009;to</mml:mtext></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mtext>P</mml:mtext><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e033.tif"/></alternatives><label>[Eqn 30]</label></disp-formula>
where <italic>w</italic><sub>1</sub> and <italic>w</italic><sub>2</sub> are weights assigned to <italic>f</italic><sub>1</sub> and <italic>f</italic><sub>2</sub>, while &#x03B1;<sub>1</sub> and &#x03B1;<sub>2</sub>represent their achievement levels, respectively.</p>
<p>An optimal solution of (P3) is a fuzzy, properly efficient solution of (P1) (Refer Lemma 1 in <xref ref-type="app" rid="app001">Appendix 1</xref>).</p>
<p>Although the objectives with more importance are achieved at higher levels using the additive model, the ratio of the levels is not close to the ratio of that of the weights. This is desirable to truly preserve the relative importance of the objectives, defined by the DMs in terms of the weights.</p>
<p>Hence, in this article, the following weighted max&#x2013;min model (P4) proposed by Lin (<xref ref-type="bibr" rid="CIT0028">2004</xref>:411) is utilised, which finds &#x2018;an optimal solution within the feasible area such that the ratio of the achieved levels of the objectives (<italic>w</italic><sub>1</sub>&#x03B1;/<italic>w</italic><sub>2</sub>&#x03B1;)&#x2019; is the same as the ratio of the weights (<italic>w</italic><sub>1</sub>/<italic>w</italic><sub>2</sub>)&#x2019;:
<disp-formula id="FD34"><alternatives><mml:math display="block" id="M34"><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>subject&#x2009;to</mml:mtext></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mtext>P</mml:mtext><mml:mn>4</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e034.tif"/></alternatives><label>[Eqn 31]</label></disp-formula></p>
<p>An optimal solution of (P4) yields a fuzzy, properly efficient solution of the original FMOP problem (P1).</p>
<p>The fuzzy solution procedure discussed above for solving the proposed model is integrated into the following solution algorithm:</p>
</sec>
<sec id="s30016">
<title>Fuzzy solution algorithm</title>
<p><bold>Step 1:</bold> The original FMOP problem is formulated.</p>
<p><bold>Step 2:</bold> The aspiration and tolerance levels are either specified by the DMs or can be obtained by solving the two single-objective programming problems. The corresponding linear membership functions are defined for the fuzzy objectives.</p>
<p><bold>Step 3:</bold> The weights for the objective functions are taken as per DMs preferences.</p>
<p><bold>Step 4:</bold> An equivalent crisp scalar problem (P4) of (P1) is formulated.</p>
<p><bold>Step 5:</bold> An optimal solution of (P4) generates the fuzzy, properly efficient solution of (P1).</p>
<p>The following numerical example illustrates how the proposed model can be solved using the above solution algorithm.</p>
</sec>
</sec>
</sec>
<sec id="s0017">
<title>Numerical example</title>
<p>The case study considered in here is of an electronics manufacturing company located in Delhi National Capital Region, India. The company has 8 CCs located in the region that carry out the initial collection as well as inspection of the returned products. The DMC is situated at Mayapuri, and the CCs are located at East of Kailash (A1), Vaishalli (A2), Noida (A3), Dwarka (A4), Vasant Kunj (A5), Sushant Lok (A6), Karol Bagh (A7) and Model Town (A8) as shown in <xref ref-type="fig" rid="F0002">Figure 2</xref>. A team of company stakeholders are assigned the task of evaluation of the expansion of the CCs to incorporate the repairing, refurbishing and repackaging processes.</p>
<fig id="F0002">
<label>FIGURE 2</label>
<caption><p>Location of collection centres.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-g002.tif"/>
</fig>
<p>For the purpose of evaluation, the relative importance of the criteria is derived using the AHP as shown in <xref ref-type="table" rid="T0001">Table 1</xref>. The components of the eigenvector represent the weights of the criteria. Non-beneficial criteria are marked as (&#x2212;) and the beneficial criteria are marked as (+).</p>
<table-wrap id="T0001">
<label>TABLE 1</label>
<caption><p>Weights of criteria.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">Goal</th>
<th align="center">C1<sup>&#x2212;</sup></th>
<th align="center">C2<sup>&#x2212;</sup></th>
<th align="center">C3<sup>&#x2212;</sup></th>
<th align="center">C4<sup>+</sup></th>
<th align="center">C5<sup>+</sup></th>
<th align="center">C6<sup>+</sup></th>
<th align="center">C7<sup>+</sup></th>
<th align="center">C8<sup>+</sup></th>
<th align="center">Eigenvector</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">C1</td>
<td align="center">1.00</td>
<td align="center">1.00</td>
<td align="center">0.50</td>
<td align="center">3.00</td>
<td align="center">1.00</td>
<td align="center">1.00</td>
<td align="center">0.50</td>
<td align="center">2.00</td>
<td align="center">0.120</td>
</tr>
<tr>
<td align="left">C2</td>
<td align="center">1.00</td>
<td align="center">1.00</td>
<td align="center">0.50</td>
<td align="center">2.00</td>
<td align="center">0.50</td>
<td align="center">0.33</td>
<td align="center">0.50</td>
<td align="center">2.00</td>
<td align="center">0.090</td>
</tr>
<tr>
<td align="left">C3</td>
<td align="center">2.00</td>
<td align="center">2.00</td>
<td align="center">1.00</td>
<td align="center">3.00</td>
<td align="center">1.00</td>
<td align="center">2.00</td>
<td align="center">2.00</td>
<td align="center">2.00</td>
<td align="center">0.200</td>
</tr>
<tr>
<td align="left">C4</td>
<td align="center">0.33</td>
<td align="center">0.50</td>
<td align="center">0.33</td>
<td align="center">1.00</td>
<td align="center">0.50</td>
<td align="center">0.50</td>
<td align="center">0.50</td>
<td align="center">1.00</td>
<td align="center">0.060</td>
</tr>
<tr>
<td align="left">C5</td>
<td align="center">1.00</td>
<td align="center">2.00</td>
<td align="center">1.00</td>
<td align="center">2.00</td>
<td align="center">1.00</td>
<td align="center">1.00</td>
<td align="center">1.00</td>
<td align="center">2.00</td>
<td align="center">0.150</td>
</tr>
<tr>
<td align="left">C6</td>
<td align="center">1.00</td>
<td align="center">3.00</td>
<td align="center">0.50</td>
<td align="center">2.00</td>
<td align="center">1.00</td>
<td align="center">1.00</td>
<td align="center">2.00</td>
<td align="center">3.00</td>
<td align="center">0.160</td>
</tr>
<tr>
<td align="left">C7</td>
<td align="center">2.00</td>
<td align="center">2.00</td>
<td align="center">0.50</td>
<td align="center">2.00</td>
<td align="center">1.00</td>
<td align="center">0.50</td>
<td align="center">1.00</td>
<td align="center">2.00</td>
<td align="center">0.130</td>
</tr>
<tr>
<td align="left">C8</td>
<td align="center">0.50</td>
<td align="center">0.50</td>
<td align="center">0.50</td>
<td align="center">1.00</td>
<td align="center">0.50</td>
<td align="center">0.33</td>
<td align="center">0.50</td>
<td align="center">1.00</td>
<td align="center">0.065</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>These weights are utilised in the initial decision matrix of the COPRAS method as shown by <xref ref-type="table" rid="T0002">Table 2</xref>. The columns of the matrix correspond to the performance of the alternatives (CCs) for each criterion. The column for criteria C1 indicates the distance calculated as the sum of the distance of CC from the DMC and its distance from the centre of gravity of all CCs (Values from <xref ref-type="table" rid="T0003">Table 3</xref> are used for the calculation). Column C2 is the running cost, which is the monthly cost for carrying the operations at CC. C3 is the per square feet rental cost of CC. C4-customer service level and C7-technological capability are measured using a scale of 1&#x2013;10 where higher values signify higher performance. In the absence of quantitative data for criteria C5, C6 and C8, the AHP is used for comparing the alternatives for each criterion using the derived priority vectors.</p>
<table-wrap id="T0002">
<label>TABLE 2</label>
<caption><p>Initial decision matrix.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">Alternatives</th>
<th align="center">C1<sup>&#x2212;</sup></th>
<th align="center">C2<sup>&#x2212;</sup></th>
<th align="center">C3<sup>&#x2212;</sup></th>
<th align="center">C4<sup>+</sup></th>
<th align="center">C5<sup>+</sup></th>
<th align="center">C6<sup>+</sup></th>
<th align="center">C7<sup>+</sup></th>
<th align="center">C8<sup>+</sup></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">A1</td>
<td align="center">64.8</td>
<td align="center">4000</td>
<td align="center">110</td>
<td align="center">9</td>
<td align="center">0.202117</td>
<td align="center">0.058518</td>
<td align="center">9</td>
<td align="center">0.048296</td>
</tr>
<tr>
<td align="left">A2</td>
<td align="center">57.0</td>
<td align="center">3000</td>
<td align="center">60</td>
<td align="center">4</td>
<td align="center">0.058200</td>
<td align="center">0.203224</td>
<td align="center">4</td>
<td align="center">0.245266</td>
</tr>
<tr>
<td align="left">A3</td>
<td align="center">63.8</td>
<td align="center">3000</td>
<td align="center">60</td>
<td align="center">7</td>
<td align="center">0.074075</td>
<td align="center">0.081324</td>
<td align="center">6</td>
<td align="center">0.138629</td>
</tr>
<tr>
<td align="left">A4</td>
<td align="center">66.5</td>
<td align="center">2500</td>
<td align="center">35</td>
<td align="center">5</td>
<td align="center">0.083738</td>
<td align="center">0.221617</td>
<td align="center">5</td>
<td align="center">0.186362</td>
</tr>
<tr>
<td align="left">A5</td>
<td align="center">63.5</td>
<td align="center">4000</td>
<td align="center">100</td>
<td align="center">8</td>
<td align="center">0.161560</td>
<td align="center">0.120989</td>
<td align="center">9</td>
<td align="center">0.131778</td>
</tr>
<tr>
<td align="left">A6</td>
<td align="center">85.5</td>
<td align="center">3000</td>
<td align="center">65</td>
<td align="center">7</td>
<td align="center">0.104758</td>
<td align="center">0.061716</td>
<td align="center">8</td>
<td align="center">0.096593</td>
</tr>
<tr>
<td align="left">A7</td>
<td align="center">51.0</td>
<td align="center">3500</td>
<td align="center">70</td>
<td align="center">9</td>
<td align="center">0.195223</td>
<td align="center">0.120837</td>
<td align="center">9</td>
<td align="center">0.081224</td>
</tr>
<tr>
<td align="left">A8</td>
<td align="center">50.5</td>
<td align="center">3000</td>
<td align="center">60</td>
<td align="center">8</td>
<td align="center">0.120330</td>
<td align="center">0.131774</td>
<td align="center">8</td>
<td align="center">0.071852</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T0003">
<label>TABLE 3</label>
<caption><p>Distance between collection centres.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">d<sub>ij</sub></th>
<th align="center">i1</th>
<th align="center">i2</th>
<th align="center">i3</th>
<th align="center">i4</th>
<th align="center">i5</th>
<th align="center">i6</th>
<th align="center">i7</th>
<th align="center">i8</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">i1</td>
<td align="center">0.0</td>
<td align="center">8.0</td>
<td align="center">4.0</td>
<td align="center">11.0</td>
<td align="center">6.0</td>
<td align="center">9.7</td>
<td align="center">7.0</td>
<td align="center">9.0</td>
</tr>
<tr>
<td align="left">i2</td>
<td align="center">8.0</td>
<td align="center">0.0</td>
<td align="center">4.5</td>
<td align="center">16.9</td>
<td align="center">12.8</td>
<td align="center">17.7</td>
<td align="center">9.5</td>
<td align="center">9.0</td>
</tr>
<tr>
<td align="left">i3</td>
<td align="center">4.0</td>
<td align="center">4.5</td>
<td align="center">0.0</td>
<td align="center">15.0</td>
<td align="center">10.0</td>
<td align="center">13.9</td>
<td align="center">9.0</td>
<td align="center">10.1</td>
</tr>
<tr>
<td align="left">i4</td>
<td align="center">11.0</td>
<td align="center">16.9</td>
<td align="center">15.0</td>
<td align="center">0.0</td>
<td align="center">5.3</td>
<td align="center">8.3</td>
<td align="center">7.9</td>
<td align="center">10.4</td>
</tr>
<tr>
<td align="left">i5</td>
<td align="center">6.0</td>
<td align="center">12.8</td>
<td align="center">10.0</td>
<td align="center">5.3</td>
<td align="center">0.0</td>
<td align="center">6.1</td>
<td align="center">6.0</td>
<td align="center">9.2</td>
</tr>
<tr>
<td align="left">i6</td>
<td align="center">9.7</td>
<td align="center">17.7</td>
<td align="center">13.9</td>
<td align="center">8.3</td>
<td align="center">6.1</td>
<td align="center">0.0</td>
<td align="center">12.1</td>
<td align="center">15.3</td>
</tr>
<tr>
<td align="left">i7</td>
<td align="center">7.2</td>
<td align="center">9.5</td>
<td align="center">9.0</td>
<td align="center">7.9</td>
<td align="center">6.0</td>
<td align="center">12.1</td>
<td align="center">0.0</td>
<td align="center">3.1</td>
</tr>
<tr>
<td align="left">i8</td>
<td align="center">9.5</td>
<td align="center">9.0</td>
<td align="center">10.1</td>
<td align="center">10.4</td>
<td align="center">9.2</td>
<td align="center">15.3</td>
<td align="center">3.1</td>
<td align="center">0.0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Following steps 1&#x2013;7 of the AHP-COPRAS method, the weighted normalised matrix is derived and the priority value <italic>Qi</italic> and utility <italic>Ui</italic> are computed. <xref ref-type="table" rid="T0004">Table 4</xref> represents the final matrix of calculation.</p>
<table-wrap id="T0004">
<label>TABLE 4</label>
<caption><p>Normalised weighted decision matrix.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">Weights</th>
<th align="center">0.122</th>
<th align="center">0.092</th>
<th align="center">0.205</th>
<th align="center">0.062</th>
<th align="center">0.150</th>
<th align="center">0.166</th>
<th align="center">0.138</th>
<th align="center">0.065</th>
<th align="center">Sum of beneficiary attributes</th>
<th align="center">Sum of non-beneficiary attributes</th>
<th align="center">Relative significance value</th>
<th align="center">Utility</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">-Alternatives</td>
<td align="center">C1<sup><bold>&#x2212;</bold></sup></td>
<td align="center">C2<sup><bold>&#x2212;</bold></sup></td>
<td align="center">C3<sup><bold>&#x2212;</bold></sup></td>
<td align="center">C4<sup><bold>+</bold></sup></td>
<td align="center">C5<sup><bold>+</bold></sup></td>
<td align="center">C6<sup><bold>+</bold></sup></td>
<td align="center">C7<sup><bold>+</bold></sup></td>
<td align="center">C8<sup><bold>+</bold></sup></td>
<td align="center">Sj<sup><bold>+</bold></sup></td>
<td align="center">Sj<sup>-</sup></td>
<td align="center">Qj</td>
<td align="center">Ui</td>
</tr>
<tr>
<td align="left">A1</td>
<td align="center">0.016</td>
<td align="center">0.014</td>
<td align="center">0.040</td>
<td align="center">0.010</td>
<td align="center">0.030</td>
<td align="center">0.010</td>
<td align="center">0.021</td>
<td align="center">0.003</td>
<td align="center">0.074</td>
<td align="center">0.070</td>
<td align="center">0.112</td>
<td align="center">75.3</td>
</tr>
<tr>
<td align="left">A2</td>
<td align="center">0.014</td>
<td align="center">0.011</td>
<td align="center">0.022</td>
<td align="center">0.004</td>
<td align="center">0.009</td>
<td align="center">0.034</td>
<td align="center">0.009</td>
<td align="center">0.016</td>
<td align="center">0.072</td>
<td align="center">0.046</td>
<td align="center">0.129</td>
<td align="center">86.9</td>
</tr>
<tr>
<td align="left">A3</td>
<td align="center">0.015</td>
<td align="center">0.011</td>
<td align="center">0.022</td>
<td align="center">0.008</td>
<td align="center">0.011</td>
<td align="center">0.014</td>
<td align="center">0.014</td>
<td align="center">0.009</td>
<td align="center">0.055</td>
<td align="center">0.048</td>
<td align="center">0.111</td>
<td align="center">74.3</td>
</tr>
<tr>
<td align="left">A4</td>
<td align="center">0.016</td>
<td align="center">0.009</td>
<td align="center">0.013</td>
<td align="center">0.005</td>
<td align="center">0.013</td>
<td align="center">0.037</td>
<td align="center">0.012</td>
<td align="center">0.012</td>
<td align="center">0.078</td>
<td align="center">0.037</td>
<td align="center">0.149</td>
<td align="center">100</td>
</tr>
<tr>
<td align="left">A5</td>
<td align="center">0.015</td>
<td align="center">0.014</td>
<td align="center">0.037</td>
<td align="center">0.009</td>
<td align="center">0.024</td>
<td align="center">0.020</td>
<td align="center">0.021</td>
<td align="center">0.009</td>
<td align="center">0.083</td>
<td align="center">0.066</td>
<td align="center">0.123</td>
<td align="center">82.6</td>
</tr>
<tr>
<td align="left">A6</td>
<td align="center">0.021</td>
<td align="center">0.011</td>
<td align="center">0.024</td>
<td align="center">0.008</td>
<td align="center">0.016</td>
<td align="center">0.010</td>
<td align="center">0.019</td>
<td align="center">0.006</td>
<td align="center">0.058</td>
<td align="center">0.055</td>
<td align="center">0.107</td>
<td align="center">71.8</td>
</tr>
<tr>
<td align="left">A7</td>
<td align="center">0.012</td>
<td align="center">0.012</td>
<td align="center">0.026</td>
<td align="center">0.010</td>
<td align="center">0.029</td>
<td align="center">0.020</td>
<td align="center">0.021</td>
<td align="center">0.005</td>
<td align="center">0.085</td>
<td align="center">0.050</td>
<td align="center">0.138</td>
<td align="center">92.9</td>
</tr>
<tr>
<td align="left">A8</td>
<td align="center">0.012</td>
<td align="center">0.011</td>
<td align="center">0.022</td>
<td align="center">0.009</td>
<td align="center">0.018</td>
<td align="center">0.022</td>
<td align="center">0.019</td>
<td align="center">0.005</td>
<td align="center">0.072</td>
<td align="center">0.044</td>
<td align="center">0.131</td>
<td align="center">88.2</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The inference drawn from <xref ref-type="table" rid="T0004">Table 4</xref> is that A4 is the best choice among the alternatives. A7 is the second best and third and fourth choices are A8 and A2. The last column represents the utility of each CC, which reflects the relative sustainable performance of each CC. This column vector is used as an input parameter for solving the proposed mathematical model.</p>
<p>The data set provided by the company is as follows: The fixed cost of expansion of each CC is Rs. 150 000, Rs. 100 000, Rs. 120 000, Rs. 100 000, Rs. 110 000, Rs. 130 000, Rs. 130 000 and Rs. 110 000, respectively, while the per square foot cost of expansion is Rs. 110, Rs. 60, Rs. 60, Rs. 35, Rs. 100, Rs. 65, Rs. 70 and Rs. 60, respectively, for each CC. The repair cost per unit product at each CC is Rs. 130. The per kilometre transportation cost is Rs. 10, the penalty cost per unit is Rs. 20 and the total budget for expansion is Rs. 450 000. The lower limits for the capacity of the CCs are 180, 250, 150, 250, 180, 170, 185 and 240, respectively, with the upper limits set as 350, 200, 400, 250, 250, 300 and 260, respectively. The distance of each CC from the dismantling unit at Mayapuri (in km) is 9.4, 13.5, 12.4, 4, 5, 10.5, 4 and 6.4, respectively.</p>
</sec>
<sec id="s0018">
<title>Results and discussion</title>
<sec id="s20019">
<title>Outline of the results</title>
<p>The fuzzy bi-objective model proposed in the study aims at attaining RL network design in which strategic decisions of evaluation and selection of CCs as RFs and their capacity expansion and operational decision of determining the amount of returns to be repaired are integrated. While doing so, the model seeks for a trade-off between the overall cost of the network and the sustainable performance of the selected CCs. Firstly, to understand the nature of conflict between the objectives, the bi-objective problem is first solved as two separate problems using Lingo 11.0, utilising the above data set. The minimum threshold of utility is taken as 70&#x0025; and at most, three RFs can be opened. The company wants to eliminate the option of selecting CCs with low environmental and social performance; therefore, the minimum threshold for environmental criteria as well as social criteria is taken as 7. Solving for objective 1, which is the cost objective, the model yields a cost of Rs. 1 665 790 and total utility value of 261.22. The CCs selected for expansion are A2, A3 and A4 and the expansion budget utilisation is Rs. 422 200 with a penalty cost of Rs. 21 000. To optimise the cost objective, the model has opted for CCs with lower expansion costs and compromised on their sustainable performance. Maximisation of the second objective leads to a different result. The total utility value of 281.165 is attained at the cost of Rs. 2 088 840 with A4, A7 and A8 selected as RFs. The selected CCs rank first, second and third in the evaluation process and incur a higher cost of expansion. The cost of Rs. 427 900 is required for expansion, bearing a penalty cost of Rs. 23 000. The two single-objective models clearly show the conflict between the goals. This clearly justifies the use of fuzzy programming approach for providing flexibility to the DMs in explicitly adjusting the target values and tolerance levels of the goals. A compromised solution is arrived by developing Lingo code for problem (P4) and by defining appropriate membership functions using the target and tolerance values for the goals. The weights assigned by the DMs are <italic>w</italic><sub>1</sub> = 0.3 and <italic>w</italic><sub>2</sub> = 0.7. The compromised solution obtained at the DM&#x2019;s satisfaction level of 0.829 yields a cost of Rs. 1 829 847 and an overall utility value of 279.8565. Thus, the fuzzy model has effectively attained a compromised solution as per DM&#x2019;s desirability level. To elaborate upon, we analyse the result findings carefully.</p>
<p>The primary focus of the fuzzy model was to optimally select CCs as RFs and determine the number products to be repaired at each RF, so that a trade-off can be attained between the cost and the sustainable performance of the CCs. Because A4 was the common choice in both cases, it has obviously been selected in the final compromised solution as well. The three CCs selected to function as RFs are Vaishalli (A2), Dwarka (A4) and Karol Bagh (A7), with ranks first, second and fourth. The total number of products to be repaired at these RFs are 334, 310 and 201, respectively; thus, a total of 845 products are repaired. A total budget of Rs. 412 600 is needed with a penalty cost of Rs. 4100. At Vaishalli (A2), a total of 334 units from East of Kailash (A1), Vaishalli (A2) and Noida (A3) are repaired; at Dwarka (A4), a total of 310 returns from Dwarka (A4), Vasant Kunj (A5) and Sushant Lok (A6) are repaired, whereas at Karol Bagh (A7), a total of 201 returns from Karol Bagh (A7) and Model Town (A8) are repaired. The total budget required for expansion is Rs. 431 800 with a penalty cost of Rs. 41 000. The results clearly validate the efficiency of the fuzzy multi-objective optimisation model proposed in the study. The model selects the CCs that can function as RFs, determines the number of products that can be repaired and accordingly the capacity of the selected CC is expanded so the burden of the penalty cost is not much. Although the penalty cost has increased, the budget for expansion has been optimally utilised. The main focus of the firm for designing the RL network is to gain economical value from the returns and enhance their sustainable image. A total of 845 products are repaired, which provide substantial economical gains to the firm. Furthermore, the setting up of RFs based on the sustainable criteria ensures that the firm can attain a sustainable recovery channel for handling its returns.</p>
</sec>
<sec id="s20020">
<title>Practical implications</title>
<p>The implications drawn from the result findings can be summarised as follows:
<list list-type="bullet">
<list-item><p>The results reaffirm that electronic manufacturers must not consider adopting RL just as a legal burden and outsource it to 3PRLs, but as an opportunity for collaborating with other reverse SC actors for economic as well as socio-environmental gains.</p></list-item>
<list-item><p>The compromised solution attained by the proposed fuzzy model demonstrates that the cost differential for choosing RFs with better environmental and social performance is not significant; therefore, manufacturers must not compromise on the sustainability aspects for facility location decisions.</p></list-item>
<list-item><p>Because the proposed model has a general structure, it can be suitably adopted by other industries in modifying their approach towards RL and incorporating environmental and social considerations at the design phase of the RL network.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s0021">
<title>Conclusion</title>
<p>Government regulations, customer pressure and market competence are binding factors for electronics manufacturers to design a sustainable recovery model for consumer returns. The manufacturers have also started to realise the potential of RL and consequently are inclined to handle the returns themselves more effectively and responsibly. In this regard, a bi-objective fuzzy decision-making model is proposed in the study, which can serve as a decision tool for the Indian manufacturers in designing a sustainable RL network for managing end-of-life and end-of-use returns. It is a two-phase model where the first phase involves using a combined AHP-COPRAS methodology for evaluation of the CCs for carrying the repair and refurbishment process. The final selection is done in the second phase with the aid of a mixed integer fuzzy linear programming formulation, which effectively determines the number, location and capacity of RFs, the penalty cost and the number of returns to be repaired at each selected facility. Fuzzy programming approach is used effectively in obtaining a properly efficient solution that satisfies the DM&#x2019;s desired aspiration level for the goals of minimising cost and maximising the sustainable performance of the RFs. The notable feature of the model is the evaluation of CCs under financial, environmental and social considerations and integration of the facility selection decisions with the network designing. This study indicates through the results discussed how an electronic firm in India can earn a sustainable system for their returns in the most cost-efficient way. The study can further elaborate on the nature of collaboration with third-party providers and association with NGOs to develop a RL network that clearly defines and determines the role of each party in the functioning of the RL network.</p>
</sec>
</body>
<back>
<ack>
<title>Acknowledgements</title>
<sec id="s20022" sec-type="COI-statement">
<title>Competing interests</title>
<p>The authors declare that they have no financial or personal relationships that may have inappropriately influenced them in writing this article.</p>
</sec>
<sec id="s20023">
<title>Authors&#x2019; contributions</title>
<p>All authors have contributed equally to the manuscript.</p>
</sec>
</ack>
<ref-list id="references">
<title>References</title>
<ref id="CIT0001"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdessalem</surname>, <given-names>M</given-names></string-name>., <string-name><surname>Hadj-Alouane</surname>, <given-names>A.B</given-names></string-name>. &#x0026; <string-name><surname>Riopel</surname>, <given-names>D</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>Decision modelling of reverse logistics systems: Selection of recovery operations for end-of-life products</article-title>&#x2019;, <source><italic>International Journal of Logistics Systems and Management</italic></source> <volume>13</volume>(<issue>2</issue>), <fpage>139</fpage>&#x2013;<lpage>161</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1504/IJLSM.2012.048933">https://doi.org/10.1504/IJLSM.2012.048933</ext-link></comment></mixed-citation></ref>
<ref id="CIT0002"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Achillas</surname>, <given-names>C</given-names></string-name>., <string-name><surname>Vlachokostas</surname>, <given-names>C</given-names></string-name>., <string-name><surname>Aidonis</surname>, <given-names>D</given-names></string-name>., <string-name><surname>Moussiopoulos</surname>, <given-names>&#x039D;</given-names></string-name>., <string-name><surname>Iakovou</surname>, <given-names>E</given-names></string-name>. &#x0026; <string-name><surname>Banias</surname>, <given-names>G</given-names></string-name></person-group>., <year>2010a</year>, &#x2018;<article-title>Optimising reverse logistics network to support policy-making in the case of electrical and electronic equipment</article-title>&#x2019;, <source><italic>Waste Management</italic></source> <volume>30</volume>(<issue>12</issue>), <fpage>2592</fpage>&#x2013;<lpage>2600</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.wasman.2010.06.022">https://doi.org/10.1016/j.wasman.2010.06.022</ext-link></comment></mixed-citation></ref>
<ref id="CIT0003"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Achillas</surname>, <given-names>C</given-names></string-name>., <string-name><surname>Vlachokostas</surname>, <given-names>C</given-names></string-name>., <string-name><surname>Moussiopoulos</surname>, <given-names>&#x039D;</given-names></string-name>. &#x0026; <string-name><surname>Banias</surname>, <given-names>G</given-names></string-name></person-group>., <year>2010b</year>, &#x2018;<article-title>Decision support system for the optimal location of electrical and electronic waste treatment plants: A case study in Greece</article-title>&#x2019;, <source><italic>Waste Management</italic></source> <volume>30</volume>(<issue>5</issue>), <fpage>870</fpage>&#x2013;<lpage>879</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/-10.1016/j.wasman.2009.11.029">https://doi.org/-10.1016/j.wasman.2009.11.029</ext-link></comment></mixed-citation></ref>
<ref id="CIT0004"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Agarwal</surname>, <given-names>V</given-names></string-name>., <string-name><surname>Govindan</surname>, <given-names>K</given-names></string-name>., <string-name><surname>Darbari</surname>, <given-names>J.D</given-names></string-name>. &#x0026; <string-name><surname>Jha</surname>, <given-names>P.C</given-names></string-name></person-group>., <year>2016</year>, &#x2018;<article-title>An optimization model for sustainable solutions towards implementation of reverse logistics under collaborative framework</article-title>&#x2019;, <source><italic>International Journal of System Assurance Engineering and Management</italic></source> <volume>7</volume>(<issue>4</issue>), <fpage>480</fpage>&#x2013;<lpage>487</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s13198-016-0486-3">https://doi.org/10.1007/s13198-016-0486-3</ext-link></comment></mixed-citation></ref>
<ref id="CIT0005"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Alumur</surname>, <given-names>S.A</given-names></string-name>., <string-name><surname>Kara</surname>, <given-names>B.Y</given-names></string-name>. &#x0026; <string-name><surname>Melo</surname>, <given-names>M.T</given-names></string-name></person-group>., <year>2015</year>, &#x2018;<chapter-title>Location and logistics</chapter-title>&#x2019;, in <person-group person-group-type="editor"><string-name><given-names>G.</given-names> <surname>Laporte</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nickel</surname></string-name> &#x0026; <string-name><given-names>F.</given-names> <surname>Saldanha da Gama</surname></string-name> (eds.)</person-group>, <source><italic>Location science</italic></source>, pp. <fpage>419</fpage>&#x2013;<lpage>441</lpage>, <publisher-name>Springer International Publishing</publisher-name>, <publisher-loc>Cham</publisher-loc>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-13111-5_16">https://doi.org/10.1007/978-3-319-13111-5_16</ext-link></comment></mixed-citation></ref>
<ref id="CIT0006"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alumur</surname>, <given-names>S.A</given-names></string-name>., <string-name><surname>Nickel</surname>, <given-names>S</given-names></string-name>., <string-name><surname>Saldanha-da-Gama</surname>, <given-names>F</given-names></string-name>. &#x0026; <string-name><surname>Verter</surname>, <given-names>V</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>Multi-period reverse logistics network design</article-title>&#x2019;, <source><italic>European Journal of Operational Research</italic></source> <volume>220</volume>(<issue>1</issue>), <fpage>67</fpage>&#x2013;<lpage>78</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2011.12.045">https://doi.org/10.1016/j.ejor.2011.12.045</ext-link></comment></mixed-citation></ref>
<ref id="CIT0007"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Aras</surname>, <given-names>N</given-names></string-name>., <string-name><surname>Aksen</surname>, <given-names>D</given-names></string-name>. &#x0026; <string-name><surname>Tanu&#x011F;ur</surname>, <given-names>A.G</given-names></string-name></person-group>., <year>2008</year>, &#x2018;<article-title>Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles</article-title>&#x2019;, <source><italic>European Journal of Operational Research</italic></source> <volume>191</volume>(<issue>3</issue>), <fpage>1223</fpage>&#x2013;<lpage>1240</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2007.08.002">https://doi.org/10.1016/j.ejor.2007.08.002</ext-link></comment></mixed-citation></ref>
<ref id="CIT0008"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Aras</surname>, <given-names>N</given-names></string-name>., <string-name><surname>Korugan</surname>, <given-names>A</given-names></string-name>., <string-name><surname>B&#x00FC;y&#x00FC;k&#x00F6;zkan</surname>, <given-names>G</given-names></string-name>., <string-name><surname>&#x015E;erifo&#x011F;lu</surname>, <given-names>F.S</given-names></string-name>., <string-name><surname>Erol</surname>, <given-names>I</given-names></string-name>. &#x0026; <string-name><surname>Velio&#x011F;lu</surname>, <given-names>M.N</given-names></string-name></person-group>., <year>2015</year>, &#x2018;<article-title>Locating recycling facilities for IT-based electronic waste in Turkey</article-title>&#x2019;, <source><italic>Journal of Cleaner Production</italic></source> <volume>105</volume>, <fpage>324</fpage>&#x2013;<lpage>336</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jclepro.2015.02.046">https://doi.org/10.1016/j.jclepro.2015.02.046</ext-link></comment></mixed-citation></ref>
<ref id="CIT0009"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Assavapokee</surname>, <given-names>T</given-names></string-name>. &#x0026; <string-name><surname>Wongthatsanekorn</surname>, <given-names>W</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>Reverse production system infrastructure design for electronic products in the state of Texas</article-title>&#x2019;, <source><italic>Computers &#x0026; Industrial Engineering</italic></source> <volume>62</volume>(<issue>1</issue>), <fpage>129</fpage>&#x2013;<lpage>140</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2011.09.001">https://doi.org/10.1016/j.cie.2011.09.001</ext-link></comment></mixed-citation></ref>
<ref id="CIT0010"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bellman</surname>, <given-names>R.E</given-names></string-name>. &#x0026; <string-name><surname>Zadeh</surname>, <given-names>L.A</given-names></string-name></person-group>., <year>1970</year>, &#x2018;<article-title>Decision-making in a fuzzy environment</article-title>&#x2019;, <source><italic>Management Science</italic></source> <volume>17</volume>(<issue>4</issue>), <fpage>B-141</fpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/mnsc.17.-4.B141">https://doi.org/10.1287/mnsc.17.-4.B141</ext-link></comment></mixed-citation></ref>
<ref id="CIT0011"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Borthakur</surname>, <given-names>A</given-names></string-name>. &#x0026; <string-name><surname>Singh</surname>, <given-names>P</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>Electronic waste in India: Problems and policies</article-title>&#x2019;, <source><italic>International Journal of Environmental Sciences</italic></source> <volume>3</volume>(<issue>1</issue>), <fpage>353</fpage>&#x2013;<lpage>362</lpage>.</mixed-citation></ref>
<ref id="CIT0012"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>L</given-names></string-name>., <string-name><surname>Olhager</surname>, <given-names>J</given-names></string-name>. &#x0026; <string-name><surname>Tang</surname>, <given-names>O</given-names></string-name></person-group>., <year>2014</year>, &#x2018;<article-title>Manufacturing facility location and sustainability: A literature review and research agenda</article-title>&#x2019;, <source><italic>International Journal of Production Economics</italic></source> <volume>149</volume>, <fpage>154</fpage>&#x2013;<lpage>163</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ijpe.2013.05.013">https://doi.org/10.1016/j.ijpe.2013.05.013</ext-link></comment></mixed-citation></ref>
<ref id="CIT0013"><mixed-citation publication-type="conference"><person-group person-group-type="author"><string-name><surname>Darbari</surname>, <given-names>J.D</given-names></string-name>., <string-name><surname>Agarwal</surname>, <given-names>V</given-names></string-name>., <string-name><surname>Chaudhary</surname>, <given-names>K</given-names></string-name>. &#x0026; <string-name><surname>Jha</surname>, <given-names>P.C</given-names></string-name></person-group>., <year>2015</year>, &#x2018;<article-title>Multi-criteria decision approach for a sustainable reverse logistics network under fuzzy environment</article-title>&#x2019;, in <conf-name>2015 International Conference on Industrial Engineering and Operations Management (IEOM)</conf-name>, <conf-loc>Dubai, United Arab Emirates (UAE)</conf-loc>, <conf-date>March 03&#x2013;05, 2015</conf-date>, <publisher-name>IEEE</publisher-name>, pp. <fpage>1</fpage>&#x2013;<lpage>7</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/IEOM.2015.7093813">https://doi.org/10.1109/IEOM.2015.7093813</ext-link></comment></mixed-citation></ref>
<ref id="CIT0014"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Darbari</surname>, <given-names>J.D</given-names></string-name>., <string-name><surname>Agarwal</surname>, <given-names>V</given-names></string-name>. &#x0026; <string-name><surname>Jha</surname>, <given-names>P.C</given-names></string-name></person-group>., <year>2016</year>, &#x2018;<article-title>Reverse logistics as a sustainable value proposition for product acquisition</article-title>&#x2019;, <source><italic>Journal of Information and Optimization Sciences</italic></source> <volume>37</volume>(<issue>5</issue>), <fpage>791</fpage>&#x2013;<lpage>817</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/02522667.2016.1191189">https://doi.org/10.1080/02522667.2016.1191189</ext-link></comment></mixed-citation></ref>
<ref id="CIT0015"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dehghanian</surname>, <given-names>F</given-names></string-name>. &#x0026; <string-name><surname>Mansour</surname>, <given-names>S</given-names></string-name></person-group>., <year>2009</year>, &#x2018;<article-title>Designing sustainable recovery network of end-of-life products using genetic algorithm</article-title>&#x2019;, <source><italic>Resources, Conservation and Recycling</italic></source> <volume>53</volume>(<issue>10</issue>), <fpage>559</fpage>&#x2013;<lpage>570</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.resconrec.2009.04.007">https://doi.org/10.1016/j.resconrec.2009.04.007</ext-link></comment></mixed-citation></ref>
<ref id="CIT0016"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Diabat</surname>, <given-names>A</given-names></string-name>., <string-name><surname>Abdallah</surname>, <given-names>T</given-names></string-name>. &#x0026; <string-name><surname>Henschel</surname>, <given-names>A</given-names></string-name></person-group>., <year>2015</year>, &#x2018;<article-title>A closed-loop location-inventory problem with spare parts consideration</article-title>&#x2019;, <source><italic>Computers &#x0026; Operations Research</italic></source> <volume>54</volume>, <fpage>245</fpage>&#x2013;<lpage>256</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2011.12.045">https://doi.org/10.1016/j.ejor.2011.12.045</ext-link></comment></mixed-citation></ref>
<ref id="CIT0017"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dwivedy</surname>, <given-names>M</given-names></string-name>. &#x0026; <string-name><surname>Mittal</surname>, <given-names>R.K</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>An investigation into e-waste flows in India</article-title>&#x2019;, <source><italic>Journal of Cleaner Production</italic></source> <volume>37</volume>, <fpage>229</fpage>&#x2013;<lpage>242</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jclep-ro.2012.07.017">https://doi.org/10.1016/j.jclep-ro.2012.07.017</ext-link></comment></mixed-citation></ref>
<ref id="CIT0018"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ertu&#x011F;rul</surname>, <given-names>I</given-names></string-name></person-group>., <year>2011</year>, &#x2018;<article-title>Fuzzy group decision making for the selection of facility location</article-title>&#x2019;, <source><italic>Group Decision and Negotiation</italic></source> <volume>20</volume>(<issue>6</issue>), <fpage>725</fpage>&#x2013;<lpage>740</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.100-7/s10726-010-9219-1">https://doi.org/10.100-7/s10726-010-9219-1</ext-link></comment></mixed-citation></ref>
<ref id="CIT0019"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gadakh</surname>, <given-names>V.S</given-names></string-name></person-group>., <year>2014</year>, &#x2018;<article-title>Application of complex proportional assessment method for vendor selection</article-title>&#x2019;, <source><italic>International Journal of Logistics Research and Applications</italic></source> <volume>17</volume>(<issue>1</issue>), <fpage>23</fpage>&#x2013;<lpage>34</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/13675567.2013.836159">https://doi.org/10.1080/13675567.2013.836159</ext-link></comment></mixed-citation></ref>
<ref id="CIT0020"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Geoffrion</surname>, <given-names>A.M</given-names></string-name></person-group>., <year>1967</year>, <source><italic>Proper efficiency and the theory of vector maximization</italic></source>, <publisher-name>Western Management Science Institute, University of California</publisher-name>, <publisher-loc>Los Angeles, CA</publisher-loc>.</mixed-citation></ref>
<ref id="CIT0021"><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Google Maps</collab></person-group>, <year>n.d.</year>, <source><italic>Delhi</italic></source>, <comment>viewed n.d., from <ext-link ext-link-type="uri" xlink:href="https://www.google.co.in/maps/place/Delhi">https://www.google.co.in/maps/place/Delhi</ext-link></comment></mixed-citation></ref>
<ref id="CIT0022"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gomes</surname>, <given-names>M.I</given-names></string-name>., <string-name><surname>Barbosa-Povoa</surname>, <given-names>A.P</given-names></string-name>. &#x0026; <string-name><surname>Novais</surname>, <given-names>A.Q</given-names></string-name></person-group>., <year>2011</year>, &#x2018;<article-title>Modelling a recovery network for WEEE: A case study in Portugal</article-title>&#x2019;, <source><italic>Waste Management</italic></source> <volume>31</volume>(<issue>7</issue>), <fpage>1645</fpage>&#x2013;<lpage>1660</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.wasman.2011.02.023">https://doi.org/10.1016/j.wasman.2011.02.023</ext-link></comment></mixed-citation></ref>
<ref id="CIT0023"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ilgin</surname>, <given-names>M.A</given-names></string-name>. &#x0026; <string-name><surname>Gupta</surname>, <given-names>S.M</given-names></string-name></person-group>., <year>2010</year>, &#x2018;<article-title>Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art</article-title>&#x2019;, <source><italic>Journal of environmental Management</italic></source> <volume>91</volume>(<issue>3</issue>), <fpage>563</fpage>&#x2013;<lpage>591</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jenvm-an.2009.09.037">https://doi.org/10.1016/j.jenvm-an.2009.09.037</ext-link></comment></mixed-citation></ref>
<ref id="CIT0024"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jim&#x00E9;nez</surname>, <given-names>M</given-names></string-name>. &#x0026; <string-name><surname>Bilbao</surname>, <given-names>A</given-names></string-name></person-group>., <year>2009</year>, &#x2018;<article-title>Pareto-optimal solutions in fuzzy multi-objective linear programming</article-title>&#x2019;, <source><italic>Fuzzy Sets and Systems</italic></source> <volume>160</volume>(<issue>18</issue>), <fpage>2714</fpage>&#x2013;<lpage>2721</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/1-0.1016/j.fs-s.2008.12.005">https://doi.org/1-0.1016/j.fs-s.2008.12.005</ext-link></comment></mixed-citation></ref>
<ref id="CIT0025"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kannan</surname>, <given-names>D</given-names></string-name>., <string-name><surname>Diabat</surname>, <given-names>A</given-names></string-name>., <string-name><surname>Alrefaei</surname>, <given-names>M</given-names></string-name>., <string-name><surname>Govindan</surname>, <given-names>K</given-names></string-name>. &#x0026; <string-name><surname>Yong</surname>, <given-names>G</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>A carbon footprint based reverse logistics network design model</article-title>&#x2019;, <source><italic>Resources, conservation and recycling</italic></source> <volume>67</volume>, <fpage>75</fpage>&#x2013;<lpage>79</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.resconrec.2012.03.005">https://doi.org/10.1016/j.resconrec.2012.03.005</ext-link></comment></mixed-citation></ref>
<ref id="CIT0026"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khor</surname>, <given-names>K.S</given-names></string-name>., <string-name><surname>Udin</surname>, <given-names>Z.M</given-names></string-name>., <string-name><surname>Ramayah</surname>, <given-names>T</given-names></string-name>. &#x0026; <string-name><surname>Hazen</surname>, <given-names>B.T</given-names></string-name></person-group>., <year>2016</year>, &#x2018;<article-title>Reverse logistics in Malaysia: The contingent role of institutional pressure</article-title>&#x2019;, <source><italic>International Journal of Production Economics</italic></source> <volume>175</volume>, <fpage>96</fpage>&#x2013;<lpage>108</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ijpe.2016.01.020">https://doi.org/10.1016/j.ijpe.2016.01.020</ext-link></comment></mixed-citation></ref>
<ref id="CIT0027"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kim</surname>, <given-names>J.S</given-names></string-name>. &#x0026; <string-name><surname>Lee</surname>, <given-names>D.H</given-names></string-name></person-group>., <year>2013</year>, &#x2018;<article-title>A restricted dynamic model for refuse collection network design in reverse logistics</article-title>&#x2019;, <source><italic>Computers &#x0026; Industrial Engineering</italic></source> <volume>66</volume>(<issue>4</issue>), <fpage>1131</fpage>&#x2013;<lpage>1137</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2013.08.001">https://doi.org/10.1016/j.cie.2013.08.001</ext-link></comment></mixed-citation></ref>
<ref id="CIT0028"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname>, <given-names>C.C</given-names></string-name></person-group>., <year>2004</year>, &#x2018;<article-title>A weighted max&#x2013;min model for fuzzy goal programming</article-title>&#x2019;, <source><italic>Fuzzy Sets and Systems</italic></source> <volume>142</volume>(<issue>3</issue>), <fpage>407</fpage>&#x2013;<lpage>420</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0165-0114(03)00092-7">https://doi.org/10.1016/S0165-0114(03)00092-7</ext-link></comment></mixed-citation></ref>
<ref id="CIT0029"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname>, <given-names>S</given-names></string-name>., <string-name><surname>Chan</surname>, <given-names>F.T</given-names></string-name>. &#x0026; <string-name><surname>Chung</surname>, <given-names>S.H</given-names></string-name></person-group>., <year>2011</year>, &#x2018;<article-title>A study of distribution center location based on the rough sets and interactive multi-objective fuzzy decision theory</article-title>&#x2019;, <source><italic>Robotics and Computer-Integrated Manufacturing</italic></source> <volume>27</volume>(<issue>2</issue>), <fpage>426</fpage>&#x2013;<lpage>433</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/1-0.1016/j.rcim.2010.09.003">https://doi.org/1-0.1016/j.rcim.2010.09.003</ext-link></comment></mixed-citation></ref>
<ref id="CIT0030"><mixed-citation publication-type="conference"><person-group person-group-type="author"><string-name><surname>Mahmoudzadeh</surname>, <given-names>M</given-names></string-name>., <string-name><surname>Mansour</surname>, <given-names>S</given-names></string-name>. &#x0026; <string-name><surname>Karimi</surname>, <given-names>B</given-names></string-name></person-group>., <year>2011a</year>, &#x2018;<article-title>A decentralized reverse logistics network for end of life vehicles from third party provider perspective</article-title>&#x2019;, in <conf-name>2nd International Conference on Environmental Science and Technology</conf-name>, <conf-loc>Belgrade, Serbia</conf-loc>, <conf-date>28th September&#x2013;2nd October, 2016</conf-date>, <volume>vol. 6</volume>, pp. <fpage>2338</fpage>&#x2013;<lpage>2342</lpage>.</mixed-citation></ref>
<ref id="CIT0031"><mixed-citation publication-type="conference"><person-group person-group-type="author"><string-name><surname>Mahmoudzadeh</surname>, <given-names>M</given-names></string-name>., <string-name><surname>Mansour</surname>, <given-names>S</given-names></string-name>., <string-name><surname>Shokoohyar</surname>, <given-names>S</given-names></string-name>. &#x0026; <string-name><surname>Karimi</surname>, <given-names>B</given-names></string-name></person-group>., <year>2011b</year>, &#x2018;<article-title>Designing modelling a third party reverse logistics network for end of life vehicles</article-title>&#x2019;, in <conf-name>14th International Business Research Conference</conf-name>, <conf-loc>Dubai, United Arab Emirates</conf-loc>, <conf-date>April 28&#x2013;30, 2011</conf-date>, <volume>vol. 28</volume>, p. <fpage>e30</fpage>.</mixed-citation></ref>
<ref id="CIT0032"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Min</surname>, <given-names>H</given-names></string-name>. &#x0026; <string-name><surname>Ko</surname>, <given-names>H.J</given-names></string-name></person-group>., <year>2008</year>, &#x2018;<article-title>The dynamic design of a reverse logistics network from the perspective of third-party logistics service providers</article-title>&#x2019;, <source><italic>International Journal of Production Economics</italic></source> <volume>113</volume>(<issue>1</issue>), <fpage>176</fpage>&#x2013;<lpage>192</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ijpe.2007.01.017">https://doi.org/10.1016/j.ijpe.2007.01.017</ext-link></comment></mixed-citation></ref>
<ref id="CIT0033"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mutha</surname>, <given-names>A</given-names></string-name>. &#x0026; <string-name><surname>Pokharel</surname>, <given-names>S</given-names></string-name></person-group>., <year>2009</year>, &#x2018;<article-title>Strategic network design for reverse logistics and remanufacturing using new and old product modules</article-title>&#x2019;, <source><italic>Computers &#x0026; Industrial Engineering</italic></source> <volume>56</volume>(<issue>1</issue>), <fpage>334</fpage>&#x2013;<lpage>346</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2008.06.006">https://doi.org/10.1016/j.cie.2008.06.006</ext-link></comment></mixed-citation></ref>
<ref id="CIT0034"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pochampally</surname>, <given-names>K.K</given-names></string-name>., <string-name><surname>Nukala</surname>, <given-names>S</given-names></string-name>. &#x0026; <string-name><surname>Gupta</surname>, <given-names>S.M</given-names></string-name></person-group>., <year>2008</year>, <source><italic>Strategic planning models for reverse and closed-loop supply chains</italic></source>, <publisher-name>CRC Press</publisher-name>, <publisher-loc>Boca Raton, FL</publisher-loc>.</mixed-citation></ref>
<ref id="CIT0035"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Queiruga</surname>, <given-names>D</given-names></string-name>., <string-name><surname>Walther</surname>, <given-names>G</given-names></string-name>., Gonzalez-<string-name><surname>Benito</surname>, <given-names>J</given-names></string-name>. &#x0026; <string-name><surname>Spengler</surname>, <given-names>T</given-names></string-name></person-group>., <year>2008</year>, &#x2018;<article-title>Evaluation of sites for the location of WEEE recycling plants in Spain</article-title>&#x2019;, <source><italic>Waste Management</italic></source> <volume>28</volume>(<issue>1</issue>), <fpage>181</fpage>&#x2013;<lpage>190</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.wasman.2006.11.001">https://doi.org/10.1016/j.wasman.2006.11.001</ext-link></comment></mixed-citation></ref>
<ref id="CIT0036"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ravi</surname>, <given-names>V</given-names></string-name>. &#x0026; <string-name><surname>Shankar</surname>, <given-names>R</given-names></string-name></person-group>., <year>2015</year>, &#x2018;<article-title>Survey of reverse logistics practices in manufacturing industries: An Indian context</article-title>&#x2019;, <source><italic>Benchmarking: An International Journal</italic></source> <volume>22</volume>(<issue>5</issue>), <fpage>874</fpage>&#x2013;<lpage>899</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1108/BIJ-06-2013-0066">https://doi.org/10.1108/BIJ-06-2013-0066</ext-link></comment></mixed-citation></ref>
<ref id="CIT0037"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rezaeiniya</surname>, <given-names>N</given-names></string-name>., <string-name><surname>Zolfani</surname>, <given-names>S.H</given-names></string-name>. &#x0026; <string-name><surname>Zavadskas</surname>, <given-names>E.K</given-names></string-name></person-group>., <year>2012</year>, &#x2018;<article-title>Greenhouse locating based on ANP-COPRAS-G methods&#x2013;an empirical study based on Iran</article-title>&#x2019;, <source><italic>International Journal of Strategic Property Management</italic></source> <volume>16</volume>(<issue>2</issue>), <fpage>188</fpage>&#x2013;<lpage>200</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3846/1648715X.2012.686459">https://doi.org/10.3846/1648715X.2012.686459</ext-link></comment></mixed-citation></ref>
<ref id="CIT0038"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Saaty</surname>, <given-names>R.W</given-names></string-name></person-group>., <year>1987</year>, &#x2018;<article-title>The analytic hierarchy process &#x2013; What it is and how it is used</article-title>&#x2019;, <source><italic>Mathematical Modelling</italic></source> <volume>9</volume>(<issue>3</issue>), <fpage>161</fpage>&#x2013;<lpage>176</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0270-0255(87)90473-8">https://doi.org/10.1016/0270-0255(87)90473-8</ext-link></comment></mixed-citation></ref>
<ref id="CIT0039"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Sakawa</surname>, <given-names>M</given-names></string-name></person-group>., <year>2013</year>, <source><italic>Fuzzy sets and interactive multiobjective optimization</italic></source>, <publisher-name>Springer Science &#x0026; Business Media</publisher-name>, <publisher-loc>New York</publisher-loc>.</mixed-citation></ref>
<ref id="CIT0040"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shaik</surname>, <given-names>M.N</given-names></string-name>. &#x0026; <string-name><surname>Abdul-Kader</surname>, <given-names>W</given-names></string-name></person-group>., <year>2013</year>, &#x2018;<article-title>Transportation in reverse logistics enterprise: A comprehensive performance measurement methodology</article-title>&#x2019;, <source><italic>Production Planning &#x0026; Control</italic></source> <volume>24</volume>(<issue>6</issue>), <fpage>495</fpage>&#x2013;<lpage>510</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/09537287.2011.634180">https://doi.org/10.1080/09537287.2011.634180</ext-link></comment></mixed-citation></ref>
<ref id="CIT0041"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Steuer</surname>, <given-names>R.E</given-names></string-name></person-group>., <year>1986</year>, <source><italic>Multiple criteria optimization: Theory, computation, and applications</italic></source>, <publisher-name>Wiley</publisher-name>, <publisher-loc>New York</publisher-loc>.</mixed-citation></ref>
<ref id="CIT0042"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Subramoniam</surname>, <given-names>R</given-names></string-name>., <string-name><surname>Huisingh</surname>, <given-names>D</given-names></string-name>. &#x0026; <string-name><surname>Chinnam</surname>, <given-names>R.B</given-names></string-name></person-group>., <year>2010</year>, &#x2018;<article-title>Aftermarket remanufacturing strategic planning decision-making framework: Theory &#x0026; practice</article-title>&#x2019;, <source><italic>Journal of Cleaner Production</italic></source> <volume>18</volume>(<issue>16</issue>), <fpage>1575</fpage>&#x2013;<lpage>1586</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jclepro.2010.07.022">https://doi.org/10.1016/j.jclepro.2010.07.022</ext-link></comment></mixed-citation></ref>
<ref id="CIT0043"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tari</surname>, <given-names>I</given-names></string-name>. &#x0026; <string-name><surname>Alumur</surname>, <given-names>S.A</given-names></string-name></person-group>., <year>2014</year>, &#x2018;<article-title>Collection center location with equity considerations in reverse logistics networks</article-title>&#x2019;, <source><italic>INFOR: Information Systems and Operational Research</italic></source> <volume>52</volume>(<issue>4</issue>), <fpage>157</fpage>&#x2013;<lpage>173</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3138/infor.52.4.157">https://doi.org/10.3138/infor.52.4.157</ext-link></comment></mixed-citation></ref>
<ref id="CIT0044"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Temur</surname>, <given-names>G.T</given-names></string-name>., <string-name><surname>Kaya</surname>, <given-names>T</given-names></string-name>. &#x0026; <string-name><surname>Kahraman</surname>, <given-names>C</given-names></string-name></person-group>., <year>2014</year>, &#x2018;<chapter-title>Facility location selection in reverse logistics using a type-2 fuzzy decision aid method</chapter-title>&#x2019;, in <person-group person-group-type="editor"><string-name><given-names>C.</given-names> <surname>Kahraman</surname></string-name> &#x0026; <string-name><given-names>B.</given-names> <surname>&#x00D6;ztay&#x015F;i</surname></string-name> (eds.)</person-group>, <source><italic>Supply chain management under fuzziness</italic></source>, pp. <fpage>591</fpage>&#x2013;<lpage>606</lpage>, <publisher-name>Springer</publisher-name>, <publisher-loc>Berlin</publisher-loc>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/1-0.1007/978-3-642-53939-8_25">https://doi.org/1-0.1007/978-3-642-53939-8_25</ext-link></comment></mixed-citation></ref>
<ref id="CIT0045"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tiwari</surname>, <given-names>R.N</given-names></string-name>., <string-name><surname>Dharmar</surname>, <given-names>S</given-names></string-name>. &#x0026; <string-name><surname>Rao</surname>, <given-names>J.R</given-names></string-name></person-group>., <year>1987</year>, &#x2018;<article-title>Fuzzy goal programming &#x2013; An additive model</article-title>&#x2019;, <source><italic>Fuzzy Sets and Systems</italic></source> <volume>24</volume>(<issue>1</issue>), <fpage>27</fpage>&#x2013;<lpage>34</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0165-0114(87)90111-4">https://doi.org/10.1016/0165-0114(87)90111-4</ext-link></comment></mixed-citation></ref>
<ref id="CIT0046"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wath</surname>, <given-names>S.B</given-names></string-name>., <string-name><surname>Dutt</surname>, <given-names>P.S</given-names></string-name>. &#x0026; <string-name><surname>Chakrabarti</surname>, <given-names>T</given-names></string-name></person-group>., <year>2011</year>, &#x2018;<article-title>E-waste scenario in India, its management and implications</article-title>&#x2019;, <source><italic>Environmental Monitoring and Assessment</italic></source> <volume>172</volume>(<issue>1&#x2013;4</issue>), <fpage>249</fpage>&#x2013;<lpage>262</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10661-010-1331-9">https://doi.org/10.1007/s10661-010-1331-9</ext-link></comment></mixed-citation></ref>
<ref id="CIT0047"><mixed-citation publication-type="conference"><person-group person-group-type="author"><string-name><surname>Xianfeng</surname>, <given-names>L</given-names></string-name>., <string-name><surname>Jianwei</surname>, <given-names>Q</given-names></string-name>. &#x0026; <string-name><surname>Meilian</surname>, <given-names>L</given-names></string-name></person-group>., <year>2010</year>, &#x2018;<article-title>Design and simulation WEEE reverse logistics network in Guangxi</article-title>&#x2019;, in <conf-name>IEEE 2010 International Conference on Optoelectronics and Image Processing (ICOIP)</conf-name>, <conf-loc>Haiko, Hainan, China</conf-loc>, <conf-date>November 11&#x2013;12, 2010</conf-date>, vol. <volume>1</volume>, pp. <fpage>403</fpage>&#x2013;<lpage>408</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1-109/ICOIP.2010.253">https://doi.org/10.1-109/ICOIP.2010.253</ext-link></comment></mixed-citation></ref>
<ref id="CIT0048"><mixed-citation publication-type="conference"><person-group person-group-type="author"><string-name><surname>Yang</surname>, <given-names>C.L</given-names></string-name>., <string-name><surname>Chuang</surname>, <given-names>S.P</given-names></string-name>., <string-name><surname>Huang</surname>, <given-names>R.H</given-names></string-name>. &#x0026; <string-name><surname>Tai</surname>, <given-names>C.C</given-names></string-name></person-group>., <year>2008</year>, &#x2018;<article-title>Location selection based on AHP/ANP approach</article-title>&#x2019;, in <conf-name>IEEE International Conference on Industrial Engineering and Engineering Management, 2008. IEEM 2008</conf-name>, <conf-loc>Singapore</conf-loc>, <conf-date>December 08&#x2013;10, 2010</conf-date>. pp. <fpage>1148</fpage>&#x2013;<lpage>1153</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/IEEM.2008.4738050">https://doi.org/10.1109/IEEM.2008.4738050</ext-link></comment></mixed-citation></ref>
<ref id="CIT0049"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zavadskas</surname>, <given-names>E.K</given-names></string-name>., <string-name><surname>Kaklauskas</surname>, <given-names>A</given-names></string-name>., <string-name><surname>Turskis</surname>, <given-names>Z</given-names></string-name>. &#x0026; <string-name><surname>Tamo&#x0161;aitiene</surname>, <given-names>J</given-names></string-name></person-group>., <year>2008</year>, &#x2018;<article-title>Selection of the effective dwelling house walls by applying attributes values determined at intervals</article-title>&#x2019;, <source><italic>Journal of Civil Engineering and Management</italic></source> <volume>14</volume>(<issue>2</issue>), <fpage>85</fpage>&#x2013;<lpage>93</lpage>.</mixed-citation></ref>
<ref id="CIT0050"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>D.Z</given-names></string-name></person-group>., <year>2013</year>, &#x2018;<article-title>An integrated production and inventory model for a whole manufacturing supply chain involving reverse logistics with finite horizon period</article-title>&#x2019;, <source><italic>Omega</italic></source> <volume>41</volume>(<issue>3</issue>), <fpage>598</fpage>&#x2013;<lpage>620</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.omega.2012.07.001">https://doi.org/10.1016/j.omega.2012.07.001</ext-link></comment></mixed-citation></ref>
<ref id="CIT0051"><mixed-citation publication-type="conference"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>S.Z</given-names></string-name>. &#x0026; <string-name><surname>Lee</surname>, <given-names>C.K.M</given-names></string-name></person-group>., <year>2013</year>, &#x2018;<article-title>Optimization of facility location problem in reverse logistics network using Artificial Bee Colony algorithm</article-title>&#x2019;, in <conf-name>2013 IEEE International Conference on IEEE, Industrial Engineering and Engineering Management (IEEM)</conf-name>, <conf-loc>Bangkok, Thailand</conf-loc>, <conf-date>December 10&#x2013;13, 2013</conf-date>, pp. <fpage>1348</fpage>&#x2013;<lpage>1352</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/IEEM.2013.6962630">https://doi.org/10.1109/IEEM.2013.6962630</ext-link></comment></mixed-citation></ref>
<ref id="CIT0052"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhou</surname>, <given-names>X</given-names></string-name>. &#x0026; <string-name><surname>Zhou</surname>, <given-names>Y</given-names></string-name></person-group>., <year>2015</year>, &#x2018;<article-title>Designing a multi-echelon reverse logistics operation and network: A case study of office paper in Beijing</article-title>&#x2019;, <source><italic>Resources, Conservation and Recycling</italic></source> <volume>100</volume>, <fpage>58</fpage>&#x2013;<lpage>69</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.resconrec.2015.04.009">https://doi.org/10.1016/j.resconrec.2015.04.009</ext-link></comment></mixed-citation></ref>
<ref id="CIT0053"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zimmermann</surname>, <given-names>H.J</given-names></string-name></person-group>., <year>1978</year>, &#x2018;<article-title>Fuzzy programming and linear programming with several objective functions</article-title>&#x2019;, <source><italic>Fuzzy Sets and Systems</italic></source> <volume>1</volume>(<issue>1</issue>), <fpage>45</fpage>&#x2013;<lpage>55</lpage>. <comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1-016/0165-0114(78)90031-3">https://doi.org/10.1-016/0165-0114(78)90031-3</ext-link></comment></mixed-citation></ref>
</ref-list>
<app-group>
<app id="app001">
<title>Appendix 1</title>
<sec id="s0024">
<title></title>
<p>Consider the following multiple objective programming (MOP) problem (Steuer <xref ref-type="bibr" rid="CIT0041">1986</xref>:1):
<disp-formula id="FD35"><alternatives><mml:math display="block" id="M35"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mn>..</mml:mn><mml:msub><mml:mi>f</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>subject&#x2009;to&#x2009;x</mml:mtext><mml:mo>&#x2208;</mml:mo><mml:mtext>S</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow> <mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e035.tif"/></alternatives></disp-formula></p>
<p>Because of the incompatibility of the objectives, a unique feasible solution which optimises all the objectives of the above MOP problem simultaneously does not exist. Generally in real scenario, the DM compromises on choosing an efficient solution to the MOP problem, which is defined as follows:</p>
<p><bold>Definition 1:</bold> <italic>x</italic>&#x002A; &#x2208; <italic>S</italic> is said to be an efficient solution of MOP problem if there does not exist any <italic>x</italic> &#x2208; <italic>S</italic> such that <italic>f<sub>i</sub></italic>(<italic>x</italic>) &#x2265; <italic>f<sub>i</sub></italic>(<italic>x</italic><sup>&#x002A;</sup>) &#x2200;i = 1,2,&#x2026;<italic>k</italic> and <italic>f<sub>i</sub></italic>(<italic>x</italic>) &#x003E; <italic>f<sub>i</sub></italic>(<italic>x</italic><sup>&#x002A;</sup>) for some <italic>i</italic> &#x2208; {1,2,&#x2026;<italic>k</italic>}</p>
<p><bold>Definition 2:</bold> An efficient solution <italic>x</italic>&#x002A; &#x2208; <italic>S</italic> is said to be a properly efficient solution of MOP problem if there exists a scalar <italic>M</italic>&#x003E;0 such that, for each <italic>i</italic> and <italic>x</italic> &#x2208; <italic>S</italic>, <italic>f<sub>i</sub></italic>(<italic>x</italic>) &#x2212; <italic>f<sub>i</sub></italic>(<italic>x</italic><sup>&#x002A;</sup>) &#x2264; M(<italic>f<sub>r</sub></italic>(<italic>x</italic><sup>&#x002A;</sup>) &#x2013; <italic>f<sub>r</sub></italic>(<italic>x</italic>)) for some r with <italic>f<sub>r</sub></italic>(<italic>x</italic><sup>&#x002A;</sup>) &#x003E; <italic>f<sub>r</sub></italic>(<italic>x</italic>) and <italic>f<sub>i</sub></italic>(<italic>x</italic>) &#x003E; <italic>f<sub>i</sub></italic>(<italic>x</italic><sup>&#x002A;</sup>)</p>
<p>The efficient solution represents a compromised solution; however, a properly efficient solution represents a better compromised solution, which is definitely preferred by DMs for solving the MOP problem.</p>
<p>Geoffrion (<xref ref-type="bibr" rid="CIT0020">1967</xref>:2) proposed the following equivalent scalar problem (SP) for finding properly efficient solution of the MOP problem and proposed Lemma 1:
<disp-formula id="FD36"><alternatives><mml:math display="block" id="M36"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>subject&#x2009;to&#x2009;x</mml:mtext><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mo>,</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mo>&#x2200;</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="JTSCM-11-267-e036.tif"/></alternatives></disp-formula></p>
<p><bold>Lemma 1:</bold> An optimal solution <italic>x</italic>&#x002A; of (SP) is a properly efficient solution of (MOP) problem.</p>
</sec>
</app>
</app-group>
<fn-group>
<fn><p><bold>How to cite this article:</bold> Darbari, J.D., Agarwal, V., Yadavalli, V.S.S., Galar, D. &#x0026; Jha, P.C., 2017, &#x2018;A multi-objective fuzzy mathematical approach for sustainable reverse supply chain configuration&#x2019;, <italic>Journal of Transport and Supply Chain Management</italic> 11(0), a267. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4102/jtscm.v11i0.267">https://doi.org/10.4102/jtscm.v11i0.267</ext-link></p></fn>
</fn-group>
</back>
</article>