مقایسه برخی از استراتژی های بهبود در MOPSO برای سیستم موجودی (r، Q) چند هدفه
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|20677||2011||7 صفحه PDF||سفارش دهید||محاسبه نشده|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Expert Systems with Applications, Volume 38, Issue 10, 15 September 2011, Pages 12051–12057
This paper presents comparisons of some recent improving strategies on multi-objective particle swarm optimization (MOPSO) algorithm which is based on Pareto dominance for handling multiple objective in continuous review stochastic inventory control system. The complexity of considering conflict objectives such as cost minimization and service level maximization in the real-world inventory control problem needs to employ more exact optimizers generating more diverse and better non-dominated solutions of a reorder point and order size system. At first, we apply the original MOPSO employed for the multi-objective inventory control problem. Then we incorporate the mutation operator to maintain diversity in the swarm and explore all the search space into the MOPSO. Next we change the leader selection strategy used that called geographically-based system (Grids) and instead of that, crowding distance factor is also applied to select the global optimal particle as a leader. Also we use ε-dominance concept to bound archive size and maintain more diversity and convergence in the MOPSO for optimizing the inventory control problem. Finally, the MOPSO algorithms created using these strategies are evaluated and compared with each other in terms of some performance metrics taken from the literature. The results indicate that these strategies have significant influences on computational time, convergence, and diversity of generated Pareto optimal solutions.
Inventory control is one of the major issues in the field of operational research and production management. For this reason, it has been researched over the past several decades. Inventory planning and control systems manage what is needed and when. Most of the problems about this issue are modeled as single objective optimization as it aggregates several cost concepts and service level into a single objective. However, estimation of cost parameters for the stockout case with considering one objective is difficult in practice. Also, optimization of cost concepts and service level into one objective should not be modeled practically, because these objectives are conflicting with each other. Hence, researchers have studied various multi-objective approaches for these problems, over the past years, where scalar transformation of conflicting objectives can be avoided. Bookbinder and Chen (1992) analyzed multi-echelon inventory and distribution systems with a multi-criteria approach which uses MCDM concepts of exchange curve (analyzing of cycle stock investment and workload), optimal policy curve, and response surface. Agrell (1995) presented interactive multi-criteria framework for an inventory control decision support system that simultaneously determines lot size and safety stock or service level. This framework modeled the problem with no need to estimate the shortage cost that is being considered indirectly in the evaluation of the customer service. An interactive method optimizes a sequence of single objective optimization problems that finally results in an optimum solution such that the decision maker (DM) needs to be involved in every step of the algorithm. Puerto and Fernandez (1998) solved a multi-criteria deterministic and stochastic inventory control problem using advanced mathematical derivations for obtaining Pareto-optimal solution sets. Mandal, Roy, and Maiti (2005) applied geometric programming method to solve a multi-item multi-objective fuzzy inventory model for finding demand, lot size, and stock out level for each item. All the researches mentioned so far have used traditional preference-based or utility-based multi-objective optimization procedure. These approaches contradict our intuition that single objective optimization is a degenerate case of multi-objective optimization problem (MOOP) (Deb, 2001). Also MOOP does not have a solution that simultaneously optimizes all objectives. Therefore, a requirement to apply multi-objective optimizers to MOOPs is essential. Through these optimizers, a set of solutions are generated that are called non-dominated solutions. These efficient solutions are not superior to one and other in the objectives space. Non-dominance means that the improvement of one objective could only be provided at the loss of other objectives. Multi-objective optimizers and meta-heuristics like evolutionary algorithms or swarm intelligence methods have proved their ability to deal with MOOPs either convex objective space or non-convex objective space. In over recent years, multi-objective evolutionary algorithm like non-dominated sorting genetic algorithm-II (NSGAII) (Deb, Pratap, Agarwal, & Meyarivan, 2002), strength Pareto evolutionary algorithm-II (SPEAII) (Zitzler, Laumanns, & Thiele, 2001), etc. and also multi-objective particle swarm optimization (MOPSO) algorithms have been applied to solve MOOPs. Recently, Tsou, 2008 and Tsou, 2009 has applied some meta-heuristics such as MOPSO, multi-objective electromagnetism-like optimization (MOEMO) and strength Pareto evolutionary algorithm (SPEA) to resolve the multi-objective (r, Q) inventory system presented by Agrell (1995) that was mentioned earlier. Tsou (2008) employed MOPSO algorithm based on the seminal work of Coello-Coello and Lechuga (2002) to solve the inventory system that was mentioned and then used a ranking method of multi-attribute decision making (MADM) called TOPSIS ( Yoon & Hwang, 1995) to provide a sorting procedure of non-dominated solution and select a compromise solution to deliver to the decision maker. Tsou (2009) employed an improved version of MOPSO (IMOPSO). In IMOPSO, a local search is used to enhance the convergence to the Pareto-optimal front. Also a clustering technique is applied to the non-dominated archive to control archive size such that it can speed up the search and maintain diverse solutions by this technique. Then, IMOPSO was compared with MOEMO and SPEA. Regarding the results, the MOPSO was chosen as a better algorithm for solving the multi-objective (r, Q) inventory system. This paper tries to employ crowding distance factor (Reyes Sierra & Coello-Coello, 2005), ε-dominance concept ( Mostaghim & Teich, 2003) and a mutation operator to MOPSO for the inventory control problem by Agrell (1995). Then the results are compared with the works of Tsou, 2008 and Tsou, 2009. Mostaghim and Teich (2003) indicated that ε-dominance decreases computational time more than clustering techniques and has also influence on convergence and diversity of solutions created by MOPSO (in some cases even ε-dominance is better than clustering techniques). For this reason, by additionally applying crowding distance and mutation operator, we incorporate this concept instead of using clustering techniques into MOPSO for the multi-objective inventory control problem. The rest of the research is organized as follows: Section 2 describes the multi-objective inventory planning and control model mentioned earlier. Definitions of Pareto optimality and ε-dominance are mentioned in Section 3. Next we describe the MOPSO algorithms in Section 4. All the comparisons are presented in Section 5. Finally, we present our conclusions and future works in Section 6.
نتیجه گیری انگلیسی
Complexity and importance of MOOP and applying it to inventory control problems in the recent years have indicated that we should employ stronger and more efficient optimizer to generate the non-dominated (k, Q) solutions. This paper improves Pareto front of the multi objective (r, Q) inventory problem under backordering which had been generated by original MOPSO, using comparison of some improving strategies such as ε-dominance, crowding distance (CD) factor and mutation operator. Using ε-dominance concept instead of dominance concept has been proved in reducing computational time and also generating more diverse and closer non-dominated solutions to true Pareto front. Using CD in contrast of Grids line network system, and adding a mutation operator to the MOPSO algorithm. Hence, we have compared six MOPSO algorithms that have been established based on combinations of these strategies for solving the inventory problem. The comparison results regarding all metrics of assessment show that ε-dominance is the most influential strategy and next, CD and mutation operator, respectively, are influential in MOPSO for solving the inventory problem. Finally, through extensive comparison results, using MOPSO and all ε-dominance, CD and mutation operator together (MOPSO (CD + Mu + ε)), does outperform the other five MOPSOs in the multi-objective (r, Q) inventory control problem under backordering. Two ways could be rendered to extend this paper. One way could be changing the model to multi-item and multi-echelon or exchanging order policy to (R, T) and the other one is employment of other or newer