Zhenzhen Zhang
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
Research Subjects
Zhenzhen Zhang has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Andrew Lim
Institute of Operations Research and Analytics, National University of Singapore, Singapore 119245; and Department of Analytics and Operations, National University of Singapore, Singapore 119245; and Department of Finance, National University of Singapore, Singapore 119245
10 shared publications Defu Zhang
4 shared publicationsAndrew Lim
3 shared publications- Yue Zhao
HSBC Business School, Peking University, Shenzhen 518055, China
3 shared publications Yuxin Che
3 shared publications- Zhi Chen
Department of Decisions, Operations and Technology, CUHK Business School, The Chinese University of Hong Kong, Hong Kong
3 shared publications
Latest Publications
- Open Access
- 24 September 2026
- Published by Elsevier in SSRN Electronic Journal
A Pattern-Based Metaheuristic for Multi-Constraint Satellite Range Scheduling with Coupled Requirements
Traditional satellite range scheduling often assumes independent single-contact tasks, failing to capture the complex coupling requirements prevalent in modern Telemetry, Tracking, and Command (TT&C) operations. To address this gap, we formulate the Multi-Constraint Satellite Range Scheduling Problem (MCSRSP), which simultaneously addresses orbit-type preferences, consecutive operations, and inter-task time intervals, and develop a unified ILP model. To solve the problem efficiently, we propose a Pattern-Based Adaptive Variable Neighbourhood Search Framework with Conflict Resolution (PVNS-CR). Inspired by the hierarchical decoupling strategy, our algorithm first constructs feasible orbit-lap patterns satisfying intra-requirement coupling constraints, and then optimizes equipment scheduling under fixed orbit-lap patterns, thereby decomposing the original problem into two coordinated phases. To iteratively coordinate these two phases, we propose an adaptive conflict-resolution shaking mechanism in which pattern-level and subtask-level conflict degrees are defined as feedback to guide orbit-lap pattern construction and equipment scheduling improvement, thereby steering the search toward conflict resolution. Furthermore, an adaptive search strategy is incorporated to regulate random perturbation and solution acceptance, thus enhancing diversification and preventing premature convergence. Computational experiments on 45 benchmark instances demonstrate that PVNS-CR significantly outperforms state-of-the-art algorithms (e.g., KgGA, TACCS, AVNS-MT). Statistical tests confirm PVNS-CR achieves superior solution quality with competitive runtime efficiency, effectively resolving bottlenecks in large-scale scheduling.
- 24 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Pattern-Based Metaheuristic for Multi-Constraint Satellite Range Scheduling with Coupled Requirements
Traditional satellite range scheduling often assumes independent single-contact tasks, failing to capture the complex coupling requirements prevalent in modern Telemetry, Tracking, and Command (TT&C) operations. To address this gap, we formulate the Multi-Constraint Satellite Range Scheduling Problem (MCSRSP), which simultaneously addresses orbit-type preferences, consecutive operations, and inter-task time intervals, and develop a unified ILP model. To solve the problem efficiently, we propose a Pattern-Based Adaptive Variable Neighbourhood Search Framework with Conflict Resolution (PVNS-CR). Inspired by the hierarchical decoupling strategy, our algorithm first constructs feasible orbit-lap patterns satisfying intra-requirement coupling constraints, and then optimizes equipment scheduling under fixed orbit-lap patterns, thereby decomposing the original problem into two coordinated phases. To iteratively coordinate these two phases, we propose an adaptive conflict-resolution shaking mechanism in which pattern-level and subtask-level conflict degrees are defined as feedback to guide orbit-lap pattern construction and equipment scheduling improvement, thereby steering the search toward conflict resolution. Furthermore, an adaptive search strategy is incorporated to regulate random perturbation and solution acceptance, thus enhancing diversification and preventing premature convergence. Computational experiments on 45 benchmark instances demonstrate that PVNS-CR significantly outperforms state-of-the-art algorithms (e.g., KgGA, TACCS, AVNS-MT). Statistical tests confirm PVNS-CR achieves superior solution quality with competitive runtime efficiency, effectively resolving bottlenecks in large-scale scheduling.
- 6 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 195
Heuristics for the three-dimensional multiple bin size bin packing problem with transportation constraints
- 6 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 195
Heuristics for the three-dimensional multiple bin size bin packing problem with transportation constraints
- 29 November 2025
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2680 (8) , 121-138
A Branch-and-Price Algorithm for the Location-Routing Problem with District-Delimited Demand
It has been proven that a simultaneous determination of facility locations and vehicle routes can effectively reduce the overall investment and operational costs of a distribution-inventory logistics system. While most previous studies on location-routing problems (LRPs) treat possible demand concentrated only at a given set of places, some real-life scenarios observe that demand is diversely distributed in a district and the district demand can be jointly serviced by multiple facilities within the district. In such cases, supply allocation among facilities becomes another dimension of optimization, alongside facility location and vehicle routing decisions. This study addresses such a new two-echelon LRP with district-delimited demand, aiming at minimizing the total cost of facility construction, vehicle routing and service provision while meeting the aggregate demand of each district. Utilizing the Dantzig-Wolfe decomposition, we decompose the LRP into a master problem and a set of subproblems and develop a tailored branch-and-price algorithm to solve it. Through several synthetic and real-world test instances, we demonstrate the superior solution accuracy and computational efficiency of the algorithm. In addition, we perform a set of critical sensitivity analyses on facility number and vehicle capacity to assess their impact on solutions.
- 29 November 2025
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2680 (8) , 121-138
A Branch-and-Price Algorithm for the Location-Routing Problem with District-Delimited Demand
It has been proven that a simultaneous determination of facility locations and vehicle routes can effectively reduce the overall investment and operational costs of a distribution-inventory logistics system. While most previous studies on location-routing problems (LRPs) treat possible demand concentrated only at a given set of places, some real-life scenarios observe that demand is diversely distributed in a district and the district demand can be jointly serviced by multiple facilities within the district. In such cases, supply allocation among facilities becomes another dimension of optimization, alongside facility location and vehicle routing decisions. This study addresses such a new two-echelon LRP with district-delimited demand, aiming at minimizing the total cost of facility construction, vehicle routing and service provision while meeting the aggregate demand of each district. Utilizing the Dantzig-Wolfe decomposition, we decompose the LRP into a master problem and a set of subproblems and develop a tailored branch-and-price algorithm to solve it. Through several synthetic and real-world test instances, we demonstrate the superior solution accuracy and computational efficiency of the algorithm. In addition, we perform a set of critical sensitivity analyses on facility number and vehicle capacity to assess their impact on solutions.
- 17 August 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 172
A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
- 17 August 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 172
A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
- 1 July 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (4) , 761-780
Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework
We consider a vehicle routing problem with time windows under uncertain travel times where the goal is to determine routes for a fleet of homogeneous vehicles to arrive at the locations of customers within their stipulated time windows to the maximum extent while ensuring that the total travel cost does not exceed a prescribed budget. Specifically, a novel performance measure that accounts for the riskiness associated with late arrivals at the customers, called the generalized riskiness index (GRI), is optimized. The GRI covers several existing riskiness indices as special cases and generates new ones. We demonstrate its salient managerial and computational properties to motivate it better. We propose alternative set partitioning-based models of the problem. To obtain the optimal solution, we develop an exact solution framework combining route enumeration and branch-price-and-cut algorithms, in which the GRI is dealt with in route enumeration and column generation subproblems. We mainly reduce the solution space by exploiting the GRI and budget constraints’ properties without losing optimality. The proposed method is tested on a collection of instances derived from the literature. The results show that a new instance of the GRI outperforms several existing riskiness indices in mitigating lateness. The exact method can solve instances with up to 100 nodes to optimality. It can consistently solve instances involving up to 50 nodes, outperforming state-of-the-art methods by more than doubling the manageable instance size. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72101187, 72371204, 72021002, and 71901180], the Qatar National Research Fund [Grant ARG01-0430-230029], Natural Science Foundation of Sichuan Province [24NSFSC6232], and Guanghua Talent Project of the Southwestern University of Finance and Economics. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0345 .
- 1 July 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (4) , 761-780
Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework
We consider a vehicle routing problem with time windows under uncertain travel times where the goal is to determine routes for a fleet of homogeneous vehicles to arrive at the locations of customers within their stipulated time windows to the maximum extent while ensuring that the total travel cost does not exceed a prescribed budget. Specifically, a novel performance measure that accounts for the riskiness associated with late arrivals at the customers, called the generalized riskiness index (GRI), is optimized. The GRI covers several existing riskiness indices as special cases and generates new ones. We demonstrate its salient managerial and computational properties to motivate it better. We propose alternative set partitioning-based models of the problem. To obtain the optimal solution, we develop an exact solution framework combining route enumeration and branch-price-and-cut algorithms, in which the GRI is dealt with in route enumeration and column generation subproblems. We mainly reduce the solution space by exploiting the GRI and budget constraints’ properties without losing optimality. The proposed method is tested on a collection of instances derived from the literature. The results show that a new instance of the GRI outperforms several existing riskiness indices in mitigating lateness. The exact method can solve instances with up to 100 nodes to optimality. It can consistently solve instances involving up to 50 nodes, outperforming state-of-the-art methods by more than doubling the manageable instance size. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72101187, 72371204, 72021002, and 71901180], the Qatar National Research Fund [Grant ARG01-0430-230029], Natural Science Foundation of Sichuan Province [24NSFSC6232], and Guanghua Talent Project of the Southwestern University of Finance and Economics. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0345 .
- 19 April 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 921-935
A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem
- 19 April 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 921-935
A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem
- 1 November 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (6) , 1361-1382
Distributionally Robust Chance-Constrained p-Hub Center Problem
The p-hub center problem is a fundamental model for the strategic design of hub location. It aims at constructing p fully interconnected hubs and links from nodes to hubs so that the longest path between any two nodes is minimized. Existing literature on the p-hub center problem under uncertainty often assumes a joint distribution of travel times, which is difficult (if not impossible) to elicit precisely. In this paper, we bridge the gap by investigating two distributionally robust chance-constrained models that cover, respectively, an existing stochastic one under independent normal distribution and one that is based on the sample average approximation approach as a special case. We derive deterministic reformulations as a mixed-integer program wherein a large number of constraints can be dynamically added via a constraint-generation approach to accelerate computation. Counterparts of our models in the emerging robust satisficing framework are also discussed. Extensive numerical experiments demonstrate the encouraging out-of-sample performance of our proposed models as well as the effectiveness of the constraint-generation approach. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work is partially supported by the National Natural Science Foundation of China [Grants 72101187 and 72021002] and Early Career Scheme from the Hong Kong Research Grants Council General Research Fund [Grant 9043424] and NSFC/RGC Joint Research Scheme N_CityU105/21. Y. Zhao is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call [Grant MOE-2019-T3-1-010]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0113 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0113 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 November 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (6) , 1361-1382
Distributionally Robust Chance-Constrained p-Hub Center Problem
The p-hub center problem is a fundamental model for the strategic design of hub location. It aims at constructing p fully interconnected hubs and links from nodes to hubs so that the longest path between any two nodes is minimized. Existing literature on the p-hub center problem under uncertainty often assumes a joint distribution of travel times, which is difficult (if not impossible) to elicit precisely. In this paper, we bridge the gap by investigating two distributionally robust chance-constrained models that cover, respectively, an existing stochastic one under independent normal distribution and one that is based on the sample average approximation approach as a special case. We derive deterministic reformulations as a mixed-integer program wherein a large number of constraints can be dynamically added via a constraint-generation approach to accelerate computation. Counterparts of our models in the emerging robust satisficing framework are also discussed. Extensive numerical experiments demonstrate the encouraging out-of-sample performance of our proposed models as well as the effectiveness of the constraint-generation approach. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work is partially supported by the National Natural Science Foundation of China [Grants 72101187 and 72021002] and Early Career Scheme from the Hong Kong Research Grants Council General Research Fund [Grant 9043424] and NSFC/RGC Joint Research Scheme N_CityU105/21. Y. Zhao is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call [Grant MOE-2019-T3-1-010]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0113 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0113 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 22 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 312 (3) , 996-1010
Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit
- 22 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 312 (3) , 996-1010
Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit