Chengxuan Cao

Prof. Chengxuan Cao

Beijing Jiaotong University

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 June 2016 in Engineering Optimization
Verified
Journal Article
Closed access
WTWenli Tian
Wenli Tian
CCChengxuan Cao
Chengxuan Cao
A generalized interval fuzzy mixed integer programming model is proposed for the multimodal freight transportation problem under uncertainty, in which the optimal mode of transport and the optimal amount of each type of freight transported through each path need to be decided. For practical purposes, three mathematical methods, i.e. the interval ranking method, fuzzy linear programming method and linear weighted summation method, are applied to obtain equivalents of constraints and parameters, and then a fuzzy expected value model is presented. A heuristic algorithm based on a greedy criterion and the linear relaxation algorithm are designed to solve the model.

1 January 2015 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YXYan Xu
Yan Xu
CCChengxuan Cao
Chengxuan Cao
BJBin Jia
Bin Jia
GZGuangzhi Zang
Guangzhi Zang
This paper aims to investigate container allocation problem with random freight demands in synchromodal transportation network from container carriers’ perspective. Firstly, the problem is formulated as a stochastic integer programming model where the overall objective is to determine a container capacity allocation plan at operational level, so that the expected total transportation profit is maximized. Furthermore, by integrating simulated annealing with genetic algorithm, a problem-oriented hybrid algorithm with a novel gene encode method is designed to solve the optimization model. Some numerical experiments are carried out to demonstrate the effectiveness and efficiency of the proposed model and algorithm.

1 March 2022 in International Journal of Production Research
Verified
Journal Article
Closed access
ZFZiyan Feng
Ziyan Feng
CCChengxuan Cao
Chengxuan Cao
AMAlireza Mostafizi
Alireza Mostafizi
Haizhong WangHaizhong Wang
Haizhong Wang
XCXiming Chang
Ximing Chang

3 October 2018 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
ZFZiyan Feng
Ziyan Feng
CCChengxuan Cao
Chengxuan Cao
YLYutong Liu
Yutong Liu
YZYaling Zhou
Yaling Zhou
This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers’ transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains’ departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.

2 December 2020 in Engineering Optimization
Verified
Journal Article
Closed access
LXLi Xie
Li Xie
CCChengxuan Cao
Chengxuan Cao
In this article, the multi-modal and multi-route transportation problem for hazardous materials under uncertainty is studied, and an interval 0–1 integer programming model is proposed to optimize the transportation risks and transportation costs during the transportation of hazardous materials. Factors such as freight rates and loading and unloading costs are different when the transportation modes, transportation time and transportation areas are different. Therefore, some parameters in the model are assumed as interval numbers. The proposed model is transformed to a deterministic model by the interval ranking method. In addition, a genetic algorithm is proposed to solve the model. Finally, a real-world case of the multi-modal and multi-route transportation problem for hazardous materials under uncertainty is studied to demonstrate the rationality and effectiveness of proposed model and algorithm.

29 October 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YZYaling Zhou
Yaling Zhou
CCChengxuan Cao
Chengxuan Cao
ZFZiyan Feng
Ziyan Feng
In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented to signify the modal interactions. Then, the generalized cost formulas of each type of links in the super network are defined. And based on the above formulas a bi-objective programming model is proposed to minimize the network operation cost and construction cost with traffic flow equilibrium constraints, investment constraints and expansion constraints. Moreover, a hybrid heuristic algorithm that combines the minimum cost flow algorithm and simulated annealing algorithm is presented to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is evaluated through two numerical tests: a simple test network and an actual multimodal transport network.