Ada Che
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
Ada Che has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
- Chengbin Chu
School of Economics and Management, Tongji University, Shanghai, China
9 shared publications - Feng Chu
IBISC, Univ Evry, University of Paris-Saclay, Evry, France
9 shared publications - Jianguang Feng
School of Management, Northwestern Polytechnical University, Xi’an 710072, China
6 shared publications Jianguang Feng
School of Management, Northwestern Polytechnical University, Xi’an, People’s Republic of China
5 shared publications- Peng Wu
Fuzhou University
5 shared publications - Eugene Levner
School of Computer Science, Faculty of Sciences, Holon Institute of Technology, Holon 58102, Israel
4 shared publications
Latest Publications
- 28 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
We consider the assortment optimization problem under general linear constraints, where the customer choice behavior is governed by the paired combinatorial logit model. In the literature, only the unconstrained problem and the problem with constraints that can be written as “[ ]” linear inequalities with nonnegative coefficients, such as cardinality and knapsack constraints, are studied, and only approximation algorithms exist for these problems. We develop four exact solution approaches to solve the problem with any linear constraints to optimality. First, we reformulate the problem, which in its original form is a fractional program, as a mixed-integer linear programming (MILP) model, and solve the resulting formulation directly by a commercial solver. We then develop a classical Benders decomposition algorithm and enhance it with additional cuts. We further develop a parametric search method to solve the original fractional program optimally by solving a series of nonfractional parametric problems. Our extensive computational experiments show that, although the direct MILP approach and the classical Benders decomposition can solve instances with up to 100 products to optimality, the parametric search approach and the enhanced Benders decomposition approach are far more effective and can solve much larger instances (with 500 products) to optimality within reasonable computation time. We also derive several valuable insights regarding how each of the major problem parameters impacts the optimal expected revenue, and how the products included in the optimal assortment differ from those not included. In addition, we consider three extensions of the problem to include pricing decisions or to a more general setting with multiple customer segments or multiple stages and develop exact solution approaches for each extension. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72471189, 72310107003, 71901176, and 72271201]. 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.2024.0830 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0830 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 28 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
We consider the assortment optimization problem under general linear constraints, where the customer choice behavior is governed by the paired combinatorial logit model. In the literature, only the unconstrained problem and the problem with constraints that can be written as “[ ]” linear inequalities with nonnegative coefficients, such as cardinality and knapsack constraints, are studied, and only approximation algorithms exist for these problems. We develop four exact solution approaches to solve the problem with any linear constraints to optimality. First, we reformulate the problem, which in its original form is a fractional program, as a mixed-integer linear programming (MILP) model, and solve the resulting formulation directly by a commercial solver. We then develop a classical Benders decomposition algorithm and enhance it with additional cuts. We further develop a parametric search method to solve the original fractional program optimally by solving a series of nonfractional parametric problems. Our extensive computational experiments show that, although the direct MILP approach and the classical Benders decomposition can solve instances with up to 100 products to optimality, the parametric search approach and the enhanced Benders decomposition approach are far more effective and can solve much larger instances (with 500 products) to optimality within reasonable computation time. We also derive several valuable insights regarding how each of the major problem parameters impacts the optimal expected revenue, and how the products included in the optimal assortment differ from those not included. In addition, we consider three extensions of the problem to include pricing decisions or to a more general setting with multiple customer segments or multiple stages and develop exact solution approaches for each extension. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72471189, 72310107003, 71901176, and 72271201]. 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.2024.0830 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0830 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 12 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model by Jianguang Feng, Ada Che, Zhi-Long Chen.
- 12 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model by Jianguang Feng, Ada Che, Zhi-Long Chen.
- 24 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 73 (00189391) , 798-817
Reliability-Based Joint Optimization of Self-Healing Resource and Maintenance Policy for Systems in a Multisource Shock Environment
The integration of self-healing resources into systems presents a promising strategy for mitigating operational failure risks. However, the practical application of such systems is critically constrained by the absence of quantifiable management tools for precise performance evaluation and cost effective decision-making. To bridge this gap, we develop a reliability-based management framework tailored for systems with limited self-healing resources that are subject to both natural degradation and multi-source shocks. Unlike prior work, our study explicitly models the stochastic consumption of healing resources and the distinction between self-repairable and irreparable shocks. A closed-form reliability function is derived, with its validity confirmed through a dedicated simulation algorithm to ensure analytical rigor. Building on this foundation, we formulate a joint optimization model to simultaneously determine the optimal quantity of healing resources and the frequency of imperfect maintenance actions, with the objective of minimizing the average long-run cost rate under a availability constraint. A case study on self-healing lithium-ion batteries demonstrates that reliability improvements exhibit diminishing marginal returns as healing resources increase, offering a key managerial insight for resource planning. Extensive sensitivity analyses further confirm the robustness of the proposed methods and furnish engineering managers with actionable strategies to maintain a cost-availability balance amid cost fluctuations.
- 24 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 73 (00189391) , 798-817
Reliability-Based Joint Optimization of Self-Healing Resource and Maintenance Policy for Systems in a Multisource Shock Environment
The integration of self-healing resources into systems presents a promising strategy for mitigating operational failure risks. However, the practical application of such systems is critically constrained by the absence of quantifiable management tools for precise performance evaluation and cost effective decision-making. To bridge this gap, we develop a reliability-based management framework tailored for systems with limited self-healing resources that are subject to both natural degradation and multi-source shocks. Unlike prior work, our study explicitly models the stochastic consumption of healing resources and the distinction between self-repairable and irreparable shocks. A closed-form reliability function is derived, with its validity confirmed through a dedicated simulation algorithm to ensure analytical rigor. Building on this foundation, we formulate a joint optimization model to simultaneously determine the optimal quantity of healing resources and the frequency of imperfect maintenance actions, with the objective of minimizing the average long-run cost rate under a availability constraint. A case study on self-healing lithium-ion batteries demonstrates that reliability improvements exhibit diminishing marginal returns as healing resources increase, offering a key managerial insight for resource planning. Extensive sensitivity analyses further confirm the robustness of the proposed methods and furnish engineering managers with actionable strategies to maintain a cost-availability balance amid cost fluctuations.
- 11 November 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 357 (2-3) , 1217-1247
A two-stage optimization model for k-out-of-n competing risk systems based on Markov reward processes
- 11 November 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 357 (2-3) , 1217-1247
A two-stage optimization model for k-out-of-n competing risk systems based on Markov reward processes
- 17 September 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (5) , 1385-1405
Exact MILP Models for Redundancy Allocation with Mixed Components
The redundancy allocation problem (RAP) aims to find an allocation of redundant components that maximizes system reliability under resource constraints. In this paper, we consider the RAP for complex systems with heterogeneous components, which may have bridges or interconnecting subsystems and are generally more complicated in structure than commonly studied series-parallel systems. A major challenge of the RAP is that the reliability function is nonlinear. To tackle this, we develop six exact mixed integer linear programming (MILP) formulations, which, to our knowledge, are the first of such formulations for the problem. The key idea is to use binary variables and big-M constraints to successively linearize each product term in the reliability function. In addition, we propose a novel tree representation of the reliability function to establish the interconnections between different product terms, which is then used to reduce the number of decision variables and constraints needed in the linearization. We also propose an alternative form of the reliability function that only involves the failure probabilities of subsystems, and leverage this to derive better variable bounds, smaller big-M constants, and simpler formulations. We compare the six MILP formulations by solving them directly using an MILP solver based on three sets of test instances of varying complexity. Results indicate that all formulations achieve optimal solutions quickly for the first set and within reasonable computation times for the second set. For the third set, two formulations can always be solved within a given time limit. Overall, the MILP formulation derived based on the alternative form of the reliability function and a specific type of tree representation scheme performs the best. We also demonstrate that our approach is more robust and scalable than a benchmark branch-and-bound method. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by National Natural Science Foundation of China [Grants 72310107003, 72471189, 71901176]. 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.2024.0842 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0842 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 17 September 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (5) , 1385-1405
Exact MILP Models for Redundancy Allocation with Mixed Components
The redundancy allocation problem (RAP) aims to find an allocation of redundant components that maximizes system reliability under resource constraints. In this paper, we consider the RAP for complex systems with heterogeneous components, which may have bridges or interconnecting subsystems and are generally more complicated in structure than commonly studied series-parallel systems. A major challenge of the RAP is that the reliability function is nonlinear. To tackle this, we develop six exact mixed integer linear programming (MILP) formulations, which, to our knowledge, are the first of such formulations for the problem. The key idea is to use binary variables and big-M constraints to successively linearize each product term in the reliability function. In addition, we propose a novel tree representation of the reliability function to establish the interconnections between different product terms, which is then used to reduce the number of decision variables and constraints needed in the linearization. We also propose an alternative form of the reliability function that only involves the failure probabilities of subsystems, and leverage this to derive better variable bounds, smaller big-M constants, and simpler formulations. We compare the six MILP formulations by solving them directly using an MILP solver based on three sets of test instances of varying complexity. Results indicate that all formulations achieve optimal solutions quickly for the first set and within reasonable computation times for the second set. For the third set, two formulations can always be solved within a given time limit. Overall, the MILP formulation derived based on the alternative form of the reliability function and a specific type of tree representation scheme performs the best. We also demonstrate that our approach is more robust and scalable than a benchmark branch-and-bound method. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by National Natural Science Foundation of China [Grants 72310107003, 72471189, 71901176]. 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.2024.0842 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0842 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 5 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Exact MILP Models for Redundancy Allocation with Mixed Components
This software provides the implementation of different exact solution methods introduced for solving redundancy allocation problems with mixed components described in the paper, including several different MILP models and a benchmark branch-and-bound method.
- 5 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Exact MILP Models for Redundancy Allocation with Mixed Components
This software provides the implementation of different exact solution methods introduced for solving redundancy allocation problems with mixed components described in the paper, including several different MILP models and a benchmark branch-and-bound method.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (10) , 16785-16799
A Q-Learning-Based Neighborhood Search for Seaside Vehicle Dispatching and Resource Scheduling at Automated Container Terminals
The development of automated container terminals faces the challenge of bridging the gap between the increasing volume of container operations and restricted resources, particularly at the seaside of the terminal. Recognizing the pressing need for effective scheduling and decision-making processes, the industry targets two operational challenges: 1) managing limited apron resources, including vehicles, quay cranes, and traffic lanes; and 2) addressing the operation complexities brought by handling twist-locks. To address this gap, this study proposes a seaside vehicle dispatching and resource scheduling problem, which is formulated as a mixed integer linear programming model. A Q-learning-based neighborhood search is developed along with the proposal of a matheuristic method to obtain high-quality initial solutions. The experiments demonstrate that the proposed approach consistently delivers superior solutions over the benchmarks, significantly advancing the management of automated container terminal operations.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (10) , 16785-16799
A Q-Learning-Based Neighborhood Search for Seaside Vehicle Dispatching and Resource Scheduling at Automated Container Terminals
The development of automated container terminals faces the challenge of bridging the gap between the increasing volume of container operations and restricted resources, particularly at the seaside of the terminal. Recognizing the pressing need for effective scheduling and decision-making processes, the industry targets two operational challenges: 1) managing limited apron resources, including vehicles, quay cranes, and traffic lanes; and 2) addressing the operation complexities brought by handling twist-locks. To address this gap, this study proposes a seaside vehicle dispatching and resource scheduling problem, which is formulated as a mixed integer linear programming model. A Q-learning-based neighborhood search is developed along with the proposal of a matheuristic method to obtain high-quality initial solutions. The experiments demonstrate that the proposed approach consistently delivers superior solutions over the benchmarks, significantly advancing the management of automated container terminal operations.
- 5 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 71 (00189391) , 14011-14031
A Novel Resilience Assessment Framework for Multi-component Critical Infrastructure
Critical infrastructures are vital in supporting the essential services of society. However, they are susceptible to damage when confronted with disruptive events like earthquakes. This fosters a pressing demand for research geared towards building a resilient critical infrastructure. To furnish crucial benchmarks for enhancing system resilience, we develop a framework for assessing the resilience of critical infrastructures, considering their intricate multi-component configurations. Our framework conceptualizes overall resilience as a synthesis of four principal attributes: resistant, absorption, adaptive, and recovery resilience. Aiming at quantifying these attributes, the temporal performance behavior of the system is modeled via Markov processes. On this basis, resilience measures are defined concerning attributes within the framework, each incorporating both inherent and acquired aspects. The calculation formulas for these measures are derived analytically based on aggregated stochastic processes. This investigation also proves that, within the proposed framework, series systems are no more resilient than parallel systems. A case study of a potable water system subject to earthquakes is showcased to exemplify the devised assessment framework and calculation method. Meanwhile, some managerial insights are provided to designers and managers responsible for critical infrastructures.
- 5 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 71 (00189391) , 14011-14031
A Novel Resilience Assessment Framework for Multi-component Critical Infrastructure
Critical infrastructures are vital in supporting the essential services of society. However, they are susceptible to damage when confronted with disruptive events like earthquakes. This fosters a pressing demand for research geared towards building a resilient critical infrastructure. To furnish crucial benchmarks for enhancing system resilience, we develop a framework for assessing the resilience of critical infrastructures, considering their intricate multi-component configurations. Our framework conceptualizes overall resilience as a synthesis of four principal attributes: resistant, absorption, adaptive, and recovery resilience. Aiming at quantifying these attributes, the temporal performance behavior of the system is modeled via Markov processes. On this basis, resilience measures are defined concerning attributes within the framework, each incorporating both inherent and acquired aspects. The calculation formulas for these measures are derived analytically based on aggregated stochastic processes. This investigation also proves that, within the proposed framework, series systems are no more resilient than parallel systems. A case study of a potable water system subject to earthquakes is showcased to exemplify the devised assessment framework and calculation method. Meanwhile, some managerial insights are provided to designers and managers responsible for critical infrastructures.
- 21 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (11) , 16855-16868
Multi-Agent Deep Reinforcement Learning for Recharging-Considered Vehicle Scheduling Problem in Container Terminals
The worldwide popularity of electric automated guided vehicles and autonomous vehicles in container terminals requires efficient vehicle scheduling management considering the capacitated battery energy and the charging station limitation. In this paper, the recharging-considered vehicle scheduling problem is formulated as a decentralized partially observable Markov decision process to maximize the cumulative reward, providing a highly adaptive decision-making mechanism for multi-agent-powered terminal transport system by supporting decentralized decisions and accommodating partial observability. Considering the limited number of charging stations and tight schedules, a novel scheduling method based on the actor-critic multi-agent deep reinforcement learning framework is developed to facilitate cooperation among vehicles and charging stations and enhance the stability and efficiency of the learning process. Furthermore, to address the challenge on algorithm convergence due to the vast state space, we employ a heterogeneous graph neural network in the proposed framework for feature extraction and a multi-agent proximal policy optimization algorithm for parameter training. Numerical results indicate that the proposed method outperforms the distributed-agent deep reinforcement learning and several benchmark heuristics, showcasing its superior performance in both solution quality and efficiency. Moreover, the well-trained model can be directly applied to various scenarios, demonstrating its high generalization capability.
- 21 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (11) , 16855-16868
Multi-Agent Deep Reinforcement Learning for Recharging-Considered Vehicle Scheduling Problem in Container Terminals
The worldwide popularity of electric automated guided vehicles and autonomous vehicles in container terminals requires efficient vehicle scheduling management considering the capacitated battery energy and the charging station limitation. In this paper, the recharging-considered vehicle scheduling problem is formulated as a decentralized partially observable Markov decision process to maximize the cumulative reward, providing a highly adaptive decision-making mechanism for multi-agent-powered terminal transport system by supporting decentralized decisions and accommodating partial observability. Considering the limited number of charging stations and tight schedules, a novel scheduling method based on the actor-critic multi-agent deep reinforcement learning framework is developed to facilitate cooperation among vehicles and charging stations and enhance the stability and efficiency of the learning process. Furthermore, to address the challenge on algorithm convergence due to the vast state space, we employ a heterogeneous graph neural network in the proposed framework for feature extraction and a multi-agent proximal policy optimization algorithm for parameter training. Numerical results indicate that the proposed method outperforms the distributed-agent deep reinforcement learning and several benchmark heuristics, showcasing its superior performance in both solution quality and efficiency. Moreover, the well-trained model can be directly applied to various scenarios, demonstrating its high generalization capability.