Keywords

FormalPara Abbreviations

The accompanying abbreviations are utilized in this chapter.

DM:

Decision-maker,

FP:

Fuzzy programming,

GCM:

Global criterion method,

SD:

Sustainable development,

STP:

Solid transportation problem,

IFP:

Intuitionistic fuzzy programming,

MOSTP:

Multi-objective solid transportation problem,

MOGSTP:

Multi-objective green solid transportation problem.

1 Introduction and Prior-Related Research

Nowadays, controlling carbon emissions is one of the most attractive and critical issues throughout the world. Figure 1 illustrates the carbon emanations information for various sectors of the world. From Fig. 1, it can be concluded that the carbon emissions have been essentially increased due to logistics network.

Fig. 1
figure 1

Distribution of carbon emissions by industry sectors worldwide in 2019

Poterba (1991), Chen and Wang (2016) discussed that the increase in carbon outflows is the main reason behind the global warming effect. Thus, governments around the globe have endorsed various policies in which the carbon tax policy (cf. Zhou et al. 2011; Benjaafar et al. 2012; Chen et al. 2013; Konur and Schaefer 2014) is implemented in effective measure to control the global warming effect. As per the carbon charge strategy, the carbon release holders need to pay the carbon charge for every fossil fuel byproduct unit to the policymaker. In the literature, few authors have considered this policy for instance Elhedhli and Merrick (2012), and Turken et al. (2017). This inspired us to formulate green logistics modelling to meet our present needs without polluting the atmosphere. For that reason, the concept of sustainable development (SD) (Lélé 1991; Litman and Burwell 2006) has attracted the scientists as a field of research. According to the ‘World Commission on Environment and Development’, SD is defined as ‘the concept of meeting the needs of the present without compromising future generations’ ability to meet their needs’. In fact, the financial, social, and environmental aspects are considered simultaneously in SD. Nomani et al. (2017b) proposed a multi-objective model to investigate the SD goals of India. Gupta et al. (2018) presented a sustainable logistics model for the mining sector and then they solved it by an integrated multi-objective solution procedure. Maity et al. (2019b) introduced a sustainable environment in a multi-objective logistics network under the time window.

In last few decades, logistics modelling plays a vital role towards globalization. Solid transportation problem (STP) is a part of logistics network design. Substantially, STP, an augmentation of the classical transportation model is mainly described by source, demand, and conveyance set of constraints. The main concept of STP is to disseminate homogeneous products from specific sources to a few destinations via different kind of conveyances (e.g., hydrogen vehicle, diesel vehicle, CNG vehicle, bio-diesel vehicle) with the object that the total cost of the conveyance will be diminished. It was first enlightened by Shell (1955), however, the solution procedure was given by Haley (1962). Afterwards, Jiménez and Verdegay (1998) introduced the idea of fuzziness into an STP. They (Jiménez and Verdegay 1999) introduced a parametric approach to solve a fuzzy STP. It is often difficult to handle the real-world problems by a single objective STP. Due to this fact, several authors introduced multi-objective environment on STP, known as multi-objective solid transportation problem (MOSTP) from their different points of view. Tao and Xu (2012) presented the concept rough programming into an MOSTP. Liu et al. (2014) studied an STP in which the parameters were taken as type-2 fuzzy variables. Molla-Alizadeh-Zavardehi et al. (2013) described three metaheuristic algorithms for solving an MOSTP. Nomani et al. (2017a) discussed a new solution procedure to solve a multi-objective logistics modelling. Chen et al. (2017) analyzed an uncertain goal programming for solving a bicriteria STP. Mehlawat et al. (2019) incorporated a data envelopment analysis (DEA) concept in an STP under sustainable environment. Roy and Midya (2019) studied an MOSTP with product blending under uncertain environment. Biswas et al. (2019) employed a novel NSGA-II algorithm for solving an MOSTP in crisp and interval environments. Roy et al. (2019) discussed the idea of several items into an STP under a hybrid environment.

An exhaustive comparison on different features among the current research and prior associated studies in logistics network is depicted in Table 1. The comparative study delineates the gaps in previous researches and motivation for this investigation.

Table 1 A summary of relevant researches on MOSTP

