Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mandan Liu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:

  • Zhengyan Mao

    Shanghai Key Laboratory of Computer Software Testing & Evaluating, Shanghai Development Center of Computer Software Technology, Shanghai 201112, China

    4 shared publications
  • Chao Jiang

    Faculty of Information Technology, Beijing Key Laboratory of Computational Intelligence and Intelligent System, Engineering Research Center of Digital Community, Ministry of Education, Beijing Artificial Intelligence Institute and Beijing Laboratory for Intelligent Environmental Protection, Beijing University of Technology, Beijing 100124, China

    3 shared publications
  • Jingjing Guo

    Department of Aerospace Science and Technology, Space Engineering University, Beijing 101416, China

    3 shared publications
  • Yijie Zhang

    School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China

    3 shared publications
  • Yue Xiang

    Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education, East China University of Science and Technology, Shanghai 200237, China

    3 shared publications
  • Qingwei Liu

    Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai, China

    2 shared publications

Latest Publications

  • Open Access

    Stage-Specific Multi-Objective Five-Element Cycle Optimization Algorithm in Green Vehicle-Routing Problem with Symmetric Distance Matrix: Balancing Carbon Emissions and Customer Satisfaction

    by Yue Xiang, Jingjing Guo, Zhengyan Mao, Chao Jiang, Mandan Liu

    This study presents a bi-objective optimization model for the Green Vehicle-Routing Problem in cold chain logistics, with a focus on symmetric distance matrices, aiming to minimize total costs, including carbon emissions, while maximizing customer satisfaction. To address this complex challenge, we developed a Stage-Specific Multi-Objective Five-Element Cycle Optimization algorithm (MOFECO-SS), which dynamically adjusts optimization strategies across different stages of the process, thereby enhancing overall efficiency. Extensive comparative analyses with existing algorithms demonstrate that MOFECO-SS consistently outperforms in solving the multi-objective optimization model, particularly in reducing total costs and carbon emissions while maintaining high levels of customer satisfaction. The symmetric nature of the distance matrix further aids in achieving balanced and optimized route planning. The results highlight that MOFECO-SS offers decision-makers flexible route planning options that balance cost efficiency with environmental sustainability, ultimately improving the effectiveness of cold chain logistics operations.


  • Open Access

    Five-Element Cycle Optimization Algorithm Based on an Integrated Mutation Operator for the Traveling Thief Problem

    by Yue Xiang, Jingjing Guo, Zhengyan Mao, Chao Jiang, Mandan Liu

    This paper presents a novel algorithm named Five-element Cycle Integrated Mutation Optimization (FECOIMO) for solving the Traveling Thief Problem (TTP). The algorithm introduces a five-element cycle structure that integrates various mutation operations to enhance both global exploration and local exploitation capabilities. In experiments, FECOIMO was extensively tested on 39 TTP instances of varying scales and compared with five common metaheuristic algorithms: Enhanced Simulated Annealing (ESA), Improved Grey Wolf Optimization Algorithm (IGWO), Improved Whale Optimization Algorithm (IWOA), Genetic Algorithm (GA), and Profit-Guided Coordination Heuristic (PGCH). The experimental results demonstrate that FECOIMO outperforms the other algorithms across all instances, particularly excelling in large-scale instances. The results of the Friedman test show that FECOIMO significantly outperforms other algorithms in terms of average solution, maximum solution, and solution standard deviation. Additionally, although FECOIMO has a longer execution time, its complexity is comparable to that of other algorithms, and the additional computational overhead in solving complex optimization problems translates into better solutions. Therefore, FECOIMO has proven its effectiveness and robustness in handling complex combinatorial optimization problems.


  • Open Access

    Multi-Objective Five-Element Cycle Optimization Algorithm Based on Multi-Strategy Fusion for the Bi-Objective Traveling Thief Problem

    by Yue Xiang, Jingjing Guo, Chao Jiang, Haibao Ma, Mandan Liu

    In this paper, we propose a Multi-objective Five-element Cycle Optimization algorithm based on Multi-strategy fusion (MOFECO-MS) to address the Bi-objective Traveling Thief Problem (BITTP), an extension of the Traveling Thief Problem that incorporates two conflicting objectives. The novelty of our approach lies in a unique individual selection strategy coupled with an innovative element update mechanism rooted in the Five-element Cycle Model. To balance global exploration and local exploitation, the algorithm categorizes the population into distinct groups and applies crossover operations both within and between these groups, while also employing a mutation operator for local searches on the best individuals. This coordinated approach optimizes parameter settings and enhances the search capabilities of the algorithm. Extensive experiments were conducted on nine BITTP instances, comparing MOFECO-MS against eight state-of-the-art multi-objective optimization algorithms. The results show that MOFECO-MS excels in both Hypervolume (HV) and Spread (SP) indicators, while also maintaining a high level of Pure Diversity (PD). Overall, MOFECO-MS outperformed the other algorithms in most instances, demonstrating its superiority and robustness in solving complex multi-objective optimization problems.


  • Open Access

    Dynamic Frequent Trajectory Mining Algorithm Based on Confidence of Suffix Subsequence

    by Fan He, Mandan Liu, Chao Zhong

    With the popularization of smart devices and the continuous development of wireless communication technology, a large amount of trajectory data is recorded in wireless networks, and frequent item mining for trajectory data has become a research hotspot. In order to rapid update frequent trajectory set when new data is added to the original trajectory database, and to solve the problem that trajectory database occupies a large amount of storage space, we propose a new dynamic PrefixSpan algorithm based on the confidence of suffix subsequence (CSS-PrefixSpan). This algorithm makes full use of the information of the frequent trajectory set and estimates the support of infrequent trajectory by using the confidence of infrequent trajectory suffix subsequence. When incremental trajectory data is added to the original trajectory database, CSS-PrefixSpan can dynamically update frequent trajectory set and no longer need to store the original trajectory data after mining frequent trajectories. Through two trajectory dataset mining experiments, the accuracy of the support estimation and the effectiveness of proposed algorithm are verified.

  • Open Access

    Fast Searching Density Peak Clustering Algorithm Based on Shared Nearest Neighbor and Adaptive Clustering Center

    by Yi Lv, Mandan Liu, Yue Xiang

    The clustering analysis algorithm is used to reveal the internal relationships among the data without prior knowledge and to further gather some data with common attributes into a group. In order to solve the problem that the existing algorithms always need prior knowledge, we proposed a fast searching density peak clustering algorithm based on the shared nearest neighbor and adaptive clustering center (DPC-SNNACC) algorithm. It can automatically ascertain the number of knee points in the decision graph according to the characteristics of different datasets, and further determine the number of clustering centers without human intervention. First, an improved calculation method of local density based on the symmetric distance matrix was proposed. Then, the position of knee point was obtained by calculating the change in the difference between decision values. Finally, the experimental and comparative evaluation of several datasets from diverse domains established the viability of the DPC-SNNACC algorithm.


  • Open Access

    Node Placement Optimization of Wireless Sensor Networks Using Multi-Objective Adaptive Degressive Ary Number Encoded Genetic Algorithm

    by Yijie Zhang, Mandan Liu

    The wireless sensor network (WSN) has the advantages of low cost, high monitoring accuracy, good fault tolerance, remote monitoring and convenient maintenance. It has been widely used in various fields. In the WSN, the placement of node sensors has a great impact on its coverage, energy consumption and some other factors. In order to improve the convergence speed of a node placement optimization algorithm, the encoding method is improved in this paper. The degressive ary number encoding is further extended to a multi-objective optimization problem. Furthermore, the adaptive changing rule of ary number is proposed by analyzing the experimental results of the N-ary number encoded algorithm. Then a multi-objective optimization algorithm adopting the adaptive degressive ary number encoding method has been used in optimizing the node placement in WSN. The experiments show that the proposed adaptive degressive ary number encoded algorithm can improve both the optimization effect and search efficiency when solving the node placement problem.


  • Open Access

    Regional Optimization Dynamic Algorithm for Node Placement in Wireless Sensor Networks

    by Yijie Zhang, Mandan Liu

    Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.