Arrow Research search

Author name cluster

Chenchen Wu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

12 papers
1 author row

Possible papers

12

EAAI Journal 2026 Journal Article

Domain adaptation fault diagnosis method based on discriminative feature enhancement)

  • Chenhui Qian
  • Zhaojun Yang
  • Jialong He
  • Chi Ma
  • Chenchen Wu
  • Shaoyang Liu

Many unsupervised domain adaptation methods have been proposed to address the cross-domain fault diagnosis problem. However, when applied to complex mechanical equipment, these methods often fail to achieve satisfactory results, primarily due to the strong local dependency of their fault features. Local dependency makes the relationships between features more complex, leading to poor performance in handling feature differences across domains, which in turn affects the model's generalization ability and diagnostic accuracy. To address this, a domain adaptation fault diagnosis method based on discriminative feature enhancement (DADFE) is proposed. First, a contrastive mixed attention mechanism (CMA) is proposed, which calculates attention for fault features through grouped attention and incorporates contrastive learning to create a contrastive normalization layer. This improvement enhances the uniformity of the feature space and resolves the issue of feature collapse caused by insufficient constraints in the attention mechanism. Next, a multi-angle Taylor metric layer (MATM) is designed to assess feature diversity from various perspectives. The Taylor series expansion is utilized to perform nonlinear expansion on high-dimensional feature clusters, further enhancing the separability of the discriminative space. The experimental results on bearing and reducer datasets fully validate its effectiveness and advantages.

TCS Journal 2026 Journal Article

On competitive ratio for online uniform facility location problem in random-order model

  • Mengzhen Li
  • Runjie Miao
  • Chenchen Wu
  • Dachuan Xu

We study the online facility location problem, where clients arrive sequentially in a random order and must be assigned to an open facility immediately and irrevocably upon arrival. At the initial stage, the set of facilities is fully known. We present a 8-competitive online algorithm for the uniform facility cost case, providing the first competitive ratio result for this setting. Our algorithm reduces the competitive ratio by 75% compared to the previously known 33-competitive ratio for the nonuniform case. The analysis offers new theoretical insights into online algorithms for the nonuniform case and establishes a foundation for practical applications in decision-making contexts.

EAAI Journal 2025 Journal Article

Improved discrete particle swarm optimization algorithm for solving fuzzy flexible job shop machines and automated guided vehicles fusion scheduling problem

  • Rui Wu
  • Zheng Tian
  • Xixing Li
  • Chenchen Wu
  • Hongtao Tang
  • Yibing Li

Automated Guided Vehicles (AGVs) are widely used in personalized and multi-batch flexible manufacturing job shops. However, uncertainties in processing and transportation time can arise due to various factors, such as changes in production processes, variations in personnel capabilities, and equipment maintenance requirements. To address this issue, this paper introduces the use of triangular fuzzy numbers to represent the uncertainty associated with processing and transportation time. Subsequently, a fuzzy flexible job shop scheduling model considering the AGV transportation process was established, with the goal of minimizing the maximum completion time. Additionally, an improved discrete particle swarm optimization (IDPSO) algorithm is designed to solve this model. Firstly, the classical particle swarm optimization algorithm is discretized to account for the discrete nature of the problem. Secondly, different particle updating strategies are employed to adjust the exploration and exploitation capabilities of the particles. Subsequently, four neighborhood search strategies are introduced to improve the performance of local search. Finally, the comparison experiment results suggest that the proposed IDPSO has competitive performance compared to other selected efficient algorithms. Moreover, a case study based on the actual situation of an automobile equipment manufacturing enterprise demonstrates that IDPSO is an effective method to solve the proposed problem.

EAAI Journal 2024 Journal Article

A multi-domain adversarial transfer network for cross domain fault diagnosis under imbalanced data

  • Guofa Li
  • Shaoyang Liu
  • Jialong He
  • Liang Wang
  • Chenchen Wu
  • Chenhui Qian

