- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Applied Mathematics

Volume 2013 (2013), Article ID 382620, 12 pages

http://dx.doi.org/10.1155/2013/382620

## An Equilibrium Chance-Constrained Multiobjective Programming Model with Birandom Parameters and Its Application to Inventory Problem

^{1}Uncertainty Decision-Making Laboratory, Sichuan University, Chengdu 610064, China^{2}State Key Laboratory of Hydraulics and Mountain River Engineering, Sichuan University, Chengdu 610064, China

Received 14 May 2013; Revised 25 July 2013; Accepted 25 July 2013

Academic Editor: Wei-Shih Du

Copyright © 2013 Zhimiao Tao and Jiuping Xu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

An equilibrium chance-constrained multiobjective programming model with birandom parameters is proposed. A type of linear model is converted into its crisp equivalent model. Then a birandom simulation technique is developed to tackle the general birandom objective functions and birandom constraints. By embedding the birandom simulation technique, a modified genetic algorithm is designed to solve the equilibrium chance-constrained multiobjective programming model. We apply the proposed model and algorithm to a real-world inventory problem and show the effectiveness of the model and the solution method.

#### 1. Introduction

As a key issue in supply chain management, inventory management plays an important role in controlling operation cost and improving management efficiency. As a result, inventory problems have attracted many researchers from various fields. Classical inventory problem research discussed single-item cases [1–5]. However, multiitem inventory problems are more common in the real-world. In fact, for many enterprises, especially supermarkets, it is necessary to prepare hundreds of goods to meet the needs of different consumers. Therefore, multiitem inventory problem research has become more attractive for researchers [6–9].

Apart from the multiitem inventory, uncertainty is another characteristic of inventory problems. For example, the price of a product usually varies due to the market fluctuation. One kind of common uncertainty is randomness. Many researchers have studied random inventory models. Baker and Ehrhardt analyzed a periodic-review, random-demand inventory model under the assumption that replenishment quantities are random fractions of the amounts ordered [10]. Bera et al. dealt with a multiitem mixture inventory model in which both demand and lead time are random [8]. Fuzziness is another type of uncertainty in inventory problems. Wang et al. [11] developed a novel joint replenishment problem model with fuzzy minor replenishment cost and fuzzy inventory holding cost. Roy et al. [12] considered an inventory model for a deteriorating item (seasonal product) with linearly displayed stock dependent demand in an imprecise environment (involving both fuzzy and random parameters) under inflation and the time value of money. M. K. Maiti and M. Maiti [13] proposed a multiitem inventory model with advertising costs, price, and displayed inventory level-dependent demand in a fuzzy environment (purchase cost, investment amount, and storehouse capacity were considered imprecise). Besides these, twofold uncertain inventory models have also been studied as more complex; imprecise information is considered. Dutta et al. [14] presented a single-period inventory problem in an imprecise and uncertain mixed environment, in which the demand is assumed as a fuzzy random variable. Xu and Zhao [15, 16] formulated inventory models under fuzzy rough environments.

However, an inventory model with twofold random phenomenon is seldom discussed. In reality, inventory problems in the real-world may be subjected to twofold randomness with incomplete or uncertain information. Consequently, developing an inventory strategy in a more complete stochastic environment takes place. As a case in point, it is widely accepted that the price of a product is a normal distributed variable, denoted by from the viewpoint of probability theory, but the values of and may be still uncertain variables. If there is statistical information about and , it is possible to specify realistic distributions for and by utilizing statistical methods. When the values of and are provided as random variables, the price then is not a conventional random variable but a so-called birandom variable. A birandom variable, which plays a role analogous to a random variable in probability theory, is appropriate to describe this kind of twofold randomness. In this paper, we discuss a class of multiobjective programming models with birandom parameters. Chance-constrained programming proposed by Charnes and Cooper [17] is an effective technique to deal with uncertain optimization problem [18]. By using the equilibrium chance-constrained programming technique, the initial model is meaningful mathematically.

The rest of the paper is organized as follows. Section 2 develops a general equilibrium chance-constrained programming model with birandom parameters. A linear model is converted into its crisp equivalent model. In order solve a general model, the birandom simulation-based genetic algorithm is deigned in Section 3. Section 4 applies the theoretical results into a real-world inventory problem. Further discussions in Section 5 illustrate the effectiveness of the proposed model and algorithm. Finally, concluding remarks are outlined in Section 6.

