ChenYanru, Gao M, Zhang Z, et al. Contextual bandits learning-based branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with conflicts and time windows[J]. Transportation Research Part E: Logistics and Transportation Review, 2025, 193: 103866(ABS 3）.

Meng S, ChenYanru*, Li D. The  multi-visit drone-assisted pickup and delivery problem with time windows[J]. European Journal of Operational Research,2024, 314(2), 685-702.(ABS 4)

Meng S, Li D, Liu J, ChenYanru. The multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times[J]. Transportation Research Part B: Methodological, 2024, 190,103101.(ABS 4)

Zhu Z,ChenYanru*, Wahab M. Exact algorithm for simultaneous pickup and delivery problem with split demand and time windows [J]. Computers & Operations Research, 2024, 170: 106761.(ABS 3）

Gao M, ChenYanru*, Li J, et al. Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows[J]. Computers & Operations Research, 2023: 106267(ABS 3).

Chen Yanru, Li D, Zhang Z, et al. Solving the battery swap station location-routing problem with a mixed fleet of electric and conventional vehicles using a heuristic branch-and-price algorithm with an adaptive selection scheme[J]. Expert Systems with Applications, 2021: 115683.(ABS 3)

Chen Yanru, Yang L, Jiang Y, et al. Joint replenishment decision considering shortages, partial demand substitution, and defective items[J]. Computers & Industrial Engineering, 2019, 127: 420-435.(ABS 2)

Chen Yanru, Yi B, Jiang Y, et al. Inter-arrival time distribution of passengers at service facilities in underground subway stations: A case study of the metropolitan city of Chengdu in China[J]. Transportation Research Part A: Policy and Practice, 2018, 111: 227-251.(ABS 3)

Chen Yanru, Wahab M I M, Ongkunaruk P. A joint replenishment problem considering multiple trucks with shipment and resource constraints[J]. Computers & Operations Research, 2016,74:53-63.(ABS 3)

Chen Yanru, Jiang Yangsheng, Wahab M I M, et al. The facility layout problem in non-rectangular logistics parks with split lines[J]. Expert Systems with Applications, 2015, 42(21): 7768-7780.(ABS 3)

Ongkunaruk P, Wahab M I M, Chen Yanru. A genetic algorithm for a joint replenishment problem with resource and shipment constraints and defective items[J]. International Journal of Production Economics, 2016,(175):142–152.(ABS 3)

Hu Lu, Jiang Yangsheng, Zhu Juanxiu, Chen Yanru. A PH/PH (n)/C/C state-dependent queuing model for metro station corridor width design[J]. European Journal of Operational Research,2015,240(1):109-126(ABS 3)

 Yao F , Chen Yanru* , Huo H , et al. Online learning framework for indoor intelligent temperature controlling of air conditioning[C]// 14th International FLINS Conference (FLINS 2020). 2020.

Gong Y,  Chen Yanru*, Wang Q, et al. Deep neural network model for multi-factor indoor thermal comfort index estimation: Taking a high-speed railway station in Chengdu as an example[C]// 14th International FLINS Conference (FLINS 2020). 2020.

Hu Lu, Jiang Yangsheng, Zhu Juanxiu, Chen Yanru. Hybrid of the scatter search, improved adaptive genetic, and expectation maximization algorithms for phase-type distribution fitting[J]. Applied Mathematics and Computation, 2013, 219(10): 5495-5515(SCI)

Jiang Yangsheng, Hu Lu, Zhu Juanxiu, Chen Yanru. PH fitting of the arrival interval distribution of the passenger flow on urban rail transit stations[J]. Applied Mathematics and Computation, 2013, 225: 158-170(SCI)

李得成,陈彦如*,张宗成.基于分支定价算法的电动车与燃油车混合车辆路径问题研究[J].系统工程理论与实践,2021,41(04):995-1009.（CSSCI, EI,CSCD）.

梁爽,陈彦如*,孙智彬.基于自适应大邻域搜索算法的无人机-卡车-代收点协同配送[J].工业工程与管理,2024,29(01):119-132.DOI:10.19495/j.cnki.1007-5429.2024.01.012.

杨新彪,陈彦如*,秦娟等.基于VMD-EWT-QWLSTM-TPE深度学习模型的超短时物流需求多步预测[J].控制与决策,2024(6):1859-1868.

冉茂亮,陈彦如*,杨新彪.基于EEMD-LMD-LSTM-LEC深度学习模型的短时物流需求预测[J].控制与决策,2022(10):2513-2523.[2022-02-22].DOI:10.13195/j.kzyjc.2021.0413.（EI，CSCD)

杜千,南丽君,陈彦如*.考虑众包场景的电动车动态需求车辆路径问题[J].计算机集成制造系统,2024,30(7):2588-2607.(EI,CSCD)

南丽君,陈彦如*,张宗成.改进的自适应大规模邻域搜索算法求解动态需求的混合车辆路径问题[J].计算机应用研究,2021,38(10):2926-2934(CSCD).

孙逊,冯睿锋,陈彦如*.基于深度与实例分割融合的单目3D目标检测方法[J].计算机应用,2024,44(07):2208-2215.

陈彦如,张涂静娃,杜千等.基于深度森林的高铁站室内热舒适度等级预测[J].计算机应用,2021,41(1):258-264(CSCD).

王秋雯,陈彦如*,刘媛春.基于卷积长短时记忆神经网络的城市轨道交通短时客流预测[J].控制与决策,2021,36(11):2760-2770(EI,CSCD).

杨璐，陈彦如*，杨洁.考虑缺货和产品缺陷的联合补货模型[J].管理工程学报，2018，32(4):195-203（CSSCI,CSCD）

龙小强，李捷，陈彦如*. 基于深度学习的城市轨道交通短时客流量预测[J].控制与决策,2019,34(08):1589-1600.(EI,CSCD).

李莎, 王秋雯, 陈彦如*,等. 基于SAE-ConvLSTM深度学习模型的多站城轨短时客流预测[J].计算机应用研究,2022,39(7):2025-2031.

孙逊,冯睿锋,陈彦如*.基于深度与实例分割融合的单目3D目标检测方法[J].计算机应用, 2024, 44(7):2208-2215.

李捷, 陈彦如*, 杨璐. 基于两阶段组合预测模型的区域物流需求预测[J]. 信息与控制, 2018, 47(2):247-256.(CSCD)

陈彦如, 杨进广, 蒋阳升. 食品网购行为意愿影响的实证研究——以结构方程模型为基础.西南交通大学学报(社会科学版),2014,15(3): 115-122.

陈彦如，唐小平，肖钦心.多零售市场的闭环供应链协调研究[J]，西南交通大学学报（自然版），2011,46(2):347-353.(EI,CSCD)

Chen Yanru ,Xiao qinxin,Tang xiaoping. Product Layout Optimization and Simulation Model in a Multi-level Distribution Center，Systems Engineering Procedia[J],2011

陈彦如，彭其渊，蒋阳升. 复线列车运行调整的满意优化模型体系研究[J]. 铁道学报. 2003，25（3）：8-12.(EI,CSCD)

陈彦如，蒋阳升. 一类“供应链加盟”博弈模型[J]. 西南交通大学学报（自然科学版）.2002，37（2），218-222.(EI,CSCD)

陈彦如，蒲云. 用遗传算法解决固定需求交通平衡分配问题[J]. 西南交通大学学报（自然科学版）. 2000，35（1）：44-47.(EI,CSCD)

张仪彬，吴刚，赵佳虹，陈彦如.基于加权Voronoi图的物流园区腹地界定[J].公路交通科技.2012, 29(10).(EI,CSCD)

Chen Yanru,Jiang Yangsheng. Elevator service time distribution for the product allocation problem in a multi-level distribution center[C]，Tokyo：IEEE，2010 .

Chen Yanru,Jiang Yangsheng. Queuing model of vertical transportation during the down traffic pattern[C], Wuhan:IEEE,2010 .

Chen Yanru，Jiang Yangsheng，Hu lu. Modeling multi-level distribution center layout problem with RTT[C], American Society of Civil Engineers International ,2009Conference on Transportation Engineering. American Society of Civil Engineers.2009.

Chen Yanru，Jiang Yangsheng，Zhang jin. Study on Logistics Satisfactory Optimization Model and Algorithm for Forward-Reserve Problem(FRP) [C] . American Society of Civil Engineers.2007：339-345 .

蒋阳升，陈彦如，蒲云. 基于多代理机制的列车运行调整问题的模型与算法集成研究[J]，中国铁道科学，2005,26（1）:114-1181.(EI,CSCD)