In the intelligent fault diagnosis of rolling bearings, transfer learning methods extend the applicability of models to diverse working scenarios. However, real-world scenarios often suffer from data imbalance, which reduces diagnostic accuracy. To address this issue, this paper proposes a multi-domain adversarial transfer (MDAT) framework to enhance cross-domain fault diagnosis accuracy for rolling bearings under imbalanced data conditions. First, an enhanced information generation method is introduced to produce realistic and useable synthetic data to mitigate data imbalance. Subsequently, an adversarial multi-domain adaptation module is designed to learn invariant features across multiple domains. Finally, a domain reweighting method is proposed to improve domain alignment and enhance domain confusion. The effectiveness of the proposed method was validated through two case studies on rolling bearing fault diagnosis. The results demonstrated that MDAT achieved cross-domain diagnosis accuracies of 89. 2% and 99. 0% under imbalanced data conditions, confirming the effectiveness and superiority of the MDAT framework.

TCS Journal 2024 Journal Article

An approximation algorithm for diversity-aware fair k-supplier problem

  • Xianrun Chen
  • Sai Ji
  • Chenchen Wu
  • Yicheng Xu
  • Yang Yang

In this paper, we introduce the diversity-aware fair k-supplier problem, which involves selecting k facilities from a set F that consists of m disjoint groups, subject to a constraint on the maximum number of facilities selected from each group. The goal is to ensure fairness in the selection process and avoids any demographic group from over-representation. While the classical k-supplier problem is known to be NP-hard to solve and is even NP-hard to approximate within a factor of less than 3, we present an efficient 5-approximation algorithm for the diversity-aware k-supplier problem based on maximum matching.

EAAI Journal 2023 Journal Article

Vibration optimization of cantilevered bistable composite shells based on machine learning

  • Chenchen Wu
  • Ruming Zhang
  • Fengzhen Tang
  • Mengling Fan

Bistable composite shells with high storage efficiency have great potential applications in deployable space structures. This paper proposes a constrained vibration optimization approach for improving the bending-mode frequency of cantilevered bistable reeled composite shells (BRCS) with respect to fiber orientation angles using a machine learning (ML) method. First, the bistability and a specific coiled diameter are considered as constraints to classify the input data. The data set of the support vector regression (SVR) model is constructed based on the finite element (FE) simulation results, followed by constricted particle swarm optimization (PSO) to improve the bending-mode vibration frequency of a cantilevered BRCS. A 15. 5% improvement of the vibration frequency with respect to the benchmark is achieved at α = 59. 3 ° and β = 32. 2 °, which maintains great consistency with published results. Additionally, the optimization approach based on ML is further utilized to improve the vibration frequency of BRCS subjected to constraints of constant arc length and coiled diameter. The vibration frequency is improved by 85. 3% with respect to the benchmark shell with optimized parameters of R = 16 mm, γ = 358 °, and the stacking laminate sequence of [ 60 / 80 / 0 / − 80 / − 60 ]. Evaluation and validation analyses of the ML model demonstrate that vibration optimization using ML yields high computing efficiency and accuracy. This optimization approach has great potential in real-life engineering applications.

TCS Journal 2021 Journal Article

Approximation algorithms for the dynamic k-level facility location problems

  • Limin Wang
  • Zhao Zhang
  • Chenchen Wu
  • Dachuan Xu
  • Xiaoyan Zhang

In this paper, we first consider a dynamic k-level facility location problem, which is a generalization of the k-level facility location problem when considering time factor. We present a combinatorial primal-dual approximation algorithm for this problem which finds a constant factor approximate solution. Then, we investigative the dynamic k-level facility location problem with submodular penalties and outliers, which extend the existing problem on two fronts, namely from static to dynamic and from without penalties (outliers) to penalties (outliers) allowed. Based on primal-dual technique and the triangle inequality property, we also give two constant factor approximation algorithms for the dynamic problem with submodular penalties and outliers, respectively.

TCS Journal 2019 Journal Article

