北京交通大学学报2026，Vol.50Issue(3)：63-72,10.DOI:10.11860/j.issn.1673-0291.20250139
基于聚类算法的高铁旅客市场细分方法研究
Research on market segmentation method for high-speed rail passengers based on clustering algorithm
摘要
Abstract
To address the instability and difficulty in effectively extracting characteristic differences among passenger groups when applying traditional clustering algorithms to high-speed rail passenger market segmentation,this study proposes a K-Means-Adaptive Learning Particle Swarm Optimiza-tion(KM-ALPSO)algorithm based on the Halton sequence.This algorithm is applied to segment the high-speed rail passenger market using ticket data from the Beijing-Shanghai high-speed railway.First,considering passenger age,advance booking time,and departure period as feature variables,the Affinity Propagation(AP)algorithm is adopted to identify representative sample points within the dataset.Second,an initial particle swarm is generated based on the Halton sequence,and the KM-ALPSO algorithm is used to cluster the representative sample points.A comparative analysis is then conducted against the classic K-Means algorithm and the K-Means-Particle Swarm Optimization(KM-PSO)algorithm.The Silhouette Coefficient(SC),Davies-Bouldin(DB)index,and Calinski-Harabasz(CH)index are selected to evaluate the clustering performance and determine the optimal number of clusters.Finally,the characteristic differences among various passenger groups are ana-lyzed,and the Frequent Pattern-Growth(FP-Growth)algorithm is employed to extract strong associa-tion rules.The results indicate that preprocessing with the AP algorithm reduces the runtime of the Halton sequence-based KM-ALPSO algorithm to 23.26%of its original duration while maintaining evaluation metrics comparable to those obtained without preprocessing.Furthermore,initializing par-ticle swarm positions with the Halton sequence enhances the global search capability of the KM-ALPSO algorithm.In the analysis of ticket data,the Halton sequence-based KM-ALPSO algorithm achieves an SC of 0.332,a DB of 0.933,and a CH of 708.5,demonstrating that a cluster number of five yields optimal performance and outperforms the baseline algorithms.The five identified passenger groups exhibit significant differences in age,advance booking time,and departure period,revealing distinct travel planning tendencies and departure time preferences.关键词
铁路运输/市场细分/聚类算法/高铁旅客/强关联规则Key words
railway transportation/market segmentation/clustering algorithm/high-speed rail passen-gers/strong association rules分类
交通工程引用本文复制引用
范家乐,景云,徐彦..基于聚类算法的高铁旅客市场细分方法研究[J].北京交通大学学报,2026,50(3):63-72,10.基金项目
国家自然科学基金(52372300) National Natural Science Foundation of China(52372300) （52372300）
