MbrlCatalogueTitleDetail

Do you wish to reserve the book?
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
Journal Article

Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms

2021
Request Book From Autostore and Choose the Collection Method
Overview
This paper investigates the uncertain stochastic resource allocation problem in which the results of a given allocation of resources are described as probabilities and these probabilities are considered to be uncertain from practical aspects. Here uncertainties are introduced by assuming that these probabilities depend on random parameters which are impacted by various factors. The redundancy allocation problem (RAP) and the multi-stage weapon-target assignment (MWTA) problem are special cases of stochastic resource allocation problems. Bi-objective models for the uncertain RAP and MWTA problem in which the conditional value-at-risk measure is used to control the risk brought by uncertainties are presented in this paper. The bi-objective formulation covers the objectives of minimizing the risk of failure of completing activities and the resulting cost of resources. With the aim of determining referenced Pareto fronts, a linearized formulation and an approximated linear formulation are put forward for RAPs and MWTA problems based on problem-specific characteristics, respectively. Two state-of-the-art decomposition-based multi-objective evolutionary algorithms (i.e., MOEA/D-AWA and DMOEA-εC) are used to solve the formulated bi-objective problem. In view of differences between MOEA/D-AWA and DMOEA-εC, two matching schemes inspired by DMOEA-εC are proposed and embedded in MOEA/D-AWA. Numerical experiments have been performed on a set of uncertain RAP and MWTA instances. Experimental results demonstrate that DMOEA-εC outperforms MOEA/D-AWA on the majority of test instances and the superiority of DMOEA-εC can be ascribed to the ε-constraint framework.