Improved approximation algorithm for universal facility location problem with linear penalties

  • Yicheng Xu
  • Dachuan Xu
  • Donglei Du
  • Chenchen Wu

The input of the universal facility location problem includes a set of clients and a set of facilities. Our goal is to find an assignment such that each client is assigned while the total connection and facility cost is minimized. Here the connection cost is proportional to the distance between each client and its assigned facility, thus metric. The facility cost is a nondecreasing function with respect to the total number of clients assigned to the facility. The universal facility location problem is NP-hard since it generalizes several classical facility location problems. Our work considers the universal facility location problem with linear penalties, a generalized version of the universal facility location problem. Here each client can be rejected for service with certain penalty cost. Thus we have to consider penalty cost other than total connection and facility cost in our objective function. Based on local search method, we present a ( 5. 83 + ϵ ) -approximation algorithm for this problem.

TCS Journal 2018 Journal Article

An approximation algorithm for the k-median problem with uniform penalties via pseudo-solution

  • Chenchen Wu
  • Donglei Du
  • Dachuan Xu

We present a ( 1 + 3 + ϵ ) -approximation algorithm for the k-median problem with uniform penalties, extending the recent result by Li and Svensson for the classical k-median problem without penalties. One important difference of this work from that of Li and Svensson is a new definition of sparse instance to exploit the combinatorial structure of our problem.

TCS Journal 2018 Journal Article

Approximation and hardness results for the Max k-Uncut problem

  • Peng Zhang
  • Chenchen Wu
  • Dachuan Xu

In the study of the homophily law of large scale complex networks, we get a combinatorial optimization problem which we call the Max k -Uncut problem. Given an n-vertex undirected graph G = ( V, E ) with nonnegative weights { w e | e ∈ E } defined on edges, and a positive integer k, the Max k -Uncut problem asks to find a partition { V 1, V 2, ⋯, V k } of V such that the total weight of edges that are not cut is maximized. Intuitively, an edge that is not cut connects two vertices with the same or similar attributes since they are in the same part of the partition. Interestingly, the Max k -Uncut problem is just the complement of the classic Min k -Cut problem. For Max k -Uncut, we present a randomized ( 1 − k n ) 2 -approximation algorithm, a greedy ( 1 − 2 ( k − 1 ) n ) -approximation algorithm, and an Ω ( 1 2 α ) -approximation algorithm by reducing it to Densest k -Subgraph, where α is the approximation ratio of the Densest k -Subgraph problem. More importantly, we show that Max k -Uncut and Densest k -Subgraph are in fact equivalent in approximability up to a factor of 2. We also prove an approximation hardness result for Max k -Uncut under the assumption P ≠ NP.

TCS Journal 2016 Journal Article

Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique

  • Dachuan Xu
  • Fengmin Wang
  • Donglei Du
  • Chenchen Wu

The notion of penalty has been introduced into many combinatorial optimization models. In this paper, we consider the submodular vertex cover problems with linear and submodular penalties, which are two variants of the submodular vertex cover problem where not all the edges are required to be covered by a vertex cover, and the uncovered edges are penalized. The problem is to determine a vertex subset to cover some edges and penalize the uncovered edges such that the total cost including covering and penalty is minimized. To overcome the difficulty of implementing the primal-dual framework directly, we relax the two dual programs to slightly weaker versions. We then present two primal-dual approximation algorithms with approximation ratios of 2 and 4, respectively.

TCS Journal 2015 Journal Article

Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach

  • Chenchen Wu
  • Donglei Du
  • Dachuan Xu

The main contribution of this work is to propose a primal–dual combinatorial 3 ( 1 + ε ) -approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel facility location problem, and also matches the previous primal–dual approximation ratio for the single-level facility location problem. One of the major merits of primal–dual type algorithms is their easy adaption to other variants of the facility location problems. As a demonstration, our primal–dual approximation algorithm can be easily adapted to several variants of the 2-LFLP, including models with stochastic scenario, dynamically arrived demands, and linear facility cost.

v2026.09.13