CCChongshuang Chen

Chongshuang Chen

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chongshuang Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:

  • Da Yang

    School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, China

    1 shared publication
  • Jiayin Tang

    Department of Statistics, School of Mathematics, Southwest Jiaotong University, Chengdu 611756, China

    1 shared publication
  • Jun Zhao

    School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 611756, China

    1 shared publication
  • Lei Huang

    Department of Statistics, School of Mathematics Southwest Jiaotong University Chengdu China

    1 shared publication
  • Xi Zhang

    School of Transportation, Chongqing Jiaotong University, Chongqing, China

    1 shared publication
  • Xinpeng Zhao

    School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, China

    1 shared publication

Latest Publications

  • Open Access

    Joint optimization of train blocking and shipment path:An integrated model and a sequential algorithm

    by Chongshuang Chen, Jun Zhao

    The INFORMS RAS 2019 Problem Solving Competition is focused on the integrated train blocking and shipment path (TBSP) optimization for tonnage-based operating railways. In nature, the TBSP problem could be viewed as a multi-commodity network design problem with a double-layer network structure. By introducing a directed physical railway network and a directed train services (blocks) network, we formulate completely the TBSP problem as a mixed integer linear programming (MILP) model that incorporates all decisions, objectives and constraints especially the merge flow (called intree rule here) in an integrated manner. The scale of the MILP model can be reduced efficiently if we only enumerate the arc selection and block sequence variables for each shipment on the legal paths from its origin to its destination satisfying the given detour ratio. We further develop a sequential algorithm that decomposes the TBSP problem into the shipment path subproblem and train blocking subproblem which are solved sequentially. Computational tests on the three given data sets show that the reduced MILP model can solve DataSet\_1 to optimality in 8.48 seconds and DataSet\_2 with a gap of 0.16\% in 6 hours on a GPU workstation. The reduced model also can provide strong lower bounds for DataSet\_2 and DataSet\_3. The sequential algorithm can find a high quality solution with 0.04\% gap within 0.26 seconds for DataSet\_1, 0.42\% gap within 4.53 seconds for DataSet\_2 and 1.54\% gap within 0.58 hours for DataSet\_3 respectively on a Thinkpad laptop.

  • Reliability assessment models for dependent competing failure processes considering correlations between random shocks and degradations

    by Jiayin Tang, Chongshuang Chen, Lei Huang

    This article develops reliability models for systems subject to two dependent competing failure processes, considering the correlation between additional damage size on degradation in soft failure process and stress magnitude of shock load in hard failure process, both of which are caused by the samekth random shock. The generalized correlative reliability assessment model based on copulas is proposed, which is then extended to three different shock patterns: (1)δ‐shock, (2)m‐shock, and (3)m‐run shocks. There are some statistical works to be introduced in reliability modeling, including data separation of total degradation amount, inferring the distribution of amount of aging continuous degradation at timet, and fitting copula to the specific correlation. The developed reliability models are demonstrated for an application example of a micro‐electro‐mechanical system.


  • Open Access

    Study on the Day-Based Work Zone Scheduling Problem in Urban Road Networks Based on the Day-to-Day Traffic Assignment Model

    by Da Yang, Xinpeng Zhao, Yuting Chen, Xi Zhang, Chongshuang Chen

    Many work zones exist in the urban road network and have a great negative impact on city traffic. Finding the optimal work zone schedule can minimize the negative impact of work zones on traffic. This paper focuses on the day-based work zone scheduling problem in the urban network. Existing studies on the day-based work zone scheduling problem do not consider the progression of day-to-day traffic from a non-equilibrium state to an equilibrium state during the construction period. For the first time, this paper proposes a model for day-based work zone scheduling by introducing a day-to-day traffic assignment model, in which the target of the optimization problem is minimizing the increase in travel cost caused by work zones. Numerical examples are presented to explore the variations of the optimal construction sequence for different work durations, crew numbers, and model parameter values. Some new findings are obtained in the paper. When the construction duration of each work zone is relatively short (for example, less than 20 days), the optimal scheduling will obviously change with the work duration; when all of the construction durations increase to a threshold (for example, 60 days), the optimal construction sequence will no longer change. An optimal crew number exists that can minimize the increment of travel cost caused by work zones. During the construction period, the total travel cost in the network can be decreased by guiding travelers to change their original travel habits.