#### 2. Equilibrium Chance-Constrained Multiobjective Programming Model with Birandom Parameters

In order construct a general equilibrium chance-constrained multiobjective programming model with birandom parameters, we first state some basic concepts and theorems on birandom theory which is presented firstly.

##### 2.1. Birandom Variable and Equilibrium Chance

Birandom variable, which is proposed by Peng and Liu [19], is a mathematical tool to describe twofold random phenomena. An *n*-dimensional birandom vector is a map from the probability space to a collection of *n*-dimensional random vectors such that is a measurable function with respect to for any Borel set of the real space . In particular, is called a birandom variable as .

*Example 1. *A birandom variable is said to be uniform, if for each , is a random variable with uniform distribution, denoted by , where and are random variables defined on the probability space .

*Example 2. *A birandom variable is said to be normal, if for each , is a random variable with normal distribution, denoted by , where and are random variables defined on the probability space .

*Example 3. *A birandom variable is said to be exponential, if for each , is a random variable with exponential distribution, denoted by , where are random variables defined on the probability space .

*Example 4. *Let be a probability space. If ,
where are random variables with density function , respectively. Birandom variable is illustrated by Figure 1.

By birandom event we mean that . In order to compare the degrees of occurrence of two birandom events, quantitative measures of the chance of a birandom event are necessary. In the literature, the first attempt to develop the definition of the chance of a birandom event is primitive chance, which is a function from to .

*Definition 5 (see [19]). *Let be a birandom vector defined on , and is Borel measurable function. Then the primitive chance of a birandom event characterized by is a function from to , defined as
where is a prescribed probability level. The value of primitive chance at is called -chance.

*Remark 6. *It should be noted that the symbol appears twice in the right side of (2). In fact, they represent different meanings. In other words, the overloading allows us to use the same symbol Pr for different probability measures, because we can deduce the exact meaning in the context.

In the case of fuzzy random programming problems, the equilibrium chance of a fuzzy random event was introduced to measure the degree of the occurrence of a fuzzy random event [20]. Rather than a function, the equilibrium chance is a scalar value, like the probability of a random event and the possibility of a fuzzy event. Thus it is easy for the decision maker to rank the decisions via equilibrium chance using the natural order of real numbers, rather than requiring a preference order from the decision maker. Motivated by the idea, we introduce the equilibrium chance of a birandom event as follows.

*Definition 7. *Let be a birandom vector, and is a Borel measurable function. Then the equilibrium chance of birandom event is defined as

*Remark 8. *Peng and Liu [19] introduced the equilibrium chance of a birandom event as
where is the primitive chance. It is easy to verify the forms (3) and (4) are equivalent.

*Remark 9. *If degenerates to a random vector, implies , and then (3) is equivalent to , which is the probability measure.

For any , denote It follows from the definition of birandom variable that is a random variable. Then is a left-continuous and nonincreasing function with respect to , and for any given , represents the following random event occurring: Therefore, the equilibrium chances defined above measure the twofold maximum probability simultaneously.

Generally, if then is just the value of the equilibrium chance. As is a continuous random variable, the left side and right side of relation (7) are equal. Thus the equilibrium chance is available at the fixed point of ; that is, .

It follows from the definitions of equilibrium chance and primitive chance of a birandom event that they have the following differences.(i)The equilibrium chance of a birandom chance of a birandom event is a scalar value, just like the probability of a random event and the possibility of a fuzzy event, while the primitive chance of a birandom event is a function from to .(ii)The equilibrium chance measures the twofold probabilities at the same time, while the value of the primitive chance at measures the single maximum probability of a birandom event occurring under the given value of the other probability.

However, the connections of the equilibrium chance and the primitive chance can be summarized as follows.(i)Equilibrium chance (3) can be represented as where is the value of primitive chance at .(ii)The primitive chance of a birandom event is the pseudo-inverse function of the function .

In order to generate the notation of the equilibrium chance of a birandom event defined by (3), we give another equivalent form as follows: where the parameters and represent two kinds of probability. It is easy to see from (3) that we use the min/max operator, which is a special triangular norm, to define the equilibrium chance of a birandom event. In fact, by using a common triangular norm , the equilibrium chance can be extended as where is a triangular norm. In practice, we may also use various triangular norms such as , , , or according to a decision maker’s philosophy of modeling uncertainty.

The following theorem implies a basic property of the equilibrium chance.

