A journal of IEEE and CAA , publishes high-quality papers in English on original theoretical/experimental research and development in all areas of automation
Volume 9 Issue 11
Nov.  2022

IEEE/CAA Journal of Automatica Sinica

  • JCR Impact Factor: 7.847, Top 10% (SCI Q1)
    CiteScore: 13.0, Top 5% (Q1)
    Google Scholar h5-index: 64, TOP 7
Turn off MathJax
Article Contents
M. J. Cui, L. Li, M. C. Zhou, J. K. Li, A. Abusorrah, and K. Sedraoui, “A bi-population cooperative optimization algorithm assisted by an autoencoder for medium-scale expensive problems,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 11, pp. 1952–1966, Nov. 2022. doi: 10.1109/JAS.2022.105425
Citation: M. J. Cui, L. Li, M. C. Zhou, J. K. Li, A. Abusorrah, and K. Sedraoui, “A bi-population cooperative optimization algorithm assisted by an autoencoder for medium-scale expensive problems,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 11, pp. 1952–1966, Nov. 2022. doi: 10.1109/JAS.2022.105425

A Bi-population Cooperative Optimization Algorithm Assisted by an Autoencoder for Medium-scale Expensive Problems

doi: 10.1109/JAS.2022.105425
Funds:  This work was supported in part by the National Natural Science Foundation of China (72171172, 62088101), in part by the Shanghai Science and Technology Major Special Project of Shanghai Development and Reform Commission (2021SHZDZX0100), in part by the Shanghai Commission of Science and Technology (19511132100, 19511132101), in part by the China Scholarship Council, and in part by the Deanship of Scientific Research (DSR) at King Abdulaziz University (KAU), Jeddah, Saudi Arabia (FP-146-43)
More Information
  • This study presents an autoencoder-embedded optimization (AEO) algorithm which involves a bi-population cooperative strategy for medium-scale expensive problems (MEPs). A huge search space can be compressed to an informative low-dimensional space by using an autoencoder as a dimension reduction tool. The search operation conducted in this low space facilitates the population with fast convergence towards the optima. To strike the balance between exploration and exploitation during optimization, two phases of a tailored teaching-learning-based optimization (TTLBO) are adopted to coevolve solutions in a distributed fashion, wherein one is assisted by an autoencoder and the other undergoes a regular evolutionary process. Also, a dynamic size adjustment scheme according to problem dimension and evolutionary progress is proposed to promote information exchange between these two phases and accelerate evolutionary convergence speed. The proposed algorithm is validated by testing benchmark functions with dimensions varying from 50 to 200. As indicated in our experiments, TTLBO is suitable for dealing with medium-scale problems and thus incorporated into the AEO framework as a base optimizer. Compared with the state-of-the-art algorithms for MEPs, AEO shows extraordinarily high efficiency for these challenging problems, thus opening new directions for various evolutionary algorithms under AEO to tackle MEPs and greatly advancing the field of medium-scale computationally expensive optimization.

     

  • loading
  • [1]
    Q. Wu, M. Zhou, Q. Zhu, Y. Xia, and J. Wen, “MOELS: Multiobjective evolutionary list scheduling for cloud workflows,” IEEE Trans. Autom. Sci. Eng., vol. 17, no. 1, pp. 166–176, 2019.
    [2]
    B. Liu, D. Zhao, P. Reynaert, and G. G. Gielen, “GASPAD: A general and efficient mm-wave integrated circuit synthesis method based on surrogate model assisted evolutionary algorithm,” IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., vol. 33, no. 2, pp. 169–182, 2014. doi: 10.1109/TCAD.2013.2284109
    [3]
    M. O. Akinsolu, B. Liu, V. Grout, P. I. Lazaridis, M. E. Mognaschi, and P. Di Barba, “A parallel surrogate model assisted evolutionary algorithm for electromagnetic design optimization,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 3, no. 2, pp. 93–105, 2019. doi: 10.1109/TETCI.2018.2864747
    [4]
    A. H. Khan, X. Cao, S. Li, V. N. Katsikis, and L. Liao, “BAS-ADAM: An ADAM based approach to improve the performance of beetle antennae search optimizer,” IEEE/CAA J. Autom. Sinica, vol. 7, no. 2, pp. 461–471, Mar. 2020.
    [5]
    J. Tang, G. Liu, and Q. Pan, “A review on representative swarm intelligence algorithms for solving optimization problems: Applications and trends,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 10, pp. 1627–1643, 2021. doi: 10.1109/JAS.2021.1004129
    [6]
    S. Zhu and L. Xu, “Many-objective fuzzy centroids clustering algorithm for categorical data,” Expert Syst. Appl., vol. 96, pp. 230–248, 2018. doi: 10.1016/j.eswa.2017.12.013
    [7]
    T. W. Simpson, A. J. Booker, D. Ghosh, A. A. Giunta, P. N. Koch, and R.-J. Yang, “Approximation methods in multidisciplinary analysis and optimization: A panel discussion,” Struct. Multidiscipl. Optim., vol. 27, no. 5, pp. 302–313, 2004.
    [8]
    Y. Jin, H. Wang, T. Chugh, D. Guo, and K. Miettinen, “Data-driven evolutionary optimization: An overview and case studies,” IEEE Trans. Evol. Comput., vol. 23, no. 3, pp. 442–458, 2018.
    [9]
    Y. Jin, “A comprehensive survey of fitness approximation in evolutionary computation,” Soft comput., vol. 9, no. 1, pp. 3–12, 2005. doi: 10.1007/s00500-003-0328-5
    [10]
    Y. Jin, “Surrogate-assisted evolutionary computation: Recent advances and future challenges,” Swarm Evol. Comput., vol. 1, no. 2, pp. 61–70, 2011. doi: 10.1016/j.swevo.2011.05.001
    [11]
    Z. Lv, L. Wang, Z. Han, J. Zhao, and W. Wang, “Surrogate-assisted particle swarm optimization algorithm with pareto active learning for expensive multi-objective optimization,” IEEE/CAA J. Autom. Sin., vol. 6, no. 3, pp. 838–849, 2019. doi: 10.1109/JAS.2019.1911450
    [12]
    B. Liu, Q. Zhang, and G. G. Gielen, “A Gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems,” IEEE Trans. Evol. Comput., vol. 18, no. 2, pp. 180–192, 2013.
    [13]
    H. Akbari and A. Kazerooni, “KASRA: A kriging-based adaptive space reduction algorithm for global optimization of computationally expensive black-box constrained problems,” Appl. Soft Comput., vol. 90, pp. 106–154, 2020.
    [14]
    J. Tian, Y. Tan, J. Zeng, C. Sun, and Y. Jin, “Multiobjective infill criterion driven Gaussian process-assisted particle swarm optimization of highdimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 23, no. 3, pp. 459–472, 2018.
    [15]
    X. Cai, L. Gao, and X. Li, “Efficient generalized surrogate-assisted evolutionary algorithm for high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 24, no. 2, pp. 365–379, 2019.
    [16]
    C. Sun, Y. Jin, R. Cheng, J. Ding, and J. Zeng, “Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 21, no. 4, pp. 644–660, 2017. doi: 10.1109/TEVC.2017.2675628
    [17]
    F. Li, X. Cai, L. Gao, and W. Shen, “A surrogate-assisted multiswarm optimization algorithm for high-dimensional computationally expensive problems,” IEEE Trans. Cybern., vol. 51, no. 3, pp. 1390–1402, 2020.
    [18]
    H. Yu, Y. Tan, C. Sun, and J. Zeng, “A generation-based optimal restart strategy for surrogate-assisted social learning particle swarm optimization. Knowl,” Based Syst., vol. 163, pp. 14–25, 2019. doi: 10.1016/j.knosys.2018.08.010
    [19]
    H. Wang and Y. Jin, “A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems,” IEEE Trans. Cybern., vol. 50, no. 2, pp. 536–549, 2018.
    [20]
    Y. Sun, H. Wang, B. Xue, Y. Jin, G. G. Yen, and M. Zhang, “Surrogate-assisted evolutionary deep learning using an end-to-end random forest-based performance predictor,” IEEE Trans. Evol. Comput., vol. 24, no. 2, pp. 350–364, 2020. doi: 10.1109/TEVC.2019.2924461
    [21]
    D. Guo, Y. Jin, J. Ding, and T. Chai, “Heterogeneous ensemble-based infill criterion for evolutionary multiobjective optimization of expensive problems,” IEEE Trans. Cybern., vol. 49, no. 3, pp. 1012–1025, 2018.
    [22]
    F. Li, X. Cai, and L. Gao, “Ensemble of surrogates assisted particle swarm optimization of medium scale expensive problems,” Appl. Soft Comput., vol. 74, pp. 291–305, 2019. doi: 10.1016/j.asoc.2018.10.037
    [23]
    W. Luo, R. Yi, B. Yang, and P. Xu, “Surrogate-assisted evolutionary framework for data-driven dynamic optimization,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 3, no. 2, pp. 137–150, 2018.
    [24]
    B. Liu, S. Koziel, and Q. Zhang, “A multi-fidelity surrogate-modelassisted evolutionary algorithm for computationally expensive optimization problems,” J. Comput. Sci., vol. 12, pp. 28–37, 2016. doi: 10.1016/j.jocs.2015.11.004
    [25]
    A. L. Marsden, M. Wang, J. E. Dennis, and P. Moin, “Optimal aeroacoustic shape design using the surrogate management framework,” Optim. Eng., vol. 5, no. 2, pp. 235–262, 2004. doi: 10.1023/B:OPTE.0000033376.89159.65
    [26]
    I. De Falco, A. Della Cioppa, and G. A. Trunfio, “Investigating surrogate-assisted cooperative coevolution for large-scale global optimization,” Inf. Sci., vol. 482, pp. 1–26, 2019. doi: 10.1016/j.ins.2019.01.009
    [27]
    Z. Ren, B. Pang, M. Wang, Z. Feng, Y. Liang, A. Chen, and Y. Zhang, “Surrogate model assisted cooperative coevolution for large scale optimization,” Appl. Intell., vol. 49, no. 2, pp. 513–531, 2019. doi: 10.1007/s10489-018-1279-y
    [28]
    S. Shan and G. G. Wang, “Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally expensive black-box functions,” Struct. Multidiscipl. Optim., vol. 41, no. 2, pp. 219–241, 2010. doi: 10.1007/s00158-009-0420-2
    [29]
    Z. Yang, H. Qiu, L. Gao, C. Jiang, and J. Zhang, “Two-layer adaptive surrogate-assisted evolutionary algorithm for high-dimensional computationally expensive problems,” J. Glob. Optim., vol. 72, no. 2, pp. 327–359, 2019.
    [30]
    G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science, vol. 313, no. 5786, pp. 504–507, 2006. doi: 10.1126/science.1127647
    [31]
    C. Ieracitano, A. Paviglianiti, M. Campolo, A. Hussain, E. Pasero, and F. C. Morabito., “A novel automatic classification system based on hybrid unsupervised and supervised machine learning for electrospun nanofibers,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 1, pp. 64–76, Jan. 2021.
    [32]
    S. Harford, F. Karim, and H. Darabi, “Generating adversarial samples on multivariate time series using variational autoencoders,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 9, pp. 1523–1538, Sept. 2021.
    [33]
    M. Cui, L. Li, and M. Zhou, “An autoencoder-embedded evolutionary optimization framework for high-dimensional problems,” in Proc. IEEE Int. Conf. Syst., Man, Cybern., 2020, pp. 1046–1051.
    [34]
    Z. Zhou, Y. S. Ong, P. B. Nair, A. J. Keane, and K. Y. Lum, “Combining global and local surrogate models to accelerate evolutionary optimization,” IEEE Trans. Syst. Man Cybern. C Appl. Rev., vol. 37, no. 1, pp. 66–76, 2006.
    [35]
    D. Lim, Y. Jin, Y.-S. Ong, and B. Sendhoff, “Generalizing surrogate-assisted evolutionary computation,” IEEE Trans. Evol. Comput., vol. 14, no. 3, pp. 329–355, 2009.
    [36]
    R. G. Regis, “Evolutionary programming for high-dimensional constrained expensive black-box optimization using radial basis functions,” IEEE Trans Evol. Comput., vol. 18, no. 3, pp. 326–347, 2013.
    [37]
    C. Sun, J. Ding, J. Zeng, and Y. Jin, “A fitness approximation assisted competitive swarm optimizer for large scale expensive optimization problems,” Memet. Comput., vol. 10, no. 2, pp. 123–134, 2018. doi: 10.1007/s12293-016-0199-9
    [38]
    H. Yu, Y. Tan, J. Zeng, C. Sun, and Y. Jin, “Surrogate-assisted hierarchical particle swarm optimization,” Inf. Sci., vol. 454, pp. 59–72, 2018.
    [39]
    X. Wang, G. G. Wang, B. Song, P. Wang, and Y. Wang, “A novel evolutionary sampling assisted optimization method for high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 23, no. 5, pp. 815–827, 2019. doi: 10.1109/TEVC.2019.2890818
    [40]
    J. Tian, C. Sun, Y. Tan, and J. Zeng, “Granularity-based surrogateassisted particle swarm optimization for high-dimensional expensive optimization,” Knowl. Based Syst., vol. 187, pp. 104–815, 2020.
    [41]
    B. Zhang, D. Xiong, J. Su, and Y. Qin, “Alignment-supervised bidimensional attention-based recursive autoencoders for bilingual phrase representation,” IEEE Trans. Cybern., vol. 50, no. 2, pp. 503–513, 2018.
    [42]
    A. Gogna, A. Majumdar, and R. Ward, “Semi-supervised stacked label consistent autoencoder for reconstruction and analysis of biomedical signals,” IEEE Trans. Biomed. Eng., vol. 64, no. 9, pp. 2196–2205, 2016.
    [43]
    L. Chen, X. Hu, W. Tian, H. Wang, D. Cao, and F.-Y. Wang, “Parallel planning: A new motion planning framework for autonomous driving,” IEEE/CAA J. Autom. Sin., vol. 6, no. 1, pp. 236–246, 2018.
    [44]
    L. Feng, Y.-S. Ong, S. Jiang, and A. Gupta, “Autoencoding evolutionary search with learning across heterogeneous problems,” IEEE Trans. Evol. Comput., vol. 21, no. 5, pp. 760–772, 2017. doi: 10.1109/TEVC.2017.2682274
    [45]
    L. Feng, L. Zhou, J. Zhong, A. Gupta, Y.-S. Ong, K.-C. Tan, and A. Qin, “Evolutionary multitasking via explicit autoencoding,” IEEE Trans. Cybern., vol. 49, no. 9, pp. 3457–3470, 2018.
    [46]
    Y. Tian, C. Lu, X. Zhang, K. C. Tan, and Y. Jin, “Solving large-scale multiobjective optimization problems with sparse optimal solutions via unsupervised neural networks,” IEEE Trans. Cybern., vol. 51, no. 6, pp. 3115–3128, 2020.
    [47]
    R. V. Rao, V. J. Savsani, and D. Vakharia, “Teaching-learning-based optimization: An optimization method for continuous non-linear large scale problems,” Inf. Sci., vol. 183, no. 1, pp. 1–15, 2012. doi: 10.1016/j.ins.2011.08.006
    [48]
    R. Cheng and Y. Jin, “A competitive swarm optimizer for large scale optimization,” IEEE Trans. Cybern., vol. 45, no. 2, pp. 191–204, 2014.
    [49]
    Y. Yu, S. Gao, Y. Wang, and Y. Todo, “Global optimum-based search differential evolution,” IEEE/CAA J. Autom. Sinica, vol. 6, no. 2, pp. 379–394, 2019. doi: 10.1109/JAS.2019.1911378
    [50]
    G. Tian, M. Zhou, P. Li, C. Zhang, and H. Jia, “Multiobjective optimization models for locating vehicle inspection stations subject to stochastic demand, varying velocity and regional constraints,” IEEE Trans. Intell. Transp. Syst., vol. 17, no. 7, pp. 1978–1987, 2016. doi: 10.1109/TITS.2016.2514277
    [51]
    G. Tian, N. Hao, M. Zhou, W. Pedrycz, C. Zhang, F. Ma, and Z. Li, “Fuzzy grey choquet integral for evaluation of multicriteria decision making problems with interactive and qualitative indices,” IEEE Trans. Syst. Man Cybern. Syst., vol. 51, no. 3, pp. 1855–1868, 2021.
    [52]
    A. Behera, T. K. Panigrahi, P. K. Ray, and A. K. Sahoo, “A novel cascaded PID controller for automatic generation control analysis with renewable sources,” IEEE/CAA J. Autom. Sinica, vol. 6, no. 6, pp. 1438–1451, 2019.
    [53]
    M. Stein, “Large sample properties of simulations using latin hypercube sampling,” Technometrics, vol. 29, no. 2, pp. 143–151, 1987. doi: 10.1080/00401706.1987.10488205
    [54]
    M. Beale, M. Hagan, and H. Demuth, “Matlab deep learning toolboxTM user’s guide: Pdf documentation for release r2019a,” The MathWorks, Inc, 2019.
    [55]
    F. Camastra and A. Staiano, “Intrinsic dimension estimation: Advances and open problems,” Inf. Sci., vol. 328, pp. 26–41, 2016. doi: 10.1016/j.ins.2015.08.029
    [56]
    Y. Cao, H. Zhang, W. Li, M. Zhou, Y. Zhang, and W. A. Chaovalitwongse, “Comprehensive learning particle swarm optimization algorithm with local search for multimodal functions,” IEEE Trans. Evol. Comput., vol. 23, no. 4, pp. 718–731, 2018.
    [57]
    W. Dong, Y. Wang, and M. Zhou, “A latent space-based estimation of distribution algorithm for large-scale global optimization,” Soft Comput., vol. 23, no. 13, pp. 4593–4615, 2019. doi: 10.1007/s00500-018-3390-8
    [58]
    W. Dong and M. Zhou, “A supervised learning and control method to improve particle swarm optimization algorithms,” IEEE Trans. Syst. Man Cybern. Syst., vol. 47, no. 7, pp. 1135–1148, 2016.
    [59]
    L. Huang, M. Zhou, and K. Hao, “Non-dominated immune-endocrine short feedback algorithm for multi-robot maritime patrolling,” IEEE Trans. Intell. Transp. Syst., vol. 21, no. 1, pp. 362–373, 2019.
    [60]
    J. Zhang, X. Zhu, Y. Wang, and M. Zhou, “Dual-environmental particle swarm optimizer in noisy and noise-free environments,” IEEE Trans. Cybern., vol. 49, no. 6, pp. 2011–2021, 2018.
    [61]
    J. Zhao, S. Liu, M. Zhou, X. Guo, and L. Qi, “Modified cuckoo search algorithm to solve economic power dispatch optimization problems,” IEEE/CAA J. Autom. Sinica, vol. 5, no. 4, pp. 794–806, 2018. doi: 10.1109/JAS.2018.7511138
    [62]
    M. Cui, L. Li, and M. Shi, “A selective biogeography-based optimizer considering resource allocation for large-scale global optimization,” Comput. Intell. Neurosci., vol. 2019, 2019.
    [63]
    Y. Wang, S. Gao, M. Zhou, and Y. Yu, “A multi-layered gravitational search algorithm for function optimization and real-world problems,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 1, pp. 94–109, 2020.
    [64]
    S. Zhu, L. Xu, and E. D. Goodman, “Evolutionary multi-objective automatic clustering enhanced with quality metrics and ensemble strategy,” Knowl. Based Syst., vol. 188, p. 105018, 2020. doi: 10.1016/j.knosys.2019.105018
    [65]
    S. Zhu, L. Xu, and E. D. Goodman, “Hierarchical topology-based cluster representation for scalable evolutionary multiobjective clustering,” IEEE Trans. Cybern., 2021. DOI: 10.1109/TCYB.2021.3081988
    [66]
    Y. Hua, Q. Liu, K. Hao, and Y. Jin, “A survey of evolutionary algorithms for multi-objective optimization problems with irregular pareto fronts,” IEEE/CAA J. Autom. Sinica, vol. 8, no. 2, pp. 303–318, 2021. doi: 10.1109/JAS.2021.1003817
    [67]
    S. Zhu, L. Xu, E. D. Goodman, and Z. Lu, “A new many-objective evolutionary algorithm based on generalized Pareto dominance,” IEEE Trans. Cybern., 2021. DOI: 10.1109/TCYB.2021.3051078
    [68]
    Z. Lu, I. Whalen, Y. Dhebar, K. Deb, E. D. Goodman, W. Banzhaf, and V. N. Boddeti, “Multiobjective evolutionary design of deep convolutional neural networks for image classification,” IEEE Trans. Evol. Comput., vol. 25, no. 2, pp. 277–291, 2020.
    [69]
    Z. Lu, G. Sreekumar, E. Goodman, W. Banzhaf, K. Deb, and V. N. Boddeti, “Neural architecture transfer,” IEEE Trans. Pattern. Anal. Mach. Intell., vol. 43, no. 9, pp. 2971−2989, Sept. 2021.
    [70]
    W. Li, L. He, and Y. Cao, “Many-objective evolutionary algorithm with reference point-based fuzzy correlation entropy for energy-efficient job shop scheduling with limited workers,” IEEE Trans. Cybernetics, 2021. DOI: 10.1109/TCYB.2021.3069184.
    [71]
    G. Tian, Y. Ren and M. Zhou, “Dual-objective scheduling of rescue vehicles to distinguish forest fires via differential evolution and particle swarm optimization combined algorithm,” IEEE Trans. Intelligent Transportation Systems, vol. 17, no. 11, pp. 3009–3021, Nov. 2016.
    [72]
    Y. Fu, M. Zhou, X. Guo, and L. Qi, “Scheduling dual-objective stochastic hybrid flow shop with deteriorating jobs via bi-population evolutionary algorithm,” IEEE Trans. Systems,Man,and Cybernetics: Systems, vol. 50, no. 12, pp. 5037–5048, Dec. 2020.
    [73]
    X. Guo, M. Zhou, S. Liu, and L. Qi, “Lexicographic multiobjective scatter search for the optimization of sequence-dependent selective disassembly subject to multiresource constraints,” IEEE Trans. Cybernetics, vol. 50, no. 7, pp. 3307–3317, Jul. 2020.
    [74]
    S. Deng, L. Huang, J. Taheri, J. Yin, M. Zhou, and A Y. Zomaya, “Mobility-aware service composition in mobile communities,” IEEE Trans. Systems,Man,and Cybernetics: Systems, vol. 47, no. 3, pp. 555–568, Mar. 2017.
    [75]
    X. Luo, M. Zhou, S. Li, Y. Xia, Z.-H. You, S. Zhu, and H. Leung, “Incorporation of efficient second-order solvers into latent factor models for accurate prediction of missing QoS data,” IEEE Trans. Cybernetics, vol. 48, no. 4, pp. 1216–1228, Apr. 2018.
    [76]
    X. Luo, M. Zhou, Y. Xia, and Q. Zhu, “An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems,” IEEE Trans. Industrial Informatics, vol. 10, no. 2, pp. 1273–1284, May 2014.
    [77]
    H. Yuan, J. Bi, M. Zhou, Q. Liu, and A. C. Ammari, “Biobjective task scheduling for distributed green data centers,” IEEE Trans. Automation Science and Engineering, vol. 18, no. 2, pp. 731–742, Apr. 2021.
    [78]
    H. Yuan and M. Zhou, “Profit-maximized collaborative computation offloading and resource allocation in distributed cloud and edge computing systems,” IEEE Trans. Automation Science and Engineering, vol. 18, no. 3, pp. 1277–1287, Jul. 2021.
    [79]
    P. Zhang, M. Zhou, and X. Wang, “An intelligent optimization method for optimal virtual machine allocation in cloud data centers,” IEEE Trans. Automation Science and Engineering, vol. 17, no. 4, pp. 1725–1735, Oct. 2020.
    [80]
    X. Zhu and M. Zhou, “Multiobjective optimized cloudlet deployment and task offloading for mobile-edge computing,” IEEE Internet of Things Journal, vol. 8, no. 20, pp. 15582–15595, Oct. 2021.
    [81]
    J. Li, et al., “Colored Traveling Salesman Problem,” IEEE Trans. Cybernetics, vol. 45, no. 11, pp. 2390–2401, Nov. 2015.

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(8)  / Tables(10)

    Article Metrics

    Article views (293) PDF downloads(73) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return