Chung-Cheng Lu
Research Subjects
Chung-Cheng Lu has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Kuo-Ching Ying
Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan
16 shared publications - Shih-Wei Lin
Department of Information Management, Chang Gung University, Taoyuan, Taiwan
14 shared publications Hani S. Mahmassani
8 shared publicationsXuesong Zhou
7 shared publications- Kuilin Zhang
Department of Civil, Environmental, and Geospatial Engineering, Michigan Technological University, Houghton, MI
5 shared publications Shangyao Yan
National Central Univ
5 shared publications
Latest Publications
- Open Access
- 22 September 2026
- Published by Elsevier in Journal of Public Transportation
- Vol. 28
Optimizing urban bus operations during fleet electrification: A mixed fleet scheduling model with a column generation algorithm
- 22 September 2026
- Published by Elsevier in Journal of Public Transportation
- Vol. 28
Open AccessOptimizing urban bus operations during fleet electrification: A mixed fleet scheduling model with a column generation algorithm
- 15 September 2026
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 217
Deep reinforcement learning for electric bus scheduling: scalability and operational insights
- 15 September 2026
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 217
Deep reinforcement learning for electric bus scheduling: scalability and operational insights
- Open Access
- 1 April 2026
- Published by Springer Nature in International Journal of Intelligent Transportation Systems Research
- Vol. 24 (2) , 1110-1129
Solving the Life Detector Routing Problem over a Street Network: A Multi-Start-based Approach
Life detectors were successfully used in the search-and-rescue actions after several major earthquakes around the world. To efficiently find buried victims after massive earthquakes in urban areas, emergency response agencies need to design the least-distance tour for life detectors to visit collapsed buildings and find trapped people. The life detector routing problem (LDRP) aims to find the least-distance tour for a life detector to scan a set of collapsed buildings in an urban street network. This study develops two algorithmic frameworks to solve large-scale problem instances of the LDRP, namely the double-loop-based method and the multi-start-based method. To evaluate the performance of these methods, three meta-heuristics are incorporated in the proposed frameworks, including simulated annealing, Tabu search, and iterated greedy algorithms. The algorithms are evaluated using test instances that are generated based on real-world urban street networks. The computational results show that the proposed frameworks are more effective than a classical two-stage heuristic for solving the test instances of the LDRP. The results also indicate that, with similar computational efforts, the multi-start-based method outperforms the double-loop-based method. Moreover, the average total distance for visiting all of the collapsed buildings decreases with the increase in the detection radius. The findings and the results provide a valuable reference to emergency response agencies in the search-and-rescue actions after massive earthquakes.
- 1 April 2026
- Published by Springer Nature in International Journal of Intelligent Transportation Systems Research
- Vol. 24 (2) , 1110-1129
Open AccessSolving the Life Detector Routing Problem over a Street Network: A Multi-Start-based Approach
Life detectors were successfully used in the search-and-rescue actions after several major earthquakes around the world. To efficiently find buried victims after massive earthquakes in urban areas, emergency response agencies need to design the least-distance tour for life detectors to visit collapsed buildings and find trapped people. The life detector routing problem (LDRP) aims to find the least-distance tour for a life detector to scan a set of collapsed buildings in an urban street network. This study develops two algorithmic frameworks to solve large-scale problem instances of the LDRP, namely the double-loop-based method and the multi-start-based method. To evaluate the performance of these methods, three meta-heuristics are incorporated in the proposed frameworks, including simulated annealing, Tabu search, and iterated greedy algorithms. The algorithms are evaluated using test instances that are generated based on real-world urban street networks. The computational results show that the proposed frameworks are more effective than a classical two-stage heuristic for solving the test instances of the LDRP. The results also indicate that, with similar computational efforts, the multi-start-based method outperforms the double-loop-based method. Moreover, the average total distance for visiting all of the collapsed buildings decreases with the increase in the detection radius. The findings and the results provide a valuable reference to emergency response agencies in the search-and-rescue actions after massive earthquakes.
- Open Access
- 3 October 2025
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 26 (1) , 239-258
Public Charging Facility Location Modeling with Route Choice Behavior of Multiple User Classes
Ready access to charging facilities is essential if universal use of electric vehicles (EVs) is to be achieved. Hence, governments and EV manufacturers worldwide are actively planning ways to expand EV charging infrastructure. Until full electrification of vehicles takes place, EVs and gasoline vehicles (GVs) will exist on the same road networks, so to effect change it is necessary to consider the route choice behavior of these different user classes. This study develops an optimization model for this public charging station location problem from the governmental perspective. The proposed model adopts a demand-based optimization approach to study the impact of charging station location and route costs on users’ route choice behavior. To explicitly address path overlapping among path alternatives, the C-Logit model is used for determination of route choice probabilities. The proposed model is a mixed-integer nonlinear programming (MINLP) model. As optimal solutions to this model with the optimization software, BARON requires prohibitive amounts of time with large problem sizes, a column generation-based heuristic is proposed and its performance evaluated on the Nguyen-Dupuis, Sioux-Falls, and Fort Worth networks. The results show that for the Nguyen-Dupuis network, the heuristic obtains the same solution as BARON within a similar timeframe, while for the Sioux-Falls and Fort Worth networks, the heuristic achieves a higher-quality solution in a shorter computation time. Sensitivity analysis was also conducted to study the impact of the parameters on solutions. The findings of this study will serve as a reference for governmental decision-making regarding the determination of public charging station locations.
- 3 October 2025
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 26 (1) , 239-258
Open AccessPublic Charging Facility Location Modeling with Route Choice Behavior of Multiple User Classes
Ready access to charging facilities is essential if universal use of electric vehicles (EVs) is to be achieved. Hence, governments and EV manufacturers worldwide are actively planning ways to expand EV charging infrastructure. Until full electrification of vehicles takes place, EVs and gasoline vehicles (GVs) will exist on the same road networks, so to effect change it is necessary to consider the route choice behavior of these different user classes. This study develops an optimization model for this public charging station location problem from the governmental perspective. The proposed model adopts a demand-based optimization approach to study the impact of charging station location and route costs on users’ route choice behavior. To explicitly address path overlapping among path alternatives, the C-Logit model is used for determination of route choice probabilities. The proposed model is a mixed-integer nonlinear programming (MINLP) model. As optimal solutions to this model with the optimization software, BARON requires prohibitive amounts of time with large problem sizes, a column generation-based heuristic is proposed and its performance evaluated on the Nguyen-Dupuis, Sioux-Falls, and Fort Worth networks. The results show that for the Nguyen-Dupuis network, the heuristic obtains the same solution as BARON within a similar timeframe, while for the Sioux-Falls and Fort Worth networks, the heuristic achieves a higher-quality solution in a shorter computation time. Sensitivity analysis was also conducted to study the impact of the parameters on solutions. The findings of this study will serve as a reference for governmental decision-making regarding the determination of public charging station locations.
- 25 September 2025
- Published by Elsevier in Travel Behaviour and Society
- Vol. 42
Bus drivers’ intention to accept level 4 autonomous buses in ethical dilemmas: An extended technology acceptance model
- 25 September 2025
- Published by Elsevier in Travel Behaviour and Society
- Vol. 42
Bus drivers’ intention to accept level 4 autonomous buses in ethical dilemmas: An extended technology acceptance model
- 2 January 2025
- Published by Elsevier in Transport Policy
- Vol. 162, 533-544
Investigating users’ intention to re-use shared electric scooters through a combined behavioral model
- 2 January 2025
- Published by Elsevier in Transport Policy
- Vol. 162, 533-544
Investigating users’ intention to re-use shared electric scooters through a combined behavioral model
- 4 September 2024
- Published by Taylor & Francis in Transportation Planning and Technology
- Vol. 48 (6) , 1147-1165
Estimating the willingness-to-pay of local residents and tourists for volunteer-model shared demand responsive transit services
- 4 September 2024
- Published by Taylor & Francis in Transportation Planning and Technology
- Vol. 48 (6) , 1147-1165
Estimating the willingness-to-pay of local residents and tourists for volunteer-model shared demand responsive transit services