Dong Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Dong Li has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Changqing Liu
School of Mechanical Science and Engineering, Huazhong University of Science and Technology , Wuhan 430074
3 shared publications - Paul P. Conway
Multifunctional Materials Lab, Wolfson School Loughborough University Leics LE11 3TU UK
3 shared publications - Yanru Chen
Southwest Jiaotong University
3 shared publications - Kevin D. Glazebrook
Department of Management Science, Lancaster University, Lancaster LA1 4YX, United Kingdom
2 shared publications - Shanshan Meng2 shared publications
- Xiuping Guo
School of Economics and Management, Southwest Jiaotong University, Chengdu, China
2 shared publications
Latest Publications
- 29 January 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 310
An integrated data-driven-simulation-optimization model: insights into controlling invasive plants in China
- 29 January 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 310
An integrated data-driven-simulation-optimization model: insights into controlling invasive plants in China
- 7 October 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 180
Pickup and delivery problem with multi-visit drones considering soft time windows
- 7 October 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 180
Pickup and delivery problem with multi-visit drones considering soft time windows
- Open Access
- 22 July 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (2) , 515-539
Index policies for campaign promotion strategies in reward-based crowdfunding
- 22 July 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (2) , 515-539
Open AccessIndex policies for campaign promotion strategies in reward-based crowdfunding
- Top Cited Papers
- 23 October 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 190
The multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times
- 23 October 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 190
Top Cited PapersThe multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times
- Top Cited Papers
- 18 October 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 314 (2) , 685-702
The multi-visit drone-assisted pickup and delivery problem with time windows
- 18 October 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 314 (2) , 685-702
Top Cited PapersThe multi-visit drone-assisted pickup and delivery problem with time windows
- Open Access
- 1 January 2023
- Published by SAGE Publications in Production and Operations Management
- Vol. 32 (1) , 261-282
Bid price controls for car rental network revenue management
We consider a car rental network revenue management (RM) problem, accounting for the key operational characteristics of car rental services such as the varying length of rentals and mobility of inventories, which imply the intertemporal and spatial correlations of rental demands for inventories across different locations and days. The problem is formulated as an infinite‐horizon cyclic stochastic dynamic program to account for the time‐varying and cyclic nature of car rental businesses. To tackle the curse of dimensionality , we propose a Lagrangian relaxation (LR) approach with product‐ and time‐dependent Lagrangian multipliers to decomposing the dynamic network problem into multiple single‐station single‐day subproblems. We show that the Lagrangian dual problem is a convex program and then develop a subgradient‐based algorithm to solve the dual problem and derive an LR‐based bid price policy. To improve the scalability of the LR approach, we further propose three simpler LR‐based bid price policy variants with either location‐dependent or leadtime‐dependent Lagrangian multipliers, or both. Our numerical study indicates that the LR‐based bid price policies can outperform some commonly used heuristics. Using a set of real‐world booking data, we provide a case study in which we empirically demonstrate the operational characteristics of car rental services, calibrate the arrival process of booking requests using a Poisson regression model, and demonstrate that the LR‐based bid price policies indeed outperform other heuristics consistently in both in‐sample and out‐of‐sample horizons.
- 1 January 2023
- Published by SAGE Publications in Production and Operations Management
- Vol. 32 (1) , 261-282
Open AccessBid price controls for car rental network revenue management
We consider a car rental network revenue management (RM) problem, accounting for the key operational characteristics of car rental services such as the varying length of rentals and mobility of inventories, which imply the intertemporal and spatial correlations of rental demands for inventories across different locations and days. The problem is formulated as an infinite‐horizon cyclic stochastic dynamic program to account for the time‐varying and cyclic nature of car rental businesses. To tackle the curse of dimensionality , we propose a Lagrangian relaxation (LR) approach with product‐ and time‐dependent Lagrangian multipliers to decomposing the dynamic network problem into multiple single‐station single‐day subproblems. We show that the Lagrangian dual problem is a convex program and then develop a subgradient‐based algorithm to solve the dual problem and derive an LR‐based bid price policy. To improve the scalability of the LR approach, we further propose three simpler LR‐based bid price policy variants with either location‐dependent or leadtime‐dependent Lagrangian multipliers, or both. Our numerical study indicates that the LR‐based bid price policies can outperform some commonly used heuristics. Using a set of real‐world booking data, we provide a case study in which we empirically demonstrate the operational characteristics of car rental services, calibrate the arrival process of booking requests using a Poisson regression model, and demonstrate that the LR‐based bid price policies indeed outperform other heuristics consistently in both in‐sample and out‐of‐sample horizons.
- 1 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 478-483
Estimation of Employee Trust in Management and Multi-Agent Model for Analyzing Employee Morale during Organizational Change
Morale issues are considered to be a major factor in preventing realization of organizational change. Employee’s morale during the organization change is known to depend upon trust in their management. Our previous study has provided a procedure for estimating the employees’ trust in their management and developed a multi-agent simulation model to demonstrate the change of the employees" states. This study modifies the model for estimating trust so that trust can be estimated with fewer independent variables and the prediction accuracy can be improved, which can also simplify the multi-agent simulation model. Simulation experiments are presented to analyze the relationship between the employees’ trust and the change of morale.
- 1 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 478-483
Estimation of Employee Trust in Management and Multi-Agent Model for Analyzing Employee Morale during Organizational Change
Morale issues are considered to be a major factor in preventing realization of organizational change. Employee’s morale during the organization change is known to depend upon trust in their management. Our previous study has provided a procedure for estimating the employees’ trust in their management and developed a multi-agent simulation model to demonstrate the change of the employees" states. This study modifies the model for estimating trust so that trust can be estimated with fewer independent variables and the prediction accuracy can be improved, which can also simplify the multi-agent simulation model. Simulation experiments are presented to analyze the relationship between the employees’ trust and the change of morale.
- Open Access
- 27 October 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 332 (1-3) , 1249
Correction to: A dynamic programming approach to a multi-objective disassembly line balancing problem
- 27 October 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 332 (1-3) , 1249
Open AccessCorrection to: A dynamic programming approach to a multi-objective disassembly line balancing problem
- 19 September 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 311 (2) , 921-944
A dynamic programming approach to a multi-objective disassembly line balancing problem
- 19 September 2020
- Published by Springer Nature in Annals of Operations Research
- Vol. 311 (2) , 921-944
A dynamic programming approach to a multi-objective disassembly line balancing problem