Theorem 10. *Let be a birandom vector, and let be Borel measurable function, and . Then
*

*Proof. *“” Assume that . It follows from the definition of that there exists a real number such that
Thus we have
So we get that
It follows that
“” If , then we have
The theorem is proved.

The independence of birandom variables is defined as follows.

*Definition 11. *Birandom variables , which are defined on the probability space , are said to be independent if and only if are independent random variables for all .

##### 2.2. Model Formulation

A general equilibrium chance-constrained multiobjective programming model with birandom parameters is formulated as where is an -ary decision vector, -ary is a birandom vector, is a fixed set that is usually determined by a finite number of inequalities involving functions of , and are -ary real-valued continuous functions, and and are predetermined confidence levels, , .

It follows from Remark 9 that if degenerates to random vector, then model (17) degenerates to which is a stochastic chance-constrained programming model.

*Definition 12 (birandom efficient solution at -levels). *Suppose a feasible solution of problem (17) satisfies
where confidence levels . is said to be a birandom efficient solution at -levels to problem (17) if and only if there exists no other feasible solution such that
and for all and for at least one .

Specially, we consider the linear form of model (17): where and are birandom vectors, and are birandom variables, , .

It follows from Theorem 10 that model (21) can be rewritten as

Lemma 13. *Assume that birandom vector follows normal distribution with mean vector and positive definite covariance matrix , denoted by . is a normal random vector with mean vector and positive definite covariance matrix , written as . If are independent birandom variables, then holds if and only if
**
where is the standardized normal distribution. *

*Proof. *Let ; then follows normal distribution with the following expected value and variance:
where . We note that
must be standardized normally distributed. The inequality is equivalent to
Let , which is standardized normally distributed. Then we have
Thus
This completes the proof.

Lemma 14 (see [21]). *Assume that birandom vector follows normal distribution with mean vector and positive definite covariance matrix , written as . is a normally distributed random variable, written as . Birandom variable follows normal distribution with mean value and variance , denoted by . is a normally distributed random variable, written as . If are independent birandom variables, then holds if and only if
**
where are predetermined confidence levels, . *

It follows from Lemmas 13 and 14 that model (21) is equivalent to the following crisp multiobjective programming model: or equivalently where , , and .

#### 3. Solution Method

If model (17) satisfies the conditions for Lemmas 13 and 14, then model (17) can be converted into a crisp multiobjective programming model. Many classical methods, such as the goal programming method, the interactive method, and the weighted sum method, can be used to solve it. However, for a general case, it is a difficult to convert the general model into its deterministic equivalent for the predetermined confidence levels. In order to handle the birandom objective functions and to check the birandom equilibrium chance constraints, we used a birandom simulation technique as this method is similar to a stochastic simulation but more complicated and time consuming.

For the following constraints, in view of the purpose of maximizing , we should find the maximal such that (32) holds for a given . It suffices to estimate the maximal value of such that the probability of the following random event is not less than .

First, we generate independent vectors from according to distribution function. Then are random vectors, . So we can apply the stochastic simulation to handle We define for , which are random variables, and the expected value for all . By the strong law of large numbers, we obtain as . Note that is just the number of satisfying for . Thus is just the th largest element in the sequence , where is the integer part of . The process to estimate the maximal such that (32) holds is summarized as follows.

*Step 1. *Sample from according to distribution function.

*Step 2. *Find the maximal values such that for , respectively, by stochastic simulation.

*Step 3. *Set as the integer part of .

*Step 4. *Return the th largest element in as , .

For a fixed , we check whether the constraint holds by following process.

*Step 1. *Set .

*Step 2. *Generate from according to distribution function.

*Step 3. *Calculate by stochastic simulation.

*Step 4. *If , then .

*Step 5. *Repeat Step 2 to Step 4 times.

*Step 6. *If , return is feasible, or else is infeasible.

Genetic algorithms (GAs) are stochastic search methods for optimization problems based on the mechanics of natural selection and natural genetics. They have been applied to different sectors for both technical and management problems and have shown good performance [22–26]. In this paper, the birandom simulation technique is embedded into a GA to develop the birandom simulation-based GA. The overall procedure of the birandom simulation-based GA for solving the birandom programming models is shown in Figure 2. The main parts of the algorithm are stated in more detail as follows.

Representation: a vector is chosen as a chromosome to represent a solution to the optimization problem.

Handling the constraints: to ensure the chromosomes generated by genetic operators are feasible, we can use the technique of birandom simulation to check them.

Initializing process: suppose that the decision maker is able to predetermine a region which contains the feasible set. Randomly generate a vector from this region until a feasible one is accepted as a chromosome. Repeat the above process times; then we have initial feasible chromosomes . In general, the larger the number of population size is, the better the result is. However, the computation time will increase with increasing. In the paper, we set from 20 to 40.

Evaluation function: let equal weighted sum of all objectives; that is, where are random numbers in , representing the weight for objective , . The random weight-sum approach explores the entire solution space in order to avoid local optima and thus gives a uniform chance to search all the possible solutions. All chromosomes are arranged from large to small according to their objective function values. In other words, after rearrangement, is the best chromosome, and is the worst one.

Selection process: the selection process is based on spinning the roulette wheel times. Each time a single chromosome for a new population is selected in the following way: calculate the cumulative probability for each chromosome : Generate a random number in and select the th chromosome such that , . Repeat the above process times and we obtain copies of chromosomes.

Crossover operation: generate a random number from the open interval (0, 1) and the chromosome is selected as a parent provided that , where parameter is the probability of crossover operation. Repeat this process times and chromosomes are expected to be selected to undergo the crossover operation. The crossover operator on and will produce two children and as follows: If both children are feasible, then we replace the parents with them, or else we keep the feasible one if it exists. Repeat the above operation until two feasible children are obtained or a given number of cycles is finished.

Let us consider the setting of probability of crossover . It is obvious that larger crossover probability results in reaching larger solution space, and then it helps reduce the chance of stopping at nonoptimal solution. However, too large will result in considerable time consuming because of too much searching in unnecessary solution space. In the paper, we set from 0.2 to 0.4.

Mutation operation: similar to the crossover process, the chromosome is selected as a parent to undergo the mutation operation provided that random number , where parameter is the probability of mutation operation. are expected to be selected after repeating the process times. Suppose that is chosen as a parent. Choose a mutation direction randomly. Replace with if is feasible; otherwise we set as a random number between 0 and until it is feasible or a given number of cycles are finished. Here, is a sufficiently large positive number.

controls the proportion of new genes generating in population. If is too small, it will be difficult for some effective genes to be selected. On the contrary, if is too large, that is, there exists too much random change, then offsprings may lose good characteristics inherited from their parents. Thus, the algorithm will lose the learning ability from the past searching. In the paper, we set from 0.2 to 0.4.

After running a given number of cycles of above birandom simulation-based genetic algorithm, the best chromosome can be regarded as the optimal solution.

#### 4. Practical Application for H Chain Co., Ltd.

A real-world inventory problem is discussed in this section to illustrate the effectiveness of the theoretical results in this paper.

##### 4.1. Key Problem Statement and Model Formulation

The problem is from H Chain Co., Ltd., which is one of largest chain enterprises in southwest of China. It operates a variety of products, such as eggs, grains, milk, and meat. Inventory management is an important part of company management. The inventory system of H Chain Co., Ltd. is illustrated by Figure 3.

A new executive is assigned to the management of four product items: eggs, dairy products, grains, and meat products. The executive needs to make an effective inventory strategy to reduce costs and increase profit.

###### 4.1.1. Assumptions

In order to develop the mathematical model for the inventory problem, there are some assumptions made, which are as follows. This is an inventory model with a finite time horizon. There are multiple items in this inventory system. Average demand rates are continuous and constant. Deterioration rates are constant. Shortage is allowed. Initial inventory quantities are not zeros; The inventory system uses a continuous review fixed-order-quantity strategy. The lead time is proportional to the order quantity. Fixed-ordering costs are constant. Unit price, unit acquisition cost, holding cost per unit per unit time and shortage cost per unit per unit time are birandom variables. Available total storage space is limited. Available total budget is limited. The inventory system uses nonintegrated management.

###### 4.1.2. Notations

The following notations are used to describe this inventory model: is the number of items; is the available storage space of warehouse of product , ; is the available total budgetary cost; is the required storage area per unit quantity , ; is the fixed-ordering cost of product , ; is the average demand rate of product , ; is the initial demand rate of product , ; is the average deteriorating rate of product , ; is the lead time for unit product , ; is the unit selling price of product (birandom variable), ; is the unit acquisition cost of product (birandom variable), ; is the unit shortage cost of product (birandom variable), ; is the reorder point of product (decision variable), ; is the order quantity of product (decision variable), ; is the net revenue of product , ; is the accquisition cost of product , ; is the holding cost of product , ; is the shortage cost of product , ; is the average profit of product , .