To resolve all these issues, in this study, we develop a mathematical model, referred as multi-objective green solid transportation problem (MOGSTP). To tackle several realistic and practical attributes of the research gaps, three conflicting objectives, transportation modes, vehicles efficiency, carbon emissions reduction policy, and sustainable development are simultaneously considered in the proposed problem. The summary of this chapter is listed as follows:

  • This is the first study to investigate a transportation model to impact the carbon emissions reduction policy under sustainable environment.

  • The model gives the decisions regarding the product flow from sources to destinations via sustainable transportation modes.

  • The total conveyances cost with maintaining, fixed-charge cost and carbon emissions cost, delivery time, including loading and unloading time, and vehicle efficiency are also studied.

  • A solution procedure on multi-objective optimization is described to receive an optimal solution of MOGSTP.

  • A comparative study among the proposed procedure and the other existing relevant procedures is investigated to obtain the best Pareto-optimal solution.

  • The impact of carbon tax policy in MOGSTP under sustainable environment is also discussed.

This chapter is sorted out as follows: Sect. 2 addresses the problem identification and mathematical model for MOGSTP. The methodology to solve the above model is discussed in Sect. 3. Then, Sect. 4 illustrates the efficiency of the stated problem and procedure with two real-world examples. Section 5 provides the outcomes of the application examples with the impact of carbon tax policy and a comparison with other relevant solution procedures. Finally, concluding remarks are given with future directions of this study in Sect. 6.

2 Mathematical Formulation

Here, initially, we define the proposed problem and its assumptions to formulate the mathematical model. Thereafter, we discuss index sets, decision variables, and parameters. At last, the three objective functions and constraints are described.

2.1 Model Background

The proposed study deals with a multi-objective problem to formulate a sustainable solid logistics network considering carbon emissions. The important objectives are: (O1) to lessen the total shipping cost and time, and to maximize sustainable vehicles efficiency under an emission control policy, and (O2) to seek the optimal amount of transported goods simultaneously. In addition, apart from that, the following factors are described in the model: (I) weights of the vehicles dependent on economical, environmental, and social features; (II) fixed-charge costs such as setup costs underway frameworks, toll charges on an expressway and so on; (III) servicing costs of the conveyances; (IV) loading and unloading time for the transported products, which give more accuracy of the logistic time; (V) follow the carbon tax policy for reducing carbon emissions. This study’s main focus is to design a green transportation model by considering outrageous climate occasions for reducing carbon emissions under a sustainable environment. The considered green logistics network as depicted in Fig. 2, is comprised of sources (\({S}_{1}\), \({S}_{2}\), and \({S}_{3}\)), destinations (\({D}_{1}\), \({D}_{2}\), \({D}_{3}\) and \({D}_{4}\)) and conveyances (\({T}_{1}\), \({T}_{2}\), \({T}_{3}\) and \({T}_{4}\)). Moreover, the dotted lines are designated as the product flow from sources to destinations through conveyances under a sustainable environment.

Fig. 2
figure 2

Pictorial representation of a green solid logistics network

2.2 Nomenclature

The nomenclatures are listed below to construct our model:

Indices

\(i\) :

Index of sources \((i=1,2,\dots ,m)\);

\(j\) :

Index of destinations \((j=1,2,\dots ,n)\);

\(k\) :

Index of transportation modes \((k=1,2,\dots ,p)\).

Sets

X :

\(\{({x}_{ijk})\text{: subject to the constraints}\, \forall i,j,k\}\): the feasible space;

F :

\(\{({x}_{ijk}^{B}){:}\,\forall i,j,k\}\): the optimal feasible set.

Decision variable

\({x}_{ijk}\) :

Quantity to be sent from \({i}\text{th}\) source to \({j}\text{th}\) destination by \({k}\text{th}\) vehicles.

Parameters

\({a}_{i}\) :

Availability of \({i}\text{th}\) source;

\({b}_{j}\) :

Demand at \({j}\text{th}\) destination;

\({c}_{k}\) :

Capacity of \({k}\text{th}\) transportation mode;

\({e}_{ijk}\) :

Unit cost for transporting unit item per unit distance from the \({i}\text{th}\) source to the \({j}\text{th}\) destination by \({k}\text{th}\) vehicle;

\({t}_{ijk}\) :

Transport time for \({k}\text{th}\) vehicle per unit distance from \({i}\text{th}\) source to \({j}\text{th}\) destination;

\({l}_{i}\) :

Loading time of unit item at \({i}\text{th}\) source;

\({l}_{j}^{{\prime}}\) :

Unloading time of unit quantity at \({j}\text{th}\) destination;

\({M}_{k}\) :

Servicing cost of \({k}\text{th}\) conveyance;

