JDJicong Duan

Jicong Duan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jicong Duan has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Energy-Aware Time-Dependent Routing of Electric Vehicles for Multi-Depot Pickup and Delivery with Time Windows

    by Ying Wang, Qiang Li, Jicong Duan, Qin Zhang, Yu Ding

    The rapid expansion of e-commerce and on-demand logistics has intensified the need for cost-effective and reliable urban distribution systems. This paper investigates an energy-aware routing problem for electric vehicle fleets operating from multiple depots under time-varying traffic conditions. We propose a novel multi-depot vehicle routing model that jointly incorporates time-dependent travel speeds, simultaneous pickup and delivery operations, and time window constraints. The model explicitly captures key operational realities, including battery capacity limitations, load- and speed-dependent energy consumption, synchronized pickup-delivery requirements, and soft time windows. The objective is to minimize total operational cost by simultaneously optimizing depot assignments, vehicle routes, and service schedules. Given the NP-hard nature of the problem, we develop a two-stage heuristic solution framework. In the first stage, a spatio-temporal clustering strategy is employed to assign customers to depots efficiently. In the second stage, route construction and improvement are performed using an enhanced Adaptive Large Neighborhood Search (ALNS) algorithm equipped with problem-specific destroy and repair operators. Computational experiments on adapted benchmark instances demonstrate that the proposed approach consistently produces high-quality solutions and exhibits robust convergence behavior. In addition, sensitivity analyses provide managerial insights, revealing an optimal range of vehicle energy capacity and an economically efficient speed band that balances travel time and energy consumption.


  • Open Access

    CS-MLAkNN: A Cost-Sensitive Adaptive k-Nearest Neighbors Algorithm for Imbalanced Multi-Label Learning

    by Zhengyao Shen, Jicong Duan, Ying Wang, Hualong Yu

    Multi-label data usually carries a complex structural class imbalance, which significantly affects the overall predictive performance of multi-label learning models. Although many studies have investigated this problem, most existing methods rely on resampling, static cost weighting, or ensemble learning. Few studies simultaneously consider cost information and neighborhood size within the local statistical model of ML-kNN. To address this issue, this paper proposes a cost-sensitive adaptive k-nearest neighbors algorithm, named CS-MLAkNN, for imbalanced multi-label learning. The algorithm implements a dual cost-sensitive strategy at both the feature and label levels within the ML-kNN framework. Specifically, feature-level cost sensitivity is achieved through distance weighting during the training phase. In the prediction phase, label distribution information is incorporated into the posterior probability calculation to achieve label-level cost sensitivity. Moreover, the optimal number of neighbors (k) is determined adaptively through cross-validation. CS-MLAkNN maintains the simplicity and interpretability of the original ML-kNN, and meanwhile it explicitly introduces cost sensitivity and adaptiveness into three key steps: distance metric, posterior decision, and neighbor determination. Experimental results on 14 benchmark datasets demonstrate that the proposed method achieves optimal or near-optimal performance across various evaluation metrics. It also shows significant advantages over other state-of-the-art imbalanced multi-label learning algorithms.

  • Open Access

    A Three-Phase Heuristic for Optimizing Truck-Drone Collaborative Delivery

    by Ying Wang, Jicong Duan, Qin Zhang, Yu Ding

    Truck-drone collaborative delivery has attracted increasing attention as an effective means to enhance flexibility and efficiency in complex distribution systems. However, the resulting Vehicle Routing Problem with Drones (VRPD) is NP-hard, and existing heuristics often struggle to balance solution quality and computational efficiency, especially in large-scale and multi-trip settings. To address these challenges, this paper proposes a Structure-Guided Adaptive Large Neighborhood Search (S-ALNS) framework for truck-drone collaborative routing. The proposed approach explicitly exploits problem-specific structural characteristics through a three-phase solution process. First, balanced initial truck routes are constructed using customer clustering. Second, a structured split-based heuristic reallocates suitable customers from truck routes to a drone service. Third, the solution is further refined within an improved ALNS framework, where a structure-guided repair mechanism based on dynamic programming is introduced to efficiently handle batch customer insertions under coupled capacity and feasibility constraints. Extensive computational experiments on instances of varying scales show that S-ALNS consistently produces near-optimal solutions for small-scale instances used for validation. For medium- and large-scale instances, S-ALNS significantly outperforms classical heuristics, including simulated annealing and a standard ALNS baseline, in terms of solution quality while maintaining competitive in computational efficiency. These results demonstrate the effectiveness of incorporating the problem structure into Adaptive Large Neighborhood Searches for complex truck-drone routing problems.


  • Open Access

    PHASE: Progressive Hierarchical Adaptation for Sample-Efficient Rebalancing in Long-Tail Classification

    by Jiale Li, Jicong Duan, Changbin Shao, Hualong Yu

    When trained on long-tailed distributions, deep neural networks often suffer performance degradation and model bias due to the dominance of head classes. Existing reweighting and sampling strategies have significant limitations, such as reliance on fixed heuristics and inability to adapt to dynamic sample difficulty and class imbalance. Additionally, they fail to integrate sample-level granularity with class-level balance, further inadequately addressing the global imbalance issue. Motivated by these challenges, we introduce the Progressive Hierarchical Adaptation for Sample-Efficient rebalancing (PHASE) training framework, which employs a double-layer tuning paradigm to optimize performance under long-tailed distributions. Specifically, the double-layer tuning paradigm adopted by PHASE runs as follows: (1) an early-stage difficulty-aware mechanism targets those difficult-to-classify samples to guide representation learning; and (2) a later-stage multi-scale reweighting strategy integrates class distribution statistics with sample characteristics. This method ensures fine-grained adaptability and global balance, and thus outperforming those static or localized techniques. Extensive experiments on CIFAR10-LT, CIFAR100-LT, and ImageNet-LT datasets demonstrate that PHASE can significantly improve the accuracy of tail classes without degenerating head class performance, and acquire state-of-the-art classification results. PHASE provides a novel paradigm for long-tailed image recognition.


  • Open Access

    A Green Vehicle Routing Problem with Time-Varying Speeds and Joint Distribution

    by Ying Wang, Jicong Duan, Jiajun Sun, Qin Zhang, Taofeng Ye

    With the rapid growth of urban logistics demand, carbon emissions and the time-varying nature of vehicle speeds have become critical challenges in sustainable transportation planning. This paper addresses a Time-Dependent Green Vehicle Routing Problem (TDGVRP) that integrates time-varying speeds, carbon emissions, and cold chain logistics under a joint distribution framework involving multiple depots and homogeneous refrigerated vehicles. A Mixed-Integer Linear Programming (MILP) model is developed, explicitly considering carbon pricing, refrigeration energy consumption, and speed variations across different time periods. To efficiently solve large-scale instances, a Three-Phase Heuristic (TPH) algorithm is proposed, combining spatiotemporal path construction, local-improvement strategies, and an Adaptive Large Neighborhood Search (ALNS) mechanism. Computational experiments show that the proposed method outperforms traditional Genetic Algorithms (GAs) in both solution quality and computation time, and in some benchmark cases even achieves better results than the commercial solver Gurobi, demonstrating its robustness and scalability. Using real-world traffic speed data, comparative analysis reveals that the joint distribution strategy reduces total logistics costs by 14.40%, carbon emission costs by 23.12%, and fleet size by approximately 25% compared to single-entity distribution. The findings provide a practical and scalable solution framework for sustainable cold chain logistics routing in time-dependent urban road networks.


  • Open Access

    MvAl-MFP: A Multi-Label Classification Method on the Functions of Peptides with Multi-View Active Learning

    by Yuxuan Peng, Jicong Duan, Yuanyuan Dan, Hualong Yu

    The rapid expansion of peptide libraries and the increasing functional diversity of peptides have highlighted the significance of predicting the multifunctional properties of peptides in bioinformatics research. Although supervised learning methods have made advancements, they typically necessitate substantial amounts of labeled data for yielding accurate prediction. This study presents MvAl-MFP, a multi-label active learning approach that incorporates multiple feature views of peptides. This method takes advantage of the natural properties of multi-view representation for amino acid sequences, meets the requirement of the query-by-committee (QBC) active learning paradigm, and further significantly diminishes the requirement for labeled samples while training high-performing models. First, MvAl-MFP generates nine distinct feature views for a few labeled peptide amino acid sequences by considering various peptide characteristics, including amino acid composition, physicochemical properties, evolutionary information, etc. Then, on each independent view, a multi-label classifier is trained based on the labeled samples. Next, a QBC strategy based on the average entropy of predictions across all trained classifiers is adopted to select a specific number of most valuable unlabeled samples to submit them to human experts for labeling by wet-lab experiments. Finally, the aforementioned procedure is iteratively conducted with a constantly expanding labeled set and updating classifiers until it meets the default stopping criterion. The experiments are conducted on a dataset of multifunctional therapeutic peptides annotated with eight functional labels, including anti-bacterial properties, anti-inflammatory properties, anti-cancer properties, etc. The results clearly demonstrate the superiority of the proposed MvAl-MFP method, as it can rapidly improve prediction performance while only labeling a small number of samples. It provides an effective tool for more precise multifunctional peptide prediction while lowering the cost of wet-lab experiments.


  • Open Access

    OMAL: A Multi-Label Active Learning Approach from Data Streams

    by Qiao Fang, Chen Xiang, Jicong Duan, Benallal Soufiyan, Changbin Shao, Xibei Yang, Sen Xu, Hualong Yu

    With the rapid growth of digital computing, communication, and storage devices applied in various real-world scenarios, more and more data have been collected and stored to drive the development of machine learning techniques. It is also noted that the data that emerge in real-world applications tend to become more complex. In this study, we regard a complex data type, i.e., multi-label data, acquired with a time constraint in a dynamic online scenario. Under such conditions, constructing a learning model has to face two challenges: it requires dynamically adapting the variances in label correlations and imbalanced data distributions and it requires more labeling consumptions. To solve these two issues, we propose a novel online multi-label active learning (OMAL) algorithm that considers simultaneously adopting uncertainty (using the average entropy of prediction probabilities) and diversity (using the average cosine distance between feature vectors) as an active query strategy. Specifically, to focus on label correlations, we use a classifier chain (CC) as the multi-label learning model and design a label co-occurrence ranking strategy to arrange label sequence in CC. To adapt the naturally imbalanced distribution of the multi-label data, we select weight extreme learning machine (WELM) as the basic binary-class classifier in CC. The experimental results on ten benchmark multi-label datasets that were transformed into streams show that our proposed method is superior to several popular static multi-label active learning algorithms in terms of both the Macro-F1 and Micro-F1 metrics, indicating its specifical adaptions in the dynamic data stream environment.