##### 4.2. Model Formulation

It follows from the assumptions above that the inventory level of product at time can be illustrated by Figure 4.

In Figure 4, is the time of order point for product ; is the time when inventory level of product reduces to zero; is the time when replenishment of product arrives; is the time when inventory level of product reduces to reorder point.

From Figure 4, we have

For product , the total profit from initial time 0 to equals the net revenue minus total cost, including fixed-ordering cost, acquisition cost, holding cost, and shortage cost. The net revenue is equal to unit price multiplied by sale quantity, that is,

The acquisition cost is equal to unit acquisition cost multiplied ordering quantity; that is,

The total holding cost consists of holding cost from 0 to and holding cost from to ; that is,

The shortage cost occurs from to ; that is,

The total profit of product from to is . Then the average total profit of product is formulated as

It is noted that can not be maximized due to birandomness. By utilizing the idea of Charnes and Cooper [17], is maximized which satisfies where is the equilibrium chance and is given confidence level.

The space of product ordered should not exceed the available storage space of warehouse; that is,

All the costs should not exceed the available total budgetary cost; that is, . It is noted that the constraint is meaningless mathematically due to the existence of birandom variable. We use equilibrium chance-constrained technique to make it meaningful mathematically, that is, where is the confidence level predetermined by the decision maker.

Since shortage is allowed, the order quantity of product should not be less than reorder point ; that is,

In addition, It is natural to require the nonnegativity of decision variable; that is,

By integration of (47)–(51), we can formulate the programming model of the inventory problem as

##### 4.3. Data and Compaction Result

All the data are from the marketing section of H Chain Co., Ltd. These data can be divided into two different groups: determined parameters and birandom parameters. Determined parameters include , , , , , , , and . The available total budgetary cost yuan. Except for , all determined parameters are listed in Table 1. Birandom variables including (unit selling price of product ), (unit acquisition cost of product ), and (unit shortage cost of product ). These birandom variables are listed in Table 2. The decision maker set confident levels and weighs .

We implement the birandom simulation-based genetic algorithm in Matlab 7.0 (the population size , the probability of crossover , and the probability of mutation ) and ran on a PC, 2.40 GHz with 1024 MB memory. After running 500 generations, the final solution is listed in Table 3. In addition, the objective function values are .

#### 5. Further Discussions

To show the effectiveness of the model and algorithm better, evaluation, analysis, and comparison from various aspects are presented.

##### 5.1. Algorithm Evaluation

We evaluate the birandom simulation-based algorithm from two aspects.

First, we will show that the birandom simulation-based algorithm is robust to genetic parameters. We compare the results by the algorithm with different parameters, including population size , probability of crossover , probability of mutation , cycles in birandom simulation, and generations in GA. These results are listed in Table 4. It appears that almost all the objective values differ little from each other. In fact, each relative error does not exceed 3% when different parameters are selected, which implies that the proposed algorithm is robust to the parameters setting and effective to solve the problem in this paper.

Second, since the functions in model (52) are linear, by Lemmas 13 and 14, model (52) can be transformed into its crisp equivalent model. Assume that all the parameters are the same and the final objective function values are by using the weighted sum method. The results obtained by the birandom simulation genetic algorithm and by the traditional weighted sum method are close to each other, which implies the effectiveness of the birandom simulation-based genetic algorithm proposed in this paper.

##### 5.2. Sensitivity Analysis

However, under a different decision making environment and different conditions, the decision maker may alter the predetermined confidence levels. Then the optimal solution will alter accordingly. In order to show how the optimal solutions change along with the predetermined confidence levels, we conducted a sensitivity analysis as shown in Table 5. As shown from Table 5, a bigger induces a better result, because a bigger extends the feasible region. Conversely, a bigger induces a worse result since a bigger narrows the feasible region.

##### 5.3. Model Comparison

