\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

The processing facility location-allocation problem for tunnel slag during tunnel construction

  • *Corresponding author: Guohua Zhou

    *Corresponding author: Guohua Zhou 

The first author is supported by Natural Science Foundation of China (No. 71942006) and China State Railway Group Co., Ltd (Project No. N2020G039).

Abstract / Introduction Full Text(HTML) Figure(8) / Table(12) Related Papers Cited by
  • In this paper, we consider the process of resource utilization of tunnel slag, and propose a "regional self-balanced" reverse logistics network. We propose a location-allocation model that takes the uncertainty of availability, various types of output, various types of demand, and various types of facilities into account when solving the location-allocation problem for facilities in the network. According to our research, we obtain a feasible model and algorithm for use in the engineering field, and we find that the logistics cost can be decreased by appropriately increasing the number of facilities and choosing the locations of facilities based on scientific principles, thereby lowering the total cost. We determined the parameters of the algorithm by Taguchi's analysis and verified the effectiveness of the algorithm by comparing it with the exact algorithm and other heuristic algorithms. By analyzing the impact of the availability of tunnel slag on the site selection of facilities, we obtain policy recommendations on the number of facilities.

    Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
  • Figure 1.  Comparison of utilization methods of "recycling type" and "regional self-balancing type"

    Figure 2.  "Regional self-balancing" reverse logistics network for tunnel slag utilization

    Figure 3.  Schematic diagram of the simple model of beetle

    Figure 4.  Algorithm flowchart

    Figure 5.  Chromosome coding diagram

    Figure 6.  Algorithm convergence graph

    Figure 7.  Distribution map of tunnel slag utilization in the second construction unit

    Figure 8.  Confidence level change analysi

    Table 1.  Classification of reverse logistics network

    Types of reverse logistics networks Characteristic Applicable industries
    Repair type This applies to a single type of item that has been repaired and returned to the forward supply chain or into a remanufacturing process. Refrigerator repair, etc.
    Reuse type This applies to a single type of item that is returned to the forward supply chain after a simple cleaning, disinfection, etc. Plastic bottles, etc.
    Remanufacture type This applies to a single type of item that is remanufactured in whole or in part. Telephone, mobile phone, etc.
    Recycling type It is suitable for a single type of item, and the processing time of this item is long, and the item at the output point cannot directly supply the demand at the demand point. The output point and the demand point have an intersecting relationship. Construction waste, waste paper, etc.
    Regional self-balancing type It is suitable for a multi-type item. The processing time of the item is short, which can meet the needs of the demand point, and the output point and the demand point have an inclusive relationship. Tunnel slag
     | Show Table
    DownLoad: CSV

    Table 2.  Taguchi design analysis – GA

    $ popsize $ $ p_c $ $ p_m $ Run1 Run2 Run3 Run4 Run5 $ S/N $
    60 0.06 0.6 4319 4506 4465 4218 4506 -72.88
    60 0.08 0.7 4465 4319 4218 4319 4506 -72.80
    60 0.1 0.8 4218 4203 4506 4319 4465 -72.76
    60 0.12 0.9 4218 4465 4177 4203 4319 -72.62
    80 0.06 0.7 4177 4319 4218 4177 4465 -72.61
    80 0.08 0.6 3993 4177 4319 4042 3964 -72.26
    80 0.1 0.9 3964 3993 4042 3964 4042 -72.04
    80 0.12 0.8 4042 4203 4177 3993 4177 -72.30
    100 0.06 0.8 4319 4177 4218 4306 4203 -72.56
    100 0.08 0.9 3993 4042 4203 4177 3964 -72.21
    100 0.1 0.6 4465 4319 4306 4203 4306 -72.71
    100 0.12 0.7 3993 4218 4203 4465 4203 -72.50
    120 0.06 0.9 4177 3993 4042 3964 4218 -72.21
    120 0.08 0.8 4203 4177 4203 3993 4042 -72.31
    120 0.1 0.7 4203 4218 4218 4306 4042 -72.46
    120 0.12 0.6 4506 4042 4319 4177 4319 -72.62
     | Show Table
    DownLoad: CSV

    Table 3.  Taguchi design analysis-BAS

    $ k $ $ \delta $ $ d $ Run1 Run2 Run3 Run4 Run5 $ S/N $
    10 1300 1300 4734 4465 4678 4203 4902 -73.26
    10 1500 1700 4465 4734 4306 4465 4902 -73.22
    10 1700 1500 4678 4319 4899 4465 4734 -73.30
    20 1300 1700 4306 4203 4902 4899 4319 -73.13
    20 1500 1500 4203 4306 4319 4306 4465 -72.71
    20 1700 1300 4902 4899 4734 4465 4319 -73.39
    30 1300 1500 4734 4465 4899 4203 4203 -73.08
    30 1500 1300 4899 4203 4465 4734 4899 -73.35
    30 1700 1700 4734 4902 4678 4678 4465 -73.43
     | Show Table
    DownLoad: CSV

    Table 4.  Taguchi design analysis - BAS-IGA

    $ elite ratio $ $ N_c $ $ \zeta $ Run1 Run2 Run3 Run4 Run5 $ S/N $
    0.1 20 2 3458 3458 3461 3458 3461 -70.78
    0.1 40 4 3570 3660 3660 3697 3746 -71.29
    0.1 60 6 3684 3993 3589 3922 3570 -71.49
    0.1 80 8 3660 3964 4042 3627 3964 -71.72
    0.2 20 4 3589 3589 3746 3689 3697 -71.28
    0.2 40 2 3660 3746 3697 3993 3697 -71.50
    0.2 60 8 3993 3964 4042 3684 3993 -71.90
    0.2 80 6 3697 3993 4177 3922 3964 -71.94
    0.3 20 6 4042 3922 3964 3964 3993 -71.99
    0.3 40 8 3697 3964 3993 3689 3689 -71.62
    0.3 60 2 3922 3689 4042 3746 3660 -71.63
    0.3 80 4 3993 3697 4177 3964 3922 -71.94
    0.4 20 8 3964 4177 3964 3993 4042 -72.10
    0.4 40 6 3922 3964 3746 4042 3993 -71.90
    0.4 60 4 3922 4177 3697 3964 3922 -71.91
    0.4 80 2 3746 3922 3993 3697 4177 -71.85
    0.1 20 2 3458 3458 3461 3458 3461 -70.78
    0.1 40 4 3570 3660 3660 3697 3746 -71.29
     | Show Table
    DownLoad: CSV

    Table 5.  Algorithm parameter value

    Algorithm Parameter
    BAS-IGA $ T_{Maxgen}=100 $, $ popsize=80 $, $ p_c=0.9 $, $ p_m=0.1 $, $N_c=20$, $\zeta=2$, $k=20$, $\delta=1500$, $d=1500$
    BAS-GA $T_{Maxgen}=100$, $popsize=80$, $p_c=0.9$, $p_m=0.1$
    IGA $ T_{Maxgen}=100 $, $ popsize=80 $, $ p_c=0.9 $, $ p_m=0.1 $, $ \zeta=2 $, $ N_c=20 $
    GA $ T_{Maxgen}=100 $, $ popsize=80 $, $ p_c=0.9 $, $ p_m=0.1 $
     | Show Table
    DownLoad: CSV

    Table 6.  Algorithm performance comparison

    Scale Num Gurobi BAS-IGA BAS-GA IGA GA GAP1(%) GAP2(%) GAP3(%) GAP4(%)
    OV CT OV CT OV CT OV CT OV CT
    Scale 1 1 976 0.1 976 0.5 976 0.4 976 0.43 976 0.4 0 0 0 0
    2 979 0.1 979 0.5 979 0.4 979 0.43 979 0.4 0 0 0 0
    3 974 0.1 974 0.5 974 0.4 974 0.43 974 0.4 0 0 0 0
    4 978 0.1 978 0.5 978 0.4 978 0.43 978 0.4 0 0 0 0
    5 976 0.1 976 0.5 976 0.4 976 0.43 976 0.4 0 0 0 0
    Scale 2 1 1222 0.5 1222 1.3 1225 1 1222 1 1222 0.8 0 0.2 0 0
    2 1217 0.4 1217 1.1 1220 0.8 1217 0.8 1217 0.7 0 0.2 0 0
    3 1226 0.4 1226 1.3 1229 0.8 1226 1 1226 0.8 0 0.2 0 0
    4 1279 0.5 1279 1.3 1282 0.9 1279 0.9 1279 0.8 0 0.2 0 0
    5 1227 0.4 1227 1.2 1230 0.8 1227 0.9 1227 0.8 0 0.2 0 0
    Scale 3 1 1462 5.6 1462 7.9 1469 6.8 1462 8.6 1465 7.9 0 0.5 0 0.2
    2 1481 5.6 1481 8.2 1489 6.7 1481 8.4 1484 8 0 0.5 0 0.2
    3 1449 5.3 1449 7.7 1455 6.9 1449 8.2 1454 8 0 0.4 0 0.3
    4 1459 5.3 1459 7.9 1467 6.8 1459 8.4 1463 8.3 0 0.5 0 0.3
    5 1476 5.6 1476 8 1482 6.8 1476 8.4 1480 8 0 0.4 0 0.3
    Scale 4 1 2691 1265 2699 115 2711 101 2814 115.7 2850 112.3 0.3 0.7 4.6 5.9
    2 2699 1266 2705 116.1 2719 105.1 2827 116.8 2870 113 0.2 0.7 4.7 6.3
    3 2692 1265 2701 114.2 2712 102.9 2823 117.1 2830 112.9 0.3 0.7 4.9 5.1
    4 2680 1263 2684 115.2 2699 102.1 2798 116 2812 111.3 0.1 0.7 4.4 4.9
    5 2671 1261 2679 114.2 2695 102.1 2781 116.8 2809 111.3 0.3 0.9 4.1 5.2
    Scale 5 1 3859* > 3600 3855 675.7 3966 457 4149 688.4 4222 624.9 -0.1 2.8 7.5 9.4
    2 3876* > 3600 3864 676.1 3973 456.9 4154 689.1 4231 632.1 -0.3 2.5 7.2 9.2
    3 3856* > 3600 3851 675.7 3961 456.9 4137 688.4 4217 625.9 -0.1 2.7 7.3 9.4
    4 3827* > 3600 3820 674 3942 454.2 4103 687.6 4183 625 -0.2 3.0 7.2 9.3
    5 3852* > 3600 3841 675.7 3959 456.9 4125 688.4 4198 624.9 -0.3 2.8 7.1 9.0
    T test -3.095711629 -3.512948236 -3.504924076
    P value 0.002469032 0.000892134 0.000910028
     | Show Table
    DownLoad: CSV

    Table 7.  Scheme cost comparison table

    Cost name Scheme
    Scheme 1 ($\times 10^4$ RMB) Scheme 2 ($\times 10^4$ RMB) Scheme 3 ($\times 10^4$ RMB)
    Construction cost 960 1260 1470.2
    Transportation cost \ 1038.8 305.7
    Processing cost 4440.99 (Including shipping and miscellaneous charges) 1591.2 1591.2
    Environmental cost 2468 0 0
    Total cost 7868 3890 3367.1
     | Show Table
    DownLoad: CSV

    Table 8.  Scheme comparison table

    Name Scheme
    Scheme 1 Scheme 2 Scheme 3
    Type 1 processing plant Mileage \ DK429+210 DK406+956.5, DK413+463, DK431+713.4
    Land size \ \ 4500m2, 4500 m2, 10367m2
    Type 1 mixing plant Mileage DK409+105, DK422+250, DK425+600, DK434+526 DK409+105, DK422+250, DK425+600, DK434+526 DK406+956.5, DK412+836, DK413+463, DK421+651 DK422+376.5, DK424+118, DK431+713.4
    Specifications 180 +120, 2×180
    2×120, 2×120
    180+120, 2×180
    2×120, 2×120
    90,120 120, 2×120+90 90, 90,120
    Type2 mixing plant Mileage DK409+105 DK409+105 DK421+651, DK424+118
    model medium medium medium, medium
     | Show Table
    DownLoad: CSV

    Table 9.  Site selection schemes for processing plants

    The available amount of tunnel slag (10,000 m3) Proportion Number of processing plants Processing plants location
    121.09 1 3 DK406+956.5, DK413+463, DK431+713.4
    113.825 0. 94 3 DK406+956.5, DK413+463, DK431+713.4
    112.614-8.476 0.93-0.07 2 DK406+956.5, DK431+713.4
    7.264 0.06 1 DK428+797.85
    6.055 0.05 1 DK426.5+580.7
    3.633 0.03 1 DK423+ 294.2
    1.211 0.01 1 DK416+ 564.8
    1.090 0.009 \
     | Show Table
    DownLoad: CSV

    Table 10.  Location and schedule

    Name Starting mileage Ending mileage Start time End time
    Roadbed 1 DK404+867.00 DK404+977.00 2018/11/1 2019/11/1
    Tunnel 1 DK404+977.00 DK408+936.00 2018/11/1 2020/6/3
    Roadbed 2 DK408+936.00 DK408+953.52 2018/11/1 2020/4/1
    Bridge 1 DK408+953.52 DK409+349.48 2018/12/1 2020/5/20
    Roadbed 3 DK409+349.48 DK409+585.00 2018/11/1 2019/11/1
    Tunnel 2 DK409+585.00 DK411+319.00 2018/11/1 2020/1/4
    Roadbed 4 DK411+319.00 DK411+406.11 2018/11/1 2020/4/1
    Bridge 2 DK411+406.11 DK412+276.87 2018/12/1 2020/7/1
    Roadbed 5 DK412+276.87 DK412+561.00 2018/11/1 2020/4/1
    Tunnel 3 DK412+561.00 DK412+812.00 2019/7/14 2020/1/31
    Roadbed 6 DK412+810.00 DK412+862.12 2018/11/1 2020/4/1
    Bridge 3 DK412+862.12 DK413+094.53 2019/7/1 2020/4/13
    Roadbed 7 DK413+094.53 DK413+106.00 2018/11/1 2020/4/1
    Tunnel 4 DK413+106.00 DK413+820.00 2018/11/1 2019/12/11
    Roadbed 8 DK413+820.00 DK413+834.37 2018/11/1 2020/4/1
    Bridge 4 DK413+834.37 DK414+058.76 2019/3/1 2020/4/7
    Tunnel 5 DK414+058.76 DK415+125.00 2018/11/1 2020/1/24
    Roadbed 9 DK415+125.00 DK415+210.09 2018/11/1 2020/4/1
    Bridge 5 DK415+210.09 DK417+495.22 2019/1/1 2020/5/25
    Roadbed 10 DK417+495.22 DK417+634.39 2018/11/1 2020/4/1
    Bridge 6 DK417+634.39 DK420+508.68 2018/11/1 2020/4/10
    Roadbed 11 DK420+508.68 DK420+925.66 2018/12/1 2020/4/1
    Bridge 7 DK420+925.66 DK422+376.50 2018/12/1 2020/1/24
    Roadbed 12 DK422+376.50 DK422+487.87 2018/11/1 2020/4/1
    Bridge 8 DK422+487.87 DK424+100.56 2018/12/1 2020/6/29
    Roadbed 13 DK424+100.56 DK424+118.00 2018/11/1 2020/4/1
    Tunnel 6 DK424+118.00 DK424+350.00 2019/8/29 2020/3/20
    Roadbed 14 DK424+350.00 DK424+646.37 2018/11/1 2019/11/1
    Bridge 9 DK424+646.37 DK424+813.39 2019/2/5 2020/5/28
    Roadbed 15 DK424+813.39 DK425+140.71 2018/6/1 2020/4/1
    Bridge 10 DK425+140.71 DK425+526.86 2019/5/15 2020/6/29
    Roadbed 16 DK425+526.86 DK425+565.78 2018/12/1 2019/11/1
    Bridge 11 DK425+565.78 DK428+595.705 2018/11/1 2020/7/30
    Tunne l7 DK428+595.705 DK429+000.00 2018/12/1 2019/9/27
    bridge12 DK429+000.00 DK429+124.54 2019/11/22 2020/7/10
    Roadbed 17 DK429+124.54 DK429+210.00 2018/11/1 2020/4/1
    Tunnel 8 DK429+210.00 DK429+337.37 2018/11/1 2019/4/30
    Bridge 13 DK429+337.37 DK429+373.43 2019/2/10 2020/6/30
    Tunnel 9 DK429+373.43 DK432+903.00 2018/12/1 2020/6/13
    Tunnel 10 DK430+467.52 DK432+959.27 2018/12/1 2020/3/15
    Tunnel 11 DK431+171.24 DK433+150.70 2018/12/1 2020/6/13
     | Show Table
    DownLoad: CSV

    Table 11.  Quantity of tunnel slag

    Name Quantity of tunnel slag (m3)
    Tunnel 1 800000
    Tunnel 2 350000
    Tunnel 3 133600
    Tunnel 4 148800
    Tunnel 5 40600
    Tunnel 6 64000
    Tunnel 7 31800
     | Show Table
    DownLoad: CSV

    Table 12.  Demand

    Name Sand and gravel demand(kg/m)
    Roadbed 51442
    Bridge 84227
    Tunnel 131818
     | Show Table
    DownLoad: CSV
  • [1] G. Agac, et al., A supply chain network design for blood and its products using genetic algorithm: A case study of turkey, J. Ind. Manag. Optim., 19 (2023), 5407-5446. doi: 10.3934/jimo.2022179.
    [2] R. Ahmed and X. Zhang, Multi-stage network-based two-type cost minimization for the reverse logistics management of inert construction waste, Waste Manage., 120 (2021), 805-819.  doi: 10.1016/j.wasman.2020.11.004.
    [3] S. AliH. Barman and R. Kaur, Multi-product multi echelon measurements of perishable supply chain: Fuzzy non-linear programming approach, Mathematics, 9 (2021), 2093-2120.  doi: 10.3390/math9172093.
    [4] S. AliJ. Madaan and T. S. Felix, Inventory management of perishable products: A time decay linked logistic approach, International Journal of Production Research, 51 (2013), 3864-3879.  doi: 10.1080/00207543.2012.752587.
    [5] S. AliT. Paksoy and B. Torul, Reverse logistics optimization of an industrial air conditioner manufacturing company for designing sustainable supply chain: A fuzzy hybrid multi-criteria decision-making approach, Wireless Networks, 26 (2020), 5759-5782.  doi: 10.1007/s11276-019-02246-6.
    [6] An on, The statistical bulletin on the development of China's transportation industry in 2020 was released, Tunnel Construction, 41 (2021), 963. 
    [7] M. ArakawaY. Yamashita and K. Funatsu, Genetic algorithm-based wavelength selection method for spectral calibration, J. Chemometr., 25 (2019), 10-19.  doi: 10.1002/cem.1339.
    [8] E. Ardjmand, et al., Applying genetic algorithm to a new location and routing model of hazardous materials, Int. J. of Prod. Res., 53 (2015), 916-928.
    [9] M. AtabakiA. Khamseh and M. Mohammadi, A priority-based firefly algorithm for network design of a closed-loop supply chain with price-sensitive demand, Comput. Ind. Eng., 135 (2019), 814-837.  doi: 10.1016/j.cie.2019.06.054.
    [10] A. BarrosR. Dekker and V. Scholten, A two-level network for recycling sand: A case study, Eur. J. Oper. Res., 110 (1998), 199-214.  doi: 10.1016/S0377-2217(98)00093-9.
    [11] R. Bellopede and P. Marini, Aggregates from tunnel muck treatments, properties and uses, Physicochemical Probl. Mi, 47 (2011), 259-266. 
    [12] L. ChuS. Zuo and Z. Ruan, Research on location optimization of multi-level multi-site reverse logistics network considering return uncertainty, Operations Research and Management Science, 30 (2021), 73-79. 
    [13] Z. ChuZ. Li and W. Bai, Optimal siting and sizing of distributed generations considering uncertainties and environmental factors, Power System Protection and Control, 45 (2017), 34-41. 
    [14] S. Das, An approach to optimize the cost of transportation problem based on triangular fuzzy programming problem, Complex Intell. Syst., 8 (2022), 687-699.  doi: 10.1007/s40747-021-00535-2.
    [15] E. Dosal, et al., Application of multi-criteria decision-making tool to locate construction and demolition waste recycling facilities in a northern spanish region, Environ. Eng. Manag. J., 11 (2012), 545-556.
    [16] B. DuanC. Guo and H. Liu, A hybrid genetic-particle swarm optimization algorithm for multi-constraint optimization problems, Soft Comput., 26 (2022), 11695-11711.  doi: 10.1007/s00500-022-07489-8.
    [17] H. Eiselt and V. Marianov, A bi-objective model for the location of landfills for municipal solid waste, Eur. J. Oper. Res., 235 (2014), 187-194.  doi: 10.1016/j.ejor.2013.10.005.
    [18] M. EskandarpourE. MasehianR. Soltani and A. Khosrojerdi, A reverse logistics network for recovery systems and a robust metaheuristic solution approach, Int, J. Adv, Manuf. Tech., 74 (2014), 1393-1406. 
    [19] M. Fazli-Khalaf and A. Hamidieh, A robust reliable forward-reverse supply chain network design model under parameter and disruption uncertainties, International Journal of Engineering, Transactions B: Applications, 30 (2017), 1160-1169. 
    [20] P. Fu, et al., Multiobjective location model design based on government subsidy in the recycling of CDW, Math. Probl. Eng., 2017 (2017), 1-9. doi: 10.1155/2017/9081628.
    [21] J. Gu, et al., Low-carbon job shop scheduling problem with discrete genetic-grey wolf optimization algorithm, J. Adv. Manuf. Syst., 19 (2020), 1-14.
    [22] H. Hao, et al., Reverse logistics network design of electric vehicle batteries considering recall risk, Math. Probl. Eng., 2021 (2021), 1-16. doi: 10.1155/2021/5518049.
    [23] G. Harish, A hybrid GSA-GA algorithm for constrained optimization problems, Inform. Science, 478 (2019), 499-523. 
    [24] S. Hashemi, A fuzzy multi-objective optimization model for a sustainable reverse logistics network design of municipal waste-collecting considering the reduction of emissions, J. Clean. Prod., 318 (2021), 128577.  doi: 10.1016/j.jclepro.2021.128577.
    [25] J. HollandAdaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, University of Michigan Press, Ann Arbor, MI, 1975. 
    [26] L. Huang, et al., Approximate controllability of the non-autonomous impulsive evolution equation with state-dependent delay in Banach space, Tunnel Construction, 41 (2021), 1992-2000.
    [27] X. Jiang and S. Li, BAS: Beetle antennae search algorithm for optimization problems, International Journal of Robotics and Control, 1 (2017), 1-5.  doi: 10.5430/ijrc.v1n1p1.
    [28] M. Jiménez, Ranking fuzzy numbers through the comparison of its expected intervals, Int. J. Uncertain. Fuzz., 4 (1996), 379-388.  doi: 10.1142/S0218488596000226.
    [29] M. Jiménez, et al., Linear programming with fuzzy parameters: An interactive method resolution, Eur. J. Oper. Res., 177 (2007), 1599-1609. doi: 10.1016/j.ejor.2005.10.002.
    [30] Z. JinC. Guo and J. Gong, Demand response public transport planning based on elite selection genetic algorithm, Highway Engineering, 45 (2020), 44-49. 
    [31] S. Khalilpourazari, et al., Designing energy-efficient high-precision multi-pass turning processes via robust optimization and artificial intelligence, J. Intell. Manuf., 32 (2021), 1621- 1647. doi: 10.1007/s10845-020-01648-0.
    [32] S. Khalilpourazari, et al., Robust fuzzy chance constraint programming for multi-item EOQ model with random disruption and partial backordering under uncertainty, J. Chin. Inst. Eng., 36 (2019), 276-285. doi: 10.1080/21681015.2019.1646328.
    [33] S. Khalilpourazari and H. Doulabi, Robust modelling and prediction of the COVID-19 pandemic in Canada, Int. J. Prod. Res., 61 (2023), 8367-8383.  doi: 10.1080/00207543.2021.1936261.
    [34] S. Khalilpourazari and H. Doulabi, Using reinforcement learning to forecast the spread of COVID-19 in France, 2021 IEEE International Conference on Autonomous Systems, (2021), 1-8. 
    [35] S. Khalilpourazari and S. Pasandideh, Designing emergency flood evacuation plans using robust optimization and artificial intelligence, J. Comb. Optim., 41 (2021), 640-677.  doi: 10.1007/s10878-021-00699-0.
    [36] S. Khalilpourazari and S. Pasandideh, Modeling and optimization of multi-item multi-constrained EOQ model for growing items, Know. Based Syst., 164 (2019), 150-162.  doi: 10.1016/j.knosys.2018.10.032.
    [37] S. KhalilpourazariS. Pasandidehl and S. Niak, Optimizing a multi-item economic order quantity problem with imperfect items, inspection errors, and backorders, Soft Comput., 23 (2019), 11671-11698.  doi: 10.1007/s00500-018-03718-1.
    [38] H. Krikke, Impact of closed-loop network configurations on carbon footprints: A case study in copiers, Resour. Conserv. Recycl., 55 (2011), 1196-1205.  doi: 10.1016/j.resconrec.2011.07.001.
    [39] T. Kundu and G. Harish, A hybrid ITLHHO algorithm for numerical and engineering optimization problems, Int. J. Intell. Syst., 37 (2021), 3900-3980.  doi: 10.1002/int.22707.
    [40] F. Li, et al., Location and path problem of hub expansion in hybrid hub and spoke multimodal transport network considering carbon emissions, J. Traffic Transp. Eng., 22 (2022), 306-321.
    [41] K. LieckensP. Colen and M. Lambrecht, Optimization of a stochastic remanufacturing network with an exchange option, Decis. Support Syst., 54 (2013), 1548-1557.  doi: 10.1016/j.dss.2012.05.057.
    [42] J. Liu, et al., Optimization of site selection for construction and demolition waste recycling plant using genetic algorithm, Neural Comput. Appl., 31 (2019), 233-245. doi: 10.1007/s00521-018-3730-8.
    [43] Y. Ma, et al., Multi-agent optimization model and algorithm for fresh food location-route based on conflict cooperation, Systems Engineering-Theory and Practice, 40 (2020), 3194-3209.
    [44] L. MengN. Sang and Q. Yue, Study on the optimal parameters of hybrid leapfrog algorithm, Application Research of Computers, 36 (2019), 3321-3324. 
    [45] M. Mohammadi and S. Khalilpourazari, Minimizing makespan in a single machine scheduling problem with deteriorating jobs and learning effects, International Conference on Software and Computer Applications, (2017), 310-315. 
    [46] M. Owais, Traffic sensor location problem: Three decades of research, Expert Syst. Appl., 208 (2022), 118134.  doi: 10.1016/j.eswa.2022.118134.
    [47] M. OwaisGhada S. Moussa and Khaled F. Hussain, Sensor location model for o/d estimation: Multi-criteria meta-heuristics approach, Oper. Res. Perspect., 6 (2019), 100100.  doi: 10.1016/j.orp.2019.100100.
    [48] M. Owais and M. Osman, Complete hierarchical multi-objective genetic algorithm for transit network design problem, Expert Syst. Appl., 114 (2018), 143-154.  doi: 10.1016/j.eswa.2018.07.033.
    [49] M. OsmanM. Owais and G. Moussa, Multi-objective transit route network design as set covering problem, IEEE T. Intell. Transp., 17 (2016), 670-679.  doi: 10.1109/TITS.2015.2480885.
    [50] M. PetitatK. Allmen and J. Burdin, Automation of rock selection and aggregate quality for reuse in tunnelling and industry, Geomechanics and Tunnelling, 8 (2015), 315-320.  doi: 10.1002/geot.201500012.
    [51] B. Qiu, et al., Fault location of distribution network with distributed power based on BASIGA, Proceedings of the CSU-EPSA, 33 (2021), 8-14.
    [52] A. Rentizelas, et al., Reverse supply network design for circular economy pathways of wind turbine blades in europe, Int. J. Prod. Res., 60 (2022), 1795-1814. doi: 10.1080/00207543.2020.1870016.
    [53] O. Sen, An improved catastrophic genetic algorithm and its application in reactive power optimization, Energy and Power Engineering, 2 (2010), 306-312.  doi: 10.1109/APPEEC.2010.5448290.
    [54] X. Shang, et al., Study on comprehensive utilization and management of tunnel slag in expressway, E3S Web of Conferences, 145 (2020), 02033. doi: 10.1051/e3sconf/202014502033.
    [55] R. Sharma, et al., Chauhan, Optimisation of an inventory model for conclusive and inconclusive cost parameters using triangular and trapezoidal fuzzy numbers, International Journal of Mathematics in Operational Research, 21 (2022), 529-553. doi: 10.1504/IJMOR.2022.122808.
    [56] Q. Shi, et al., Site selection of construction waste recycling plant, J. Clean. Prod., 227 (2019), 532-542. doi: 10.1016/j.jclepro.2019.04.252.
    [57] H. Soleimani, et al., Fuzzy multi-objective sustainable and green closed-loop supply chain network design, Comput. Ind. Eng., 109 (2017), 191-203. doi: 10.1016/j.cie.2017.04.038.
    [58] P. Soleymani, et al., Robust fuzzy chance constraint programming for multi-item EOQ model with random disruption and partial backordering under uncertainty, Int. J. of Applied Decision Sciences, 9 (2016), 447-476.
    [59] W. Sun and B. Yang, Uncertain green logistics network design based on fuzzy mathematics, Journal of Hefei University of Technology, 37 (2014), 624-630. 
    [60] S. Tian, et al., Design concept and main principles of tunnel on Sichuan-Tibet raiway, Tunnel Construction, 41 (2021), 519-530.
    [61] A. TolgaI. Parlak and O. Castillo, Finite-interval-valued type-2 gaussian fuzzy numbers applied to fuzzy TODIM in a healthcare problem, Eng. Appl. Artif. Intel., 87 (2020), 103352.  doi: 10.1016/j.engappai.2019.103352.
    [62] J. TrochuA. Chaabane and M. Ouhimmou, Reverse logistics network redesign under uncertainty for wood waste in the CRD industry, Resour. Conserv. Recycl., 128 (2018), 32-47.  doi: 10.1016/j.resconrec.2017.09.011.
    [63] S. Wang, et al., Evaluation on the importance of ecological protection in changdu section of the Sichuan-Tibet railway, Geoscience, 35 (2021), 234-243.
    [64] G. WangS. Deb and L. Coelho, Earthworm optimisation algorithm: A bio-inspired metaheuristic algorithm for global optimisation problems, Int. J. of Bio-Inspired Computation, 12 (2018), 1-22.  doi: 10.1504/IJBIC.2018.093328.
    [65] G. WangS. Deb and L. Santos Coelho, Monarch butterfly optimization, Neural Comput. Appl., 31 (2019), 1995-2014.  doi: 10.1007/s00521-015-1923-y.
    [66] G. WangD. Gao and W. Pedrycz, Solving multiobjective fuzzy job-shop scheduling problem by a hybrid adaptive differential evolution algorithm, IEEE T. Cybernetics, 18 (2022), 8519.  doi: 10.1109/TII.2022.3165636.
    [67] G. Wang and Y. Tan, Improving metaheuristic algorithms with information feedback models, IEEE T. Cybernetics, 49 (2017), 542-555.  doi: 10.1109/TCYB.2017.2780274.
    [68] Y. Wang, et al., Vehicle routing optimization in reverse logistics based on product recovery pricing, J. Manuf. Syst., 31 (2022), 199-216.
    [69] Y. Xie, et al., Research and prospect on technology for resource recycling of shield tunnel spoil, Tunnel Construction, 42 (2022), 188-207.
    [70] J. Xu, et al., Surface accuracy optimization of mechanical parts with multiple circular holes for additive manufacturing based on triangular fuzzy number, Front. Mech. Eng-Prc., 16 (2023), 133-150. doi: 10.1007/s11465-020-0610-6.
    [71] H. Xuan, et al., Improved catastrophic genetic algorithm for reentry flexible flow shop problem with uncorrelated machines, Industrial Engineering and Management, 26 (2021), 161-171.
    [72] M. Yavari and M. Geraeli, Heuristic method for robust optimization model for green closed-loop supply chain network design of perishable goods, J. of Clean. Prod., 226 (2019), 282-305.  doi: 10.1016/j.jclepro.2019.03.279.
    [73] Z. Yuan, et al., Review on resources comprehensive utilization of tunnal muck in building materials, Bulletin of The Chinese Ceramic Society, 39 (2020), 2468-2475.
    [74] Y. Zhou, et al., The joint location-transportation model based on grey bi-level programming for early post-earthquake relief, J. Ind. Manag. Optim., 18 (2022), 45-73. doi: 10.3934/jimo.2020142.
    [75] J. ZhouM. Li and Y. Sui, Logistics node location with curved demand and lateral transshipment, Industrial Engineering Journal, 23 (2002), 82-87. 
  • 加载中

Figures(8)

Tables(12)

SHARE

Article Metrics

HTML views(3366) PDF downloads(531) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return