\({f}_{ijk}\) :

Fixed-charge to distribute products from \({i}\text{th}\)\({j}\text{th}\) route by \({k}\text{th}\) transportation mode;

\({h}_{k}\) :

Unit CO2 mitigation by \({k}\text{th}\) vehicle;

\({P}_{c}\) :

Carbon tax revenue for each unit of mitigation;

\({\alpha }_{k}\) :

Effectiveness of \({k}\text{th}\) conveyance in economical aspects;

\({\beta }_{k}\) :

Effectiveness of \({k}\text{th}\) conveyance in environmental evaluation;

\({\gamma }_{k}\) :

Effectiveness of \({k}\text{th}\) conveyance in social features;

\({w}_{1}\) :

Weight for economical aspects;

\({w}_{2}\) :

Weight for environmental evaluation;

\({w}_{3}\) :

Weight for social features.

2.3 Assumption

There are the following assumptions:

  • The dispersed product is the homogeneous kind. The idea of transportation modes is heterogeneous. Transportation cost is straightforwardly relative to the unit of delivered products.

  • The time is likely to be proportional to the distance that is not dependent on the unit distributed item. CO2 mitigation is reliant on the distance gone by the movements, fuel consumption, and transported goods.

2.4 Mathematical Model

This section provides a mathematical formulation in the light of solid logistics modelling, carbon tax policy, and sustainable environment. The mathematical model of MOGSTP is addressed as follows:

Model 1

$$\begin{aligned}\mathrm{minimize}\,{ Z}_{1(x)}& =\sum_{i=1}^{m}\sum_{j=1}^{n}\sum_{k=1}^{p}[{e}_{ijk}{x}_{ijk}+{M}_{k}{d}_{ij}{y}_{ijk}+{f}_{ijk}{y}_{ijk}]\\ & \quad +{P}_{c}\sum_{i=1}^{m}\sum_{j=1}^{n}\sum_{k=1}^{p}{h}_{k}{d}_{ij}{x}_{ijk}\end{aligned}$$
(1)
$$\mathrm{minimize }\,{ Z}_{2(x)}=\sum_{i=1}^{m}\sum_{j=1}^{n}\sum_{k=1}^{p}[{t}_{ijk}{y}_{ijk}+\left({l}_{i}+{l}_{j}^{{\prime}}\right){x}_{ijk}]$$
(2)
$$\mathrm{maximize }\,{Z}_{3(x)}=\sum_{i=1}^{m}\sum_{j=1}^{n}\sum_{k=1}^{p}({w}_{1}{\alpha }_{k}+{w}_{2}{\beta }_{k}+{w}_{3}{\gamma }_{k}){x}_{ijk}$$
(3)
$$\text{subject to }\sum_{j=1}^{n}\sum_{k=1}^{p}{x}_{ijk}\le {a}_{i}, \quad i=1,2,\dots ,m,$$
(4)
$$\sum_{i=1}^{m}\sum_{k=1}^{p}{x}_{ijk}\ge {b}_{j}, \quad j=1,2,\dots ,n,$$
(5)
$$\sum_{i=1}^{m}\sum_{j=1}^{n}{x}_{ijk}\le {c}_{k}, \quad k=1,2,\dots ,p,$$
(6)
$${y}_{ijk}=\left\{\begin{array}{ll}1,& \text{if}\, {x}_{ijk}>0,\\ 0,& \text{otherwise}.\end{array}\right.$$
(7)
$$\sum_{i=1}^{m}{a}_{i}\ge \sum_{j=1}^{n}{b}_{j}\, \text{and}\, \sum_{k=1}^{p}{c}_{k}\ge \sum_{j=1}^{n}{b}_{j},$$
(8)
$${x}_{ijk}\ge 0, \quad i=1,2,\dots ,m; \quad j=1,2,\dots ,n; \quad k=1,2,\dots ,p.$$
(9)

The objective function (1) intends to minimize the total shipping cost along with CO2 mitigation cost. Terms 1–4 of (1) address the all out transportation cost, servicing cost, fixed-charge cost, and CO2 mitigation cost separately. The objective function (2) is identified with clients’ fulfilment, which expectations to diminish the total shipping time, loading and unloading time from \({i}\text{th}\) source to \({j}\text{th}\) destination via \({k}\text{th}\) conveyance. The objective function (3) is connected with economical, environmental, and social aspects, which indicates choosing conveyances depending on their sustainable effectiveness. Limitation (4) implements that each source’s by and the large disseminated amount should be less or equivalent to its ability. Imperative (5) forces that the in generally delivered units of every objective satisfy the interest. Imperative (6) shows that every transportation mode’s generally speaking shipped streams can’t outperform its capacity. Constraint (7) represents the relationship between continuous and binary variables. Requirements (8) allude to the practical basis of the issue. Eventually, requirement (9) is the non-antagonism conditions.

Definition 1

An ideal solution of the proposed model is the one that optimizes each of the objective independently, i.e., \({Z}_{q}({x}^{*})=\min_{(x)\in F}{Z}_{q}(x)\), \(q=1,2\) and \({Z}_{3}\left({x}^{*}\right)=\max_{(x)\in F}{Z}_{3}(x)\).

Definition 2

A solution \({x}^{A}\in F\) of Model 1 is called an anti-ideal if it satisfies the condition \({Z}_{q}({x}^{A})=\max_{(x)\in F}{Z}_{q}(x)\), \(q=1,2\) and \({Z}_{3}({x}^{A})=\min_{(x)\in F}{Z}_{3}(x)\).

Definition 3

A solution \({x}^{P}\in F\) is a Pareto-optimal solution of Model 1 if there does not exist any other solution \(x\in F\) such that \({Z}_{q}(x)\le {Z}_{q}({x}^{P})\) for \(1\le q\le 2\) and \({Z}_{3}(x)\ge {Z}_{3}({x}^{P})\) with at least one inequality holding as strict inequality.

3 Solution Procedure

In a multi-objective optimization problem, the decision-maker (DM) has to minimize/maximize the non-commensurable nature of objective functions all at once. Due to this fact, no single optimum outcome exists that simultaneously optimizes all the objective functions. For that reason, the idea of a Pareto frontis introduced instead of an ideal outcome. Here, we introduce a multi-objective solution procedure, explicitly, a global criterion method (GCM) (Shih and Chang 1995) to solve Model 1. An algorithm flowchart is depicted in Fig. 3.

Fig. 3
figure 3

Algorithm flowchart of the proposed problem

3.1 GCM

GCM uses the possibility of the briefest path from the ideal front to discover a Pareto front; the stated methodology does not need any earlier data (objectives and loads) on target capacities from the DM. Indeed, GCM yields a rudimentary numerical construction that makes it more obvious and utilize. Further, the proposed procedure furnishes a Pareto ideal outcome with less computational time and memory concerning different methodology. The following steps can derive the Pareto-optimal solution of Model 1:

Step 1: Initially, three single green solid transportation problems are solved independently by considering one at a time.

Step 2: Then, the ideal \(({Z}_{1}^{\text{min}},{Z}_{2}^{\text{min}},{Z}_{3}^{\text{max}})\) and anti-ideal \(({Z}_{1}^{\text{max}},{Z}_{2}^{\text{max}},{Z}_{3}^{\text{min}})\) solutions are calculated employing the results of Step 1.

Step 3: The simplified formulation of Model 1 can be addressed as stated below:

Model 2

$$\begin{aligned}& \text{minimize}\,{\left[\sum_{q=1}^{2}{\left(\frac{{Z}_{q}(x)-{Z}_{q}^{\text{min}}}{{Z}_{q}^{\text{max}}-{Z}_{q}^{\text{min}}}\right)}^{2}+{\left(\frac{{Z}_{3}(x)-{Z}_{3}^{\text{max}}}{{Z}_{3}^{\text{max}}-{Z}_{3}^{\text{min}}}\right)}^{2}\right]}^\frac{1}{2}\\&\text{subject to the constraints (4) to (9)}.\end{aligned}$$

Proposition 1

Assuming \({x}^{P}\) is an optimal outcome of Model 1, then it will be a Pareto front \({x}^{P}\) of Model 2.

Proof

This proposition can be proved by contradiction. Let us assume that \({x}^{P}\) is an optimal outcome of Model 1 that is not a Pareto-optimal outcome of Model 2. Subsequently, there exists a solution \({x}^{{\prime}}\) such that \(({x}^{{\prime}})\) dominates \({x}^{P}\). This implies:

$$\begin{aligned}& {\left[\sum_{q=1}^{2}{\left(\frac{{Z}_{q}({x}^{\prime})-{Z}_{q}^{\text{min}}}{{Z}_{q}^{\text{max}}-{Z}_{q}^{\text{min}}}\right)}^{2}+{\left(\frac{{Z}_{3}({x}^{{\prime}})-{Z}_{3}^{\text{max}}}{{Z}_{3}^{\text{max}}-{Z}_{3}^{\text{min}}}\right)}^{2}\right]}^\frac{1}{2}\\ & <{\left[\sum_{q=1}^{2}{\left(\frac{{Z}_{q}({x}^{P})-{Z}_{q}^{\text{min}}}{{Z}_{q}^{\text{max}}-{Z}_{q}^{\text{min}}}\right)}^{2}+{\left(\frac{{Z}_{3}({x}^{P})-{Z}_{3}^{\text{max}}}{{Z}_{3}^{\text{max}}-{Z}_{3}^{\text{min}}}\right)}^{2}\right]}^\frac{1}{2},\end{aligned}$$

which directly contradicts to the fact that \({x}^{P}\) is an optimal solution of Model 2. That completes the proof.

4 Numerical Experiment

In this section, two application examples are illustrated to validate the formulated problem and methodology numerically.

Example 1

A company has four \((m=4)\) source plants, labelled as \({S}_{1}\), \({S}_{2}\), \({S}_{3}\) and \({S}_{4}\), and three \((n=3)\) distribution centres like \({D}_{1}\), \({D}_{2}\) and \({D}_{3}\), respectively. Goods are distributed by two \((p=2)\) transportation modes from source plants to distribution centres. Due to environmental concerns and carbon tax policy, the company chooses two sustainable conveyances: hydrogen fuel-based vehicle \(({k}_{1})\) and bio-diesel based vehicle \(({k}_{2})\). The company’s goal is to reduce the total logistics cost and carbon emissions cost, conveyance time, and increase the effectiveness of sustainable vehicles. The distances between sources and destinations are given in Table 2 with their corresponding supplies and demands. The unit logistics cost (INR), delivery time (minutes), and fixed-charge cost (INR) parameters are displayed in Table 3.

Table 2 Distances \(({d}_{ij})\) (KM) of sources-destinations with supply and demand (KG)
Table 3 Transportation cost for unit quantity, conveyance time, and fixed-charge cost (\({e}_{ijk},{t}_{ijk},{f}_{ijk}\))

The other inputs are as follows:

Capacities of conveyances (KG) \({c}_{1}=1060\), \({c}_{2}=1210\); Loading time (minutes) \({l}_{1}=90\), \({l}_{2}=120\), \({l}_{3}=60\), \({l}_{4}=80\); Carbon emissions tax (INR/KG) \({P}_{c}=0.4\); Unloading time (minutes) \({l}_{1}^{{\prime}}=60\), \({l}_{2}^{{\prime}}=40\), \({l}_{3}^{{\prime}}=30\); Carbon emissions rate (KG/L) \({h}_{1}=0.3\), \({h}_{2}=0.5\); Weights of the sustainability aspects \({w}_{1}=0.3\), \({w}_{2}=0.5\), \({w}_{3}=0.2\); Maintenance cost (INR) \({M}_{1}=0.3\), \({M}_{2}=0.5\); Effectiveness of conveyances \({\alpha }_{1}=0.9\), \({\alpha }_{2}=0.75\), \({\beta }_{1}=0.85\), \({\beta }_{2}=0.7\), \({\gamma }_{1}=0.6\), \({\gamma }_{2}=0.85\).

Example 2

We consider the fossil fuel byproducts charge \({P}_{c}=0\), and the others continue as before as in Example 1.

5 Experimental Result and Exploration

The optimal solutions of the proposed problem are extracted from the GCM. The GCM is carried out employing LINGO 18.0.56 software on an Intel Core i5 processor with 8 GB RAM under Mac OS environment. The ‘most preferred’ Pareto fronts of both the applications are listed in Tables 4 and 5. The analytical outcomes reveal that the economic, clients’ fulfilment, and sustainable objectives are optimized. When the carbon emissions cost is added along with the total logistics cost, then firms’ profit will be reduced. Because of this reality, the organization will consistently be worried about fossil fuel byproducts because of the dispersion of merchandise. The company will always select the sustainable conveyances which emit less \(\text{CO}_{2}\). In this regard, the third objective function plays a vital role in choosing conveyances which increases the sustainable efficiency score.

Table 4 The Pareto ideal outcome of Example 1
Table 5 The Pareto-ideal outcome of Example 2

Along these lines, the expressed detailing can handle financial advancement without inconvenience to ecological and natural assets. Thereafter, the carbon tax policy helps the company choose ‘most preferred’ choices for enhancing their economic and sustainable development and upholds the policymaker for lessening fossil fuel byproducts. The impact of carbon tax policy is illustrated in Fig. 4.

Fig. 4
figure 4

Effect of carbon tax policy in MOGSTP

5.1 Comparative Study

In this subsection, the aforementioned examples are also resolved with existing relevant two solution procedures, namely: (i) Fuzzy programming (FP) and (ii) Intuitionistic fuzzy programming (IFP). The obtained outcomes are compared so that the DM has a choice to get the best Pareto-optimal solutions. Table 6 shows that the obtained outcomes by the proposed GCM are better compared with the FP and IFP in terms of sustained accuracy and lower computational complexity, displayed in Figs. 5 and 6.

Table 6 Outcomes comparison
Fig. 5
figure 5

Comparison optimum value of \({Z}_{1}\) by three procedures

Fuzzy programming (FP)

After employing FP (Zimmermann 1978; Inuiguchi et al. 1990; Li and Lai 2000), the simplified fuzzy model of Model 1 can be stated as below:

Model 3

$$\begin{aligned}& \text{maximize }\,\lambda\\&\text{subject to}\,{ Z}_{q}\left(x,\right)+\lambda \left({U}_{q}-{L}_{q}\right)\le {U}_{q}, q=1,2,3,\\&\text{the constraints (4) to (9)},\\ &\lambda \ge 0.\end{aligned}$$

Here, \(\lambda \) is the degree of fulfilment of anoutcome.

Intuitionistic fuzzy programming (IFP)

After employing IFP (Angelov 1997; Roy et al. 2018a; Roy and Midya 2019), the intuitionistic optimization model for Model 1 can be expressed as follows:

Model 4

$$\begin{aligned}&\text{maximize }\,\theta -\mu \\&\text{subject to}\,{ Z}_{q}\left(x,\right)+\theta \left({U}_{q}-{L}_{q}\right)\le {U}_{q}, q=1,2,3,\\&{Z}_{q}\left(x,\right)-\mu \left({U}_{q}-{L}_{q}\right)\le {L}_{q}, q=1,2,3,\\&\text{the constraints (4) to (9)},\\& \theta \ge \mu ,\theta +\mu \le 1,\theta ,\mu \in [{0,1}].\end{aligned}$$

Here, \(\theta \) and \(\mu \) indicate the grade of fulfilment and disappointment of anoutcome.

Fig. 6
figure 6

Comparison lower computational complexity of three approaches

6 Concluding Remark and Outlook

In this chapter, a green solid logistics modelling has been addressed by thinking about the affordable, clients’ fulfilment, and ecological goals under sustainable development. To help the choices, the stated model has been detailed with the aforementioned three non-commensurable objectives under a fossil fuel byproducts decrease strategy. In addition, the unknown quantities of distributed products by various conveyances have been found simultaneously. Several factors like unit logistics cost, fixed-charge cost, carbon emissions cost, maintenance cost, three types of sustainable parameters, loading, and unloading time have been taken into account in this study. GCM has been utilized for optimizing the above objectives in a successful way. Afterwards, two applications have been presented to delineate the proposed problem and GCM. Further, the outcomes have been derived from GCM that is compared with the obtained solutions by FP and IFP. Among the three solution procedures, better Pareto-optimal outcomes have been received from the proposed GCM in terms of sustained accuracy and lower computational complexity. Ultimately, choices in regards to decreasing carbon emanations because of transportation frameworks have been examined, as well. It has been concluded that our formulation can proceed with the economic progress without detriment to ecological and regular assets.

There are a few interesting topics for future research works of this study by considering different kinds of environments such as grey systems (Roy et al. 2017a), robust environment (Goli et al. 2019; Khalilpourazari et al. 2019), stochastic (Mahapatra et al. 2013), neutrosophic set (Das and Roy 2019), dual-hesitant fuzzy (Maity et al. 2019a), interval valued (Roy and Maity 2017), multi-choice type (Roy et al. 2017b), location problem (Das et al. 2020a, b, c, 2021), rough sets (Roy et al. 2018b), type-2 fuzzy set (Roy and Bhaumik 2018; Roy and Maiti 2020), and biofuel supply chain (Paksoy et al. 2013). Further, the several nature inspired optimization algorithms and stochastic methods can be employed to solve the proposed model.