Birandom system is a generation for stochastic system. For illustrating the advantage of birandom system, all the birandom variables in (52) are assumed to be random variables, and other parameters keep original values. Each birandom variable in (52) has the following form: Replace with , which is a constant. Then degenerates into a random variable. For example, we use to replace . As all the birandom variables are replaced by random variables, equilibrium chance degenerates into probability . Then (52) can be written as This stochastic system is a special case of a birandom system, which can be solved using a stochastic simulation-based GA. Similar to the birandom simulation-based GA, the stochastic simulation-based GA is formed by embedding stochastic simulation into a GA. The robustness of the stochastic simulation-based GA can be verified as similar to the birandom simulation-based GA.

In order to make a comparison with the birandom system, we solve problem (54) with following parameter: , , and , 500 cycles in stochastic simulation, 500 generations in GA. The final result is , which is worse than the result of the birandom system. Thus it shows that birandom system is more flexible and can generate better objective values than the corresponding stochastic system.

##### 5.4. Managerial Insight

Some managerial insights can be derived from the above discussions. From the sensitivity analysis, we can see the following. A pessimistic decision maker will set lower confidence levels to avoid higher risk. As a result, the values for the objective functions are worse than those at higher confidence levels. An optimistic decision maker will set higher confidence levels to obtain better values for the objective functions. However, there will be the cost of higher risk. To sum up, the values for the objective functions depend on the attitude of the decision maker towards risk. From a comparison between the stochastic model and the birandom model, the decision maker can obtain more flexible results if they can construct a birandom model rather than a stochastic model in a complex stochastic decision environment. However, depicting the complex stochastic decision environment as birandom variables costs more, so the decision maker must make a trade-off between the cost and the benefit.

#### 6. Conclusions

In this paper, we have formulated an equilibrium chance-constrained multiobjective programming model with birandom parameters, which extends the general multiobjective programming model. We converted a special linear model into a crisp multiobjective programming model which can be solved using traditional techniques. A modified genetic algorithm was designed by embedding the birandom simulation technique to deal with the general model. By assuming that some parameters (unit selling price, unit acquisition cost, etc.) are birandom variables, we developed an equilibrium chance-constrained multiobjective programming model with birandom parameters for an inventory problem and solved it using the birandom simulation-based GA. Further discussions show the effectiveness of the proposed model and algorithm. Some managerial insights may help decision makers improve their decision making.

Though the inventory problem considered is specific, the theoretical results can be extended to various inventory problems. In the future, detailed analysis, further research, and practical application of the model and algorithm proposed in this paper will be considered.

#### Acknowledgments

The authors would like to give their great appreciates to the editors and anonymous referees for their helpful comments and valuable suggestions which improved the content and composition substantially. This research was supported by the Programs of NSFC (Grant nos. 70831005 and 71273036), Projects of International Cooperation and Exchanges NSFC (Grant no. 71011140076), “985” Program of Sichuan University (Innovative Research Base for Economic Development and Management), Sichuan University Young Teachers Scientific Research Start Funds (Grant no. 2012SCU11016), and the Key Program of Sichuan System Science and Enterprise Development Research Center (Grant no. Xq13B04).

#### References

