“…Now we solve the developed model to get its Pareto-optimal solutions with modified PSO, which is implemented by using C++, some parameters is the same as [1].In order to get the final global non-dominated solution set, 20 successful runs are required and the average time of each run is 27.33 minutes. 119 initial non-dominated solutions have been gotten in the 20 experimental runs, and 14 global non-dominated solutions can be selected from their corresponding solution set.…”
Section: The Simulation Resultsmentioning
confidence: 99%
“…Unlike our recent study in [1] with fuzzy coefficients, all coefficients in this proposed model are assumed to be continuous stochastic numbers with the same other assumption, which will be simply narrated as follows. Suppose that there are N projects with Firstly, we analyze the output and input of cash flow at the end of each year in the process of the items, the minimal demanded cash at the beginning of each item can be described by On the other hand, the net cash flow produced at the end of each year among the process the items shown in Figure.1 can be described as Figure.2.…”
Section: Assumptions and Notationsmentioning
confidence: 99%
“…Just discussion in [1], the main condition is mapping a relationship between the demanded cash and supplied cash, the former couldn't be more than the latter. The supplied monetary resource at the beginning of any items is composed of the monetary resource raised by the item itself and the remained monetary resource of the previous items.…”
Section: The Stochastic Chance-constrained Condition Functionsmentioning
confidence: 99%
“…The PSO approach which can only be operated in continuous space were proposed by Kennedy and Eberhart [2,3] who gave the discrete binary version in 1997.Unfortunately,they had not discussed how to handle condition constraints. B.XU and WG.FANG.et al [1 ] had discussed this problem and given a detailed illustration with a modification of PSO with absorbing the idea of NSGA-II [4] .The modified main key factors include fast non-dominated sorting approach, diversity preservation and constraint handling.…”
Section: The Solution To Optimum Model With Modified Psomentioning
This paper aims to solve the multi-project multi-item investment combination under stochastic surroundings. A new stochastic chance-constrained programming model for investigating its problem will be presented, in which there are three objectives with some stochastic constraints to construct a 0-1 integer programming model, and demonstrate how to use PSO to solve the optimization model with a small modification of constraint-handling rule. A simulation experiment is employed to illustrate the application of the proposed model to get the Pareto-optimal solutions by applying the modified algorithm PSO.
“…Now we solve the developed model to get its Pareto-optimal solutions with modified PSO, which is implemented by using C++, some parameters is the same as [1].In order to get the final global non-dominated solution set, 20 successful runs are required and the average time of each run is 27.33 minutes. 119 initial non-dominated solutions have been gotten in the 20 experimental runs, and 14 global non-dominated solutions can be selected from their corresponding solution set.…”
Section: The Simulation Resultsmentioning
confidence: 99%
“…Unlike our recent study in [1] with fuzzy coefficients, all coefficients in this proposed model are assumed to be continuous stochastic numbers with the same other assumption, which will be simply narrated as follows. Suppose that there are N projects with Firstly, we analyze the output and input of cash flow at the end of each year in the process of the items, the minimal demanded cash at the beginning of each item can be described by On the other hand, the net cash flow produced at the end of each year among the process the items shown in Figure.1 can be described as Figure.2.…”
Section: Assumptions and Notationsmentioning
confidence: 99%
“…Just discussion in [1], the main condition is mapping a relationship between the demanded cash and supplied cash, the former couldn't be more than the latter. The supplied monetary resource at the beginning of any items is composed of the monetary resource raised by the item itself and the remained monetary resource of the previous items.…”
Section: The Stochastic Chance-constrained Condition Functionsmentioning
confidence: 99%
“…The PSO approach which can only be operated in continuous space were proposed by Kennedy and Eberhart [2,3] who gave the discrete binary version in 1997.Unfortunately,they had not discussed how to handle condition constraints. B.XU and WG.FANG.et al [1 ] had discussed this problem and given a detailed illustration with a modification of PSO with absorbing the idea of NSGA-II [4] .The modified main key factors include fast non-dominated sorting approach, diversity preservation and constraint handling.…”
Section: The Solution To Optimum Model With Modified Psomentioning
This paper aims to solve the multi-project multi-item investment combination under stochastic surroundings. A new stochastic chance-constrained programming model for investigating its problem will be presented, in which there are three objectives with some stochastic constraints to construct a 0-1 integer programming model, and demonstrate how to use PSO to solve the optimization model with a small modification of constraint-handling rule. A simulation experiment is employed to illustrate the application of the proposed model to get the Pareto-optimal solutions by applying the modified algorithm PSO.
“…Our latest paper [1] has proposed a multiproject and multi-item investment combination optimization model which can be applied to solve some optimization problems such as marketing research, portfolio capital, global budget management etc. Unfortunately, though the fuzzy approach was employed to simulate the optimization problem, any project was only evaluated by classical NPV approach.However, the essence of fuzzy event means that any project must be evaluated from the perspective of real options.…”
This paper presents a new fuzzy chance-constrained programming model to find the Pareto solution set for multiproject and multi-item investment combination based on the perspective of real options. The proposed 0-1 integer programming model has two objectives subject to fuzzy cash supply chain constraint conditions, and the escalating GA will be employed to solve the above optimization model with a small modification of constraint handling. A simulation experiment illustrating the application of the proposed model will be presented and Pareto-optimal solutions will be obtained. A comparison shows that EMGA has some advantages over the classical GA.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.