- S. Graves,
*A Single-Item Inventory Model for a Non-stationary demand Process, Sloan School of Management*, Massachusetts Institute of Technology, 1997. - M. Khouja and S. Goyal, “Single item optimal lot sizing under continuous unit cost decrease,”
*International Journal of Production Economics*, vol. 102, no. 1, pp. 87–94, 2006. View at Publisher · View at Google Scholar - J. Riezebos and G. Gaalman, “A single-item inventory model for expected inventory order crossovers,”
*International Journal of Production Economics*, vol. 121, no. 2, pp. 601–609, 2009. View at Publisher · View at Google Scholar - M. Hariga, “A single-item continuous review inventory problem with space restriction,”
*International Journal of Production Economics*, vol. 128, no. 1, pp. 153–158, 2010. View at Publisher · View at Google Scholar - G. Kiesmüller, A. De Kok, and S. Dabia, “Single item inventory control under periodic review and a minimum order quantity,”
*International Journal of Production Economics*, vol. 133, no. 1, pp. 280–285, 2011. View at Publisher · View at Google Scholar - D. K. Bhattacharya, “On multi-item inventory,”
*European Journal of Operational Research*, vol. 162, no. 3, pp. 786–791, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Roy, S. Kar, and M. Maiti, “A deteriorating multi-item inventory model with fuzzy costs and resources based on two dierent defuzzification techniques,”
*Applied Mathematical Modelling*, vol. 32, no. 2, pp. 208–223, 2008. View at Publisher · View at Google Scholar - U. K. Bera, M. Rong, N. K. Mahapatra, and M. Maiti, “A multi-item mixture inventory model involving random lead time and demand with budget constraint and surprise function,”
*Applied Mathematical Modelling*, vol. 33, no. 12, pp. 4337–4344, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. Guchhait, M. Maiti, and M. Maiti, “Multi-item inventory model of breakable items with stock-dependent demand under stock and time dependent breakability rate,”
*Computers & Industrial Engineering*, vol. 59, no. 4, pp. 911–920, 2010. View at Google Scholar - H. Baker and R. Ehrhardt, “A dynamic inventory model with random replenishment quantities,”
*Omega*, vol. 23, no. 1, pp. 109–116, 1995. View at Publisher · View at Google Scholar - L. Wang, Q. L. Fu, C. G. Lee, and Y. R. Zeng, “Model and algorithm of fuzzy joint replenishment problem under credibility measure on fuzzy goal,”
*Knowledge-Based Systems*, vol. 39, pp. 57–66, 2013. View at Publisher · View at Google Scholar - A. Roy, M. K. Maiti, S. Kar, and M. Maiti, “An inventory model for a deteriorating item with displayed stock dependent demand under fuzzy inflation and time discounting over a random planning horizon,”
*Applied Mathematical Modelling*, vol. 33, no. 2, pp. 744–759, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. K. Maiti and M. Maiti, “Fuzzy inventory model with two warehouses under possibility constraints,”
*Fuzzy Sets and Systems*, vol. 157, no. 1, pp. 52–73, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. Dutta, D. Chakraborty, and A. R. Roy, “A single-period inventory model with fuzzy random variable demand,”
*Mathematical and Computer Modelling*, vol. 41, no. 8-9, pp. 915–922, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Xu and L. Zhao, “A class of fuzzy rough expected value multi-objective decision making model and its application to inventory problems,”
*Computers & Mathematics with Applications*, vol. 56, no. 8, pp. 2107–2119, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Xu and L. Zhao, “A multi-objective decision-making model with fuzzy rough coefficients and its application to the inventory problem,”
*Information Sciences*, vol. 180, no. 5, pp. 679–696, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Charnes and W. W. Cooper, “Chance-constrained programming,”
*Management Science*, vol. 6, pp. 73–79, 1959. View at Google Scholar · View at MathSciNet - A. Geletu, M. Klöppel, H. Zhang, and P. Li, “Advances and applications of chance-constrained approaches to systems optimisation under uncertainty,”
*International Journal of Systems Science*, vol. 44, no. 7, pp. 1209–1232, 2013. View at Publisher · View at Google Scholar - J. Peng and B. Liu, “Birandom variables and birandom programming,”
*Computers & Industrial Engineering*, vol. 53, pp. 433–453, 2007. View at Google Scholar - Y.-K. Liu and B. Liu, “Fuzzy random programming with equilibrium chance constraints,”
*Information Sciences*, vol. 170, no. 2–4, pp. 363–395, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Xu and Z. Tao, “A class of multi-objective equilibrium chance maximization model with twofold random phenomenon and its application to hydropower station operation,”
*Mathematics and Computers in Simulation*, vol. 85, pp. 11–33, 2012. View at Publisher · View at Google Scholar · View at MathSciNet - G. Zhou and M. Gen, “Genetic algorithm approach on multi-criteria minimum spanning tree problem,”
*European Journal of Operational Research*, vol. 114, no. 1, pp. 141–152, 1999. View at Publisher · View at Google Scholar - M. Gen and R. Cheng,
*Genetic Algorithms and Engineering Optimization*, Wiley-interscience, 2000. - M. Soolaki, I. Mahdavi, N. Mahdavi-Amiri, R. Hassanzadeh, and A. Aghajani, “A new linear programming approach and genetic algorithm for solving airline boarding problem,”
*Applied Mathematical Modelling*, vol. 36, no. 9, pp. 4060–4072, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Rezaei and M. Davoodi, “A deterministic, multi-item inventory model with supplier selection and imperfect quality,”
*Applied Mathematical Modelling*, vol. 32, no. 10, pp. 2106–2116, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. Nazif and L. S. Lee, “Optimised crossover genetic algorithm for capacitated vehicle routing problem,”
*Applied Mathematical Modelling*, vol. 36, no. 5, pp. 2110–2117, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet