Soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems
|
|
- Tyler Carr
- 6 years ago
- Views:
Transcription
1 International Journal of Automation and Computing 04(1), January 2007, DOI: /s x Soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems Kai Leung Yung 1 Wai Hung Ip 1 Ding-Wei Wang 2 1 Department of Industrial and Systems Engineering, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, PRC 2 School of Information Science and Engineering, Northeastern University, Shenyang , PRC Abstract: Procurement planning with discrete time varying demand is an important problem in Enterprise Resource Planning (ERP). It can be described using the non-analytic mathematical programming model proposed in this paper. To solve the model we propose to use a fuzzy decision embedded genetic algorithm. The algorithm adopts an order strategy selection to simplify the original real optimization problem into binary ones. Then, a fuzzy decision quantification method is used to quantify experience from planning experts. Thus, decision rules can easily be embedded in the computation of genetic operations. This approach is applied to purchase planning problem in a practical machine tool works, where satisfactory results have been achieved. Keywords: control. Purchase planning, Enterprise Resource Planning (ERP), soft computing, genetic algorithm, fuzzy decision, inventory 1 Introduction Procurement planning is a key functional module in Enterprise Resource Planning (ERP) and Supply Chain Management (SCM) systems [1,2]. The optimization of material purchase planning can lead to savings in operating costs, guarantee material supply to production, and bring greater profits in manufacturing systems [3]. This is most important in regions of low labor cost, where material cost dominates the product cost structure. The procurement of purchase planning is to determine the optimal material stock replenishment strategy to minimize total cost (which consists of purchasing, ordering, and holding costs, and penalties for shortages). Traditional inventory control strategies are mostly based on the famous EOQ model and its various extensions [4]. The basic assumption of EOQ is that demand is independent and described by a mean value with unprotected white noise. In fact, it is assumed that demand is a constant equal to its mean. The issue of inventory control methods for time-varying demand has recently attracted a great deal of research interest. In the studies that have been conducted thus far, the demand rate is usually considered in terms of a linear, exponential, logconcave, or some other time-continuous or stock-dependent function [5 8]. Such studies have mainly focused on the theory of optimal order quantity or order strategy [9]. As a key functional module of ERP, procurement planning faces the situation of the discrete time problem. Its demand is no longer independent. Rather, it strongly depends on production planning or on material requirement planning (MRP). Procurement planning usually cannot be described as a simple analysis function of time. Via MRP, we can obtain the exact requirement of all materials for each day in a planning horizon. It is very popular for ma- Manuscript received November 18, 2005; revised February 25, This work was supported by Hong Kong Polytechnic University (No. G T363), and the National Natural Science Foundation of PRC (No , ). *Corresponding author. address: dwwang@mail.neu.edu.cn terial suppliers to give a big discount on purchase of large amounts of goods. But a larger purchase may lead to higher inventory and holding costs. Therefore, our problem is to study how to carry out optimal procurement planning to meet the material requirements of production and to minimize total cost including purchasing, ordering, and holding costs, and penalties for shortages with discrete time-varying demand and different discount prices. The above problem can be described as a mathematical programming model similar to a production planning model with variable demand [10]. However, owing to the existence of non-analysis factors such as discount prices, ordering costs, and penalties for shortages, the model cannot be solved using common mathematical programming methods. Various problems in procurement planning optimization have been discussed in the literature. The optimal procurement planning of equipment for semiconductor manufacturing and software components for enterprise information systems were introduced in [11,12]. Similar problems dealing with material procurement planning were solved using geometric programming and branch and bound approaches in [13,14] separately. Since Zadeh first introduced the concept of soft computing [15], it has caught the interest of many researchers [16,17]. The basic idea of soft computing is to use hybrid intelligent methods to quickly achieve an inexact solution rather than use an exact optimal solution via a long search [18]. Since GAs are good for adaptive studies and fuzzy logic can be used to solve complex problems using linguistic rule-based techniques [19 22], the combination of GA and fuzzy logic is one of the most promising available hybrid intelligent methods with which to solve complicated optimization problems [23,24]. Wang et al developed a fuzzy decision embedded genetic algorithm for the fuzzy due date bargaining problem and generalized the idea to the quantification of fuzzy rules [24,25]. This method has been successfully applied to some practical problems such as partner
2 K. L. Yung et al./soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems 81 selection, and production planning and scheduling [26,27]. To solve the procurement planning problem, we apply fuzzy decision embedded genetic algorithm again. By summing the experiences of planning makers, we propose new decision rules for the problem. To avoid complex real optimization, we conclude four order strategies for different situations of demand and inventory. These methods are all integrated into a procurement planning module. The results of the computation show us that the module has good potential to be embedded in ERP systems or be directly applied to purchase sections of practical enterprises. The remainder of this paper is organized as follows: A formal description of the problem and model are presented in Section 2. Possible order strategies and fuzzy decision rules are then discussed in Section 3. Section 4 introduces a decision embedded genetic algorithm. Computation examples are presented in Section 5. Finally, concluding remarks are provided in Section 6. 2 Problem description and model Assume the planning horizon is T. A manufacturer usually purchases n kinds of materials from a partner supplier. Via an MRP module in ERP, we know that the requirements for material i at time t are d i(t), i = 1, 2,, n, t = 1, 2,, T. The supplier will charge the manufacturer a constant ordering cost of A, if he/she orders any materials from the supplier. The holding cost for a unit of material i for a given time period is h i, i = 1, 2,, n. The initial inventory level of material i is I i(0), i = 1, 2,, n. Once a shortage of the material occurs, there is a shortage penalty cost of material i for a unit shortage and a unit time s i, i = 1, 2,, n. The purchasing cost for material i is discounted depending on the quantity of the order and is described by a segment function as follows: 8 >< c 1 i, Q 1 i q i Q 2 i c i(q i) = c 2 i, Q 2 i q i Q 3 i, i = 1, 2,, n (1) >: c 3 i, Q 3 i q i where c 1 i c 2 i c 3 i are the discounted costs for different order quantities of Q 1 i, Q 2 i and Q 3 i of material i, i = 1, 2,, n. The warehouse capacity of the manufacturer is limited to the volume V. The space volume of material i for one unit is v i, i = 1, 2,, n. Due to financial control by the manufacturer, there is a limitation of cash flow for purchase each day, of W. The objective of the manufacturer is to achieve optimal procurement planning (q i(t), i = 1, 2,, n, t = 1, 2,, T ) so as to minimize total cost including ordering, holding, and purchasing costs, and a possible shortage penalty. The problem can be described in terms of the following formula: min q Z(q) = T n n A sgn[ q i(t)] + {[c i(q i)q i(t)]+ t=1 h i i=1 i=1 t [q i(τ) d i(τ) + I i(0)] + + τ=1 s.t. n i=1 v i s i t [d i(τ) q i(τ) I i(0)] + } (2) τ=1 t [q i(τ) d i(τ) + I i(0)] + V τ=1 t = 1, 2,, T (3) n c i(q i)q i(t) W, t = 1, 2,, T (4) i=1 q i(t) 0, i, t (5) where [x] + means max{0, x}, and sgn{x} is the signal function, i.e. 8 >< 1, x > 0 sgn{x} = 0, x = 0. (6) >: 1, x < 0 We see that the first term in (2) the is the ordering cost. It applies when there are any order quantities greater than zero. The second is the purchasing cost, and the third and fourth are the holding cost and shortage penalty, respectively. Because the model includes some non-analytic terms such as [x] +, sgn{x}, and the segment function c i(q i), it cannot be solved using common mathematical programming. Therefore, an intelligent algorithm or soft computing method will be the only choice in order to obtain a solution. 3 Purchase strategies and fuzzy rules 3.1 Binary encoding scheme The above problem is a nonlinear and non-analysis constrained real optimization problem. The number of real variables q i(t), i = 1, 2,, n, t = 1, 2,, T is equal to n T. If we take these real variables as a gene representation, an optimum search would be very inefficient. Fortunately, planners can sum a limited number of different order strategies drawing on their experiences in a case where the next order point is determined. Therefore, we can encode the chromosomes of a genetic algorithm using a binary string. Let ( 1, period t is an order point x t = (7) 0, period t is not an order point where x t is the t-th gene of chromosome x. x t = 1 means that at least q i(t) > 0, i.e. the enterprise at least orders a kind of material in period t. Therefore, x = [x 1, x 2,, x T ] is the gene representation of the genetic algorithm. example with T = 7, x = [ ] For means there is an order in periods 1, 4, and 6. The binary encoding scheme is much simpler than the original real number encoding scheme. The gene number is just T rather than n T. The possible bit values are only 0 and 1 rather than the whole space of a positive real
3 82 International Journal of Automation and Computing 04(1), January 2007 number. The search process should be much easier than before. However, the problem remains of how to determine optimal order quantities for all materials in the case where the next point is fixed. 3.2 Order strategies in fixed order points By making reference to the experience of procurement planning makers, there are only three choices of possible order strategies for a material: no order, order just to meet demand, or order just discount points. Let t 0 and t 1 be the current and next order points, and D i be the requirement for material i from t 0 to (t 1 1), i.e. D i = k=t 0 d i(k). (8) L = t 1 t 0 is the duration length of this order cycle. I i(t 0 1) is the initial inventory of material i, i = 1, 2,, n. The possible order strategies for a material and its operating cost can be described as follows: 1) No order For a no order strategy, the order quantity is Its operating cost O 1 i is q i(t 0) = 0. (9) Oi 1 = {h i[i i(t 0 1) d i(τ)] + + k=t 0 τ=t 0 s i[ τ=t 0 d i(τ) I i(t 0 1)] }. (10) 2) Order just enough for the period For this strategy, the order quantity is Its operating cost is q i(t 0) = D i I i(t 0 1) (11) Oi 2 = D ic i(d i)+ h i[i i(t 0 1)+D i d i(τ)] +. (12) k=t 0 τ=t 0 We note that there is no shortage penalty. The order quantity is just the MRP order strategy to order the net requirement [1]. 3) Order in discount point Q 2 i For this strategy, no mater how much D i is, the order quantity is q i(t 0) = Q 2 i. (13) Its operating cost is Oi 3 =Q 2 i c 2 i + {h i[i i(t 0 1) + Q 2 i d i(τ)] + + k=t 0 τ=t 0 s i[ τ=t 0 d i(τ) Q 2 i I i(t 0 1)] + }. (14) 4) Order in discount point Q 3 i For this strategy, no mater how much D i is, the order quantity is q i(t 0) = Q 3 i. (15) Its operating cost is Oi 4 =Q 3 i c 3 i + {h i[i i(t 0 1) + Q 3 i d i(τ)] + + k=t 0 τ=t 0 s i[ τ=t 0 d i(τ) Q 3 i I i(t 0 1)] + }. (16) Once the operating cost for each possible order strategy is known, we can determine the best strategy by comparing their operating costs, i.e. if k i = arg min k {O k i, k = 1, 2, 3, 4} (17) the order strategy k i is taken for material i, i = 1, 2,, n. It is evident that the four possible order strategies cannot guarantee a global optimum, because the strategy for selection does not consider the effect of neighboring order cycles. 3.3 Fuzzy decision rules Although a genetic algorithm without a fuzzy rule can be used to solve our problem, its performance of computation is not very good. Therefore, we consider embedding fuzzy rules from people s previous experience so as to improve the performance of the GA. The basic idea of a fuzzy decision embedded genetic algorithm is to quantify fuzzy decision rules from people s experience [24,26,27]. The procedure of the quantification of fuzzy rules is to determine all factors necessary to effect decisions and to describe the rules of decisions through the fuzzy operation of these factors [24,26,27]. For our problem, factors required to effect decisions are listed as follows: Factor 1. A higher ordering cost for a given chromosome. Factor 2. A higher holding cost for a given chromosome. Factor 3. The existence of a penalty if daily purchase exceeds the amount of money allotted to the purchase. Factor 4. The existence of a penalty if total inventory exceeds stock capacity. Factor 5. A higher shortage cost for a given chromosome. Factor 6. A higher purchasing cost for a given chromosome. Factor 7. A lower total cost for a given chromosome. Within these factors, Factors 3 and 4 are crisp. Once the penalties for exceeding a purchase quota or warehouse capacity exist, the membership functions will be 1, otherwise 0. As we know, ordering cost and holding cost are contradictory; a higher ordering cost means more order times and a lower holding cost. Let Fmin 1 and Fmax 2 be the ordering cost and holding cost in a feasible solution with the fewest order times, respectively. Let Fmax 1 and Fmin 2 be the ordering cost and holding cost of the feasible solution with maximum allowed order times. Under these conditions, a pair of fuzzy factors can be described by the following membership functions: 8 1, z Fmax >< 1 (z F µ F1 (z) = min) 1 (Fmax >: 1 Fmin 1 ), F min 1 z < Fmax 1 (18) 0, z < Fmin 1
4 K. L. Yung et al./soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems 83 and 8 1, z Fmax >< 2 (z F µ F2 (z) = min) 2 (Fmax >: 2 Fmin 2 ), F min 2 z < Fmax 2 0, z < Fmin 2 (19) where F 1 and F 2 stand for fuzzy factors 1 and 2. The curves of the two membership functions are shown in Fig. 1. so as to reach feasibility. Rule 2 means that if there is a higher shortage or lower ordering cost and higher holding cost, then we should take Decision 2, i.e. add one more order. Rule 3 means that if there is a higher purchasing cost (no discount) or lower holding cost and higher ordering cost, then we should take Decision 3, i.e. delete one time of order. Rule 4 is simple; it states that if the total operating cost is lower, the chromosome is a better chromosome and should remain unchanged. These decision rules can be described in terms of the following formulas: µ D1 = max{µ F3, µ F4 } (20) µ D2 = max{µ F5, µ F2 (1 µ F1 )} (21) µ D3 = max{µ F6, µ F1 (1 µ F2 )} (22) µ D4 = µ F7. (23) Therefore, according to the decision selection method of fuzzy decision quantification, if k = arg max{µ D1, µ D2, µ D3, µ D4 } (24) (a) The membership function of Factor 1 to improve the given chromo- then we select Decision k some. 4 Fuzzy decision embedded genetic algorithm (b) The membership function of Factor 2 Fig. 1 The membership functions of Factors 1 and 2 Similarly, we can determine membership functions for the other fuzzy factors 5, 6, and 7. By making reference to the experience of experts, four possible decisions for improving purchase planning were acquired as follows: Decision 1. Repair the feasibility of a chromosome. Decision 2. Add one time of order to a chromosome. Decision 3. Delete one time of order from a chromosome. Decision 4. Keep a chromosome unchanged. These decision rules can be described using IF..., THEN.... statements as follows: Rule 1. IF (F 3 F 4), THEN D 1. Rule 2. IF ( F 5 F C 1 F 2), THEN D 2. Rule 3. IF ( F 6 F C 2 F 1), THEN D 3. Rule 4. IF ( F 7), THEN D 4. where F C is the complementary factor of Factor F, is the operation to select the maximum value, and is the multiplication operation of the factors. Rule 1 means that penalties for exceeding money quota or warehouse capacity exist. Therefore, we need to take Decision 1 to improve the purchase planning or chromosome, Fig. 2 A flowchart of GA/ FD The basic procedure for the recommended fuzzy decision embedded genetic algorithm is to select the best order point
5 84 International Journal of Automation and Computing 04(1), January 2007 (a) Material 1 (b) Material 2 (c) Material 3 Fig. 3 The demand, purchases and inventories of three materials
6 K. L. Yung et al./soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems 85 combination by the genetic process. For each chromosome with fixed order points, we determine the best order strategy with a lower operating cost for each order cycle. After the order strategies for all order cycles of the chromosome are fixed, we calculate its ordering, holding, and purchasing costs, and shortage penalty, and check its feasibility. Then, we call the fuzzy decision subroutine to improve the chromosome. Therefore, the computation performance of the genetic algorithm can be greatly advanced. For the genetic algorithm, we adopt two cutting crossover and an altering mutation as genetic operators, proportional selection as a selection strategy, and give a maximum generation number as a stopping criterion [20,22]. The linear scaled objective value of (2) is taken as a fitness function [20,22]. The step-by-step procedure for GA/FD can be described as follows: Step 1. Specify the parameters: population size NP, the maximum number of generations NG, crossover probability P c, and mutation probability P m. Step 2. Generate an initial population x(j), j = 1, 2,, NP, randomly. Set the iteration index K = 0. Step 3. Based on the initial population and on the experience of decision-makers, determine parameters to describe the fuzzy factors: Fmin, k Fmax, k k = 1, 2, 5, 6, 7. Step 4. For chromosome x(j), j = 1, 2,, NP, determine the best order strategy for each order cycle (by comparing their costs calculated using formulas (10), (12), (14), and (16)). Calculate the ordering, holding, purchasing, and shortage costs, and total costs Z(j). Step 5. K K +1, if K > NG, go to Step 10; otherwise, perform the following Steps 6 9. Step 6. Call the fuzzy decision subroutine to calculate the membership values of all factors and select the best decision to improve the chromosome. Calculate the total cost of the revised chromosome z (j). Step 7. If z (j) < z(j), replace the original chromosome by the revised one; otherwise, maintain the original unchanged. Step 8. According to the probabilities P c and P m, select chromosomes to perform crossover and mutation. Step 9. Use proportional selection to update the population. Update the best achieved solution x and best value z. Go to Step 4. Step 10. Output the best achieved solution x and best value z, then stop. A flowchart of the fuzzy decision embedded genetic algorithm is shown in Fig. 2. Note that Steps 1 3 initialize the algorithm and generate the initial population of the GA. Step 4 is the stopping criterion. Steps 5 9 are the backbone of the GA/FD. Among them: Step 5 determines the order strategies for all order cycles; Step 6 uses a fuzzy decision to improve the chromosome; Step 7 checks if the improvement is better than the original; Steps 8 and 9 are the common steps of a genetic algorithm for genetic operations and updating the population, while the final Step 10 outputs the achieved result. 5 Numerical analysis The algorithm was coded via FORTRAN 90 and executed on a Pentium IV/2.60G computer. Satisfactory results were achieved. A practical example from a machine tool works was conducted as follows. An enterprise was contracted to a material supplier for three kinds of materials. The planning horizon was 30 days. The fixed ordering cost for each order was 50 (the unit of currency was the RMB of China). The money quota for daily purchase was 500. The warehouse capacity was 480. The discount levels and prices for all materials are shown in Table 1. Table 1 Discount levels and prices of purchasing materials Material i Level Q 1 i Price c 1 i Level Q 2 i Price c 2 i Level Q 3 i Price c 3 i The holding costs, shortage penalties, volumes of unit materials and initial inventory levels are shown in Table 2. Table 2 Data for holding cost, shortage penalty, volume, and initial inventory Material i Holding Cost h i Shortage Penalty s i Unit Volume v i Initial Inventory I i(0) From the MRP module, we obtained the daily demands for each material as shown in Table 3. Table 3 The daily demands for all materials from ERP Day t d 1(t) d 2(t) d 3(t)
7 86 International Journal of Automation and Computing 04(1), January 2007 The parameters of the genetic algorithm were: NP = 100, NG = 800, P c = 0.80, and P m = The best solution achieved is shown in Table 4. The daily purchase money requirement and daily total volume of the inventory are shown in Table 5. The best value was Table 4 Best achieved purchase planning Order Point t q 1(t) q 2(t) q 3(t) From Table 5, it can be seen that the daily money requirement and total volume are both not over quota or warehouse capacity. The demands, purchases, and inventory levels of the three kinds of materials are shown in Fig. 3. From the figure, it can be seen that there are eight orders in the planning horizon. Each purchase makes an order period. For each order period, the final inventory is always zero. Due to a higher shortage penalty, a shortage never occurs in this kind of planning. When comparing the three kinds of materials, the purchase amount of material 3 is not usually large. This is because its holding cost is higher than those of the others. Since a heuristic order strategy and fuzzy decision rules are used in this recommended approach, the achieved result is not guaranteed to be optimal. But the recommended approach can quickly and efficiently reach the best solution in a short time. This is simply a characteristic of soft computing. Table 5 Daily purchase money and inventory volume of the solution Day t Purchase Inventory Day t Purchase Inventory money volume money volume Conclusions This research in modeling and optimization for purchase planning in ERP has led us to the following conclusions: 1) The procurement planning problem with a discrete time varying demand is a typical peculiarity of ERP. The proposed mathematical model can describe this kind of problem very well. 2) The proposed methods for order strategy selection and fuzzy decision rules can simplify planning optimization procedures. Therefore, a fuzzy decision embedded genetic algorithm can solve problems of a practical size quickly and efficiently. 3) Since heuristics are adopted in the recommended approach, the algorithm cannot guarantee the optimality of its solution. We think that it is a characteristic of soft computing that searches for inexact solutions quickly and efficiently. References [1] S. Avraham. Enterprise Resource Planning (ERP): the Dynamics of Operations Management, Kluwer Academic Publishers, Boston, [2] S. Biswas, Y. Narahari. Object Oriented Modeling and Decision Support for Supply Chains. European Journal of Operational Research, vol. 153, no. 3, pp , [3] W. H. Ip, Y. Li, K. F. Man, K. S. Tang. Multi-product Planning and Scheduling Using Genetic Algorithm Approach. Computers & Industrial Engineering, vol. 38, no. 3, pp , [4] E. A. Silver, R. Peterson. Decision Systems for Inventory Management and Production Planning, John Wiley & Sons, New York, [5] Z. T. Balkhi, L. Benkhrouf. On the Optimal Replenishment Schedule for an Inventory System with Deteriorating Items and Time-varying Demand and Production Rates. Computers and Industrial Engineering, vol. 30, no. 4, pp , [6] Z. T. Balkhi, L. Benkherouf. On an Inventory Model for Deteriorating Items with Stock Dependent and Time-varying Demand Rates. Computers & Operations Research, vol. 31, no. 2, pp , [7] J. T. Teng, H. J. Chang, C. Y. Dye, C. H. Hung. An Optimal Replenishment Policy for Deteriorating Items with Timevarying Demand and Partial Backlogging. Operations Research Letters, vol. 30, no. 6, pp , [8] Y. W. Zhou. A Multi-warehouse Inventory Model for Items with Time-varying Demand and Shortages. Computers & Operations Research, vol. 30, no. 14, pp , [9] J. Tang, R. Fung, K. L. Yung, D. Wang. Dependent Policy for Order Quantity Problems with Time-varying Demands. In Proceedings of IEEE Conference on Decision and Control, Florida, USA, pp , [10] J. F. Bard, J. T. Moore. Production Planning with Variable Demand. Omega, vol. 18, no. 1, pp , [11] B. Catay, S. S. Erenguc, A. J. Vakharia. Tool Capacity Planning in Semiconductor Manufacturing. Computers & Operations Research, vol. 30, no. 9, pp , [12] R. P. Sundarraj, S. Talluri. A Multi-period Optimization Model for the Procurement of Component-based Enterprise Information Technologies. European Journal of Operational Research, vol. 146, no. 2, pp , [13] M. O. Abuo-El-Ata, H. A. Fergany, M. F. El-Wakeel. Probabilistic Multi-item Inventory Model with Varying Order Cost under Two Restrictions: A Geometric Programming Approach. International Journal of Production Economics, vol. 83, no. 2, pp , [14] A. Martel, M. Diaby, F. Boctor. Multiple Items Procurement under Stochastic Nonstationary Demands. European Journal of Operational Research, vol. 87, no. 1, pp , [15] L. A. Zadeh. Fuzzy Logic, Neural Networks, and Soft Computing. Communication of the ACM, vol. 37, no. 1, pp , [16] J. R. R. Jang, C. T. Sun, E. Mizutani. Neuro-Fuzzy and Soft Computing. Prentice-Hall, Englewood Cliffs, NJ, [17] M. Papadrakakis, N. D. Lagaros. Soft Computing Methodologies for Structural Optimization. Applied Soft Computing, vol. 3, no. 4, pp , [18] L. C. Jain. Fuzzy Logic in Engineering, Soft Computing Techniques in Knowledge-Based Intelligent Engineering Systems. L. C. Jain, Ed., Physica-Verlag, Heidelberg, pp , [19] S. C. Fang, D. Wang. Fuzzy Mathematics and Fuzzy Optimization. Science Press, Beijing, (in Chinese)
8 K. L. Yung et al./soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems 87 [20] M. Gen, R. Cheng. Genetic Algorithms and Engineering Design. Wiley, New York, [21] J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, [22] Z. Michalewicz. Genetic Algorithms + Data + Structures = Evolution Programs. 2nd ed., Springer-Verlag, New York, [23] H. J. Zimmermann. Fuzzy Set Theory and Its Applications. Kluwer-Nijhoff, Hinghum, Netherlands, [24] D. Wang, S. C. Fang, H. L. W. Nuttle. Soft Computing for Multi-customer Due-date Bargaining. IEEE Transactions on Systems, Man, and Cybernetics Part C, vol. 29, no. 4, pp , [25] Y. Yi, D. Wang. Soft Computing for Scheduling with Batch Setup Times and Earliness-tardiness Penalties on Parallel Machines. Journal of Intelligent Manufacturing, vol. 14, no. 3-4, pp , [26] D. Wang, K. L. Yung, W. H. Ip. A Heuristic Genetic Algorithm for Subcontractor Selection in a Global Manufacturing Environment. IEEE Transactions on Systems, Man, and Cybernetics Part C, vol. 31, no. 2, pp , [27] D. Wang, K. L.Yung, W. H. Ip. Partner Selection Model and Soft Computing Approach for Dynamic Alliance of Enterprises. Science in China: Series F, vol. 45, no. 1, pp , Kai Leung Yung received his B.Sc. degree from Brighton University, UK, in 1975, the M.Sc degree from Imperial College of Sci. & Tech., University of London, UK, in 1976, and the Ph.D. degree from Plymouth University, UK, in He has worked for BOC Advanced Welding Co. Ltd., British Ever Ready Group, and the Cranfield Unit for Precision Engineering, in UK. He is currently the associate head and professor of the Department of Industrial and Systems Engineering, the Hong Kong Polytechnic University. His research interests include precision motion control, systems aspects of computer integrated manufacturing and management, and logistic planning and optimization. Wai Hung Ip received his M.Sc degree in industrial engineering from Cranfield University, U. K., and the MBA degree from Brunel University, U. K. He was awarded Ph. D. degree in manufacturing engineering from Loughborough University, UK, in He is currently an associate professor at the Department of Industrial and Systems Engineering, the Hong Kong Polytechnic University. His research interests include AI-based optimization and decision making, information systems and decision support systems. Ding-Wei Wang received his B.Sc. degree from Northeastern University, China, in 1982, the M.Sc degree from Huazhong University of Science and Technology, China, in 1984, and the Ph.D. degree from Northeastern University, China, in He had worked as a postdoctor with North Carolina State University, USA. He is currently a professor of the Institute of Systems Engineering, Northeastern University, China. His research interests include ERP/MRP- II/JIT, modeling and optimization, production planning and scheduling, fuzzy optimization, and soft computing.
Supply Chain Network Design under Uncertainty
Proceedings of the 11th Annual Conference of Asia Pacific Decision Sciences Institute Hong Kong, June 14-18, 2006, pp. 526-529. Supply Chain Network Design under Uncertainty Xiaoyu Ji 1 Xiande Zhao 2 1
More informationA Genetic Algorithm for Order Picking in Automated Storage and Retrieval Systems with Multiple Stock Locations
IEMS Vol. 4, No. 2, pp. 36-44, December 25. A Genetic Algorithm for Order Picing in Automated Storage and Retrieval Systems with Multiple Stoc Locations Yaghoub Khojasteh Ghamari Graduate School of Systems
More informationEvolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints
Evolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints Tzung-Pei Hong 1, 2, Pei-Chen Sun 3, and Sheng-Shin Jou 3 1 Department of Computer Science and Information Engineering
More informationAn Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems
An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems Son Duy Dao, Kazem Abhary, and Romeo Marian Abstract Traveling salesman problem (TSP) is an important optimization problem in
More informationRecessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation
Recessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation Amr Madkour, Alamgir Hossain, and Keshav Dahal Modeling Optimization Scheduling And Intelligent Control (MOSAIC)
More informationWhat is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...
What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually
More informationEvolutionary Computation
Evolutionary Computation Evolution and Intelligent Besides learning ability, intelligence can also be defined as the capability of a system to adapt its behaviour to ever changing environment. Evolutionary
More informationThis is a refereed journal and all articles are professionally screened and reviewed
Advances in Environmental Biology, 6(4): 1400-1411, 2012 ISSN 1995-0756 1400 This is a refereed journal and all articles are professionally screened and reviewed ORIGINAL ARTICLE Joint Production and Economic
More informationA Decision-Making Process for a Single Item EOQ NLP Model with Two Constraints
American Journal of Business, Economics and Management 205; 3(5): 266-270 Published online September 7, 205 (http://www.openscienceonline.com/journal/ajbem) A Decision-Making Process for a Single Item
More informationEVOLUTIONARY ALGORITHMS AT CHOICE: FROM GA TO GP EVOLŪCIJAS ALGORITMI PĒC IZVĒLES: NO GA UZ GP
ISSN 1691-5402 ISBN 978-9984-44-028-6 Environment. Technology. Resources Proceedings of the 7 th International Scientific and Practical Conference. Volume I1 Rēzeknes Augstskola, Rēzekne, RA Izdevniecība,
More informationOptimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2017 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Optimizing
More informationIMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM
IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM TWINKLE GUPTA* Department of Computer Science, Hindu Kanya MahaVidyalya, Jind, India Abstract We are encountered with various optimization
More informationProcedia - Social and Behavioral Sciences 109 ( 2014 )
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Sciences 109 ( 2014 ) 1059 1063 2 nd World Conference On Business, Economics And Management - WCBEM 2013 * Abstract
More informationModeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach
Modeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach B. Fahimnia, L.H.S. Luong, and R. M. Marian Abstract The Aggregate Production Plan (APP) is a schedule of the organization
More informationJun Pei. 09/ /2009 Bachelor in Management Science and Engineering
Jun Pei School of Management, Hefei University of Technology Tunxi Road 193, Hefei City, Anhui province, China, 230009 Email: peijun@hfut.edu.cn; feiyijun198612@126.com; feiyijun.ufl@gmail.com Phone: (86)
More informationStorage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach
Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling
More informationA Single Item Non Linear Programming (NLP) Economic Order Quantity Model with Space Constraint
A Single Item Non Linear Programming (NLP) Economic Order Quantity Model with Space Constraint M. Pattnaik Dept. of Business Administration Utkal University, Bhubaneswar, India monalisha_1977@yahoo.com
More informationStudy of Optimization Assigned on Location Selection of an Automated Stereoscopic Warehouse Based on Genetic Algorithm
Open Journal of Social Sciences, 206, 4, 52-58 Published Online July 206 in SciRes. http://www.scirp.org/journal/jss http://dx.doi.org/0.4236/jss.206.47008 Study of Optimization Assigned on Location Selection
More informationA Fuzzy Optimization Model for Single-Period Inventory Problem
, July 6-8, 2011, London, U.K. A Fuzzy Optimization Model for Single-Period Inventory Problem H. Behret and C. Kahraman Abstract In this paper, the optimization of single-period inventory problem under
More informationLot Sizing for Individual Items with Time-varying Demand
Chapter 6 Lot Sizing for Individual Items with Time-varying Demand 6.1 The Complexity of Time-Varying Demand In the basic inventory models, deterministic and level demand rates are assumed. Here we allow
More informationA Multi-Period MPS Optimization Using Linear Programming and Genetic Algorithm with Capacity Constraint
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 08, Issue 01 (January. 2018), V1 PP 85-93 www.iosrjen.org A Multi-Period MPS Optimization Using Linear Programming and
More informationJournal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM
Volume, No. 5, December 00 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING
More informationJun Pei. 09/ /2009 Bachelor in Management Science and Engineering
Jun Pei Ph.D; Assistant Professor School of Management, Hefei University of Technology Tunxi Road 193, Hefei City, Anhui province, China, 230009 Email: peijun@hfut.edu.cn; feiyijun198612@126.com; feiyijun.ufl@gmail.com
More informationDesigning a New Particle Swarm Optimization for Make-with-Buy Inventory Model
Proceedings of the 14 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 14 Designing a New Particle Swarm Optimization for Make-with-Buy Inventory
More informationMulti-Plant Multi-Product Aggregate Production Planning Using Genetic Algorithm
Multi-Plant Multi-Product Aggregate Production Planning Using Genetic Algorithm Fahron Dakka, Muhammad Aswin, Bambang Siswojo Abstract Aggregate production planning (APP) is a mid-term planning tool used
More informationGlobal Logistics Road Planning: A Genetic Algorithm Approach
The Sixth International Symposium on Operations Research and Its Applications (ISORA 06) Xinjiang, China, August 8 12, 2006 Copyright 2006 ORSC & APORC pp. 75 81 Global Logistics Road Planning: A Genetic
More informationAn Inventory Cost Model of a Government Owned Facility using Fuzzy Set Theory
An Cost Model of a Government Owned Facility using Fuzzy Set Theory Derek M. Malstrom, Terry R. Collins, Ph.D., P.E., Heather L. Nachtmann, Ph.D., Manuel D. Rossetti, Ph.D., P.E Department of Industrial
More informationManagement Science Letters
Management Science Letters 4 (2014) 2057 2064 Contents lists available at GrowingScience Management Science Letters homepage: www.growingscience.com/msl Predicting product life cycle using fuzzy neural
More information10. Lecture Stochastic Optimization
Soft Control (AT 3, RMA) 10. Lecture Stochastic Optimization Genetic Algorithms 10. Structure of the lecture 1. Soft control: the definition and limitations, basics of epert" systems 2. Knowledge representation
More informationInternational Series in Operations Research & Management Science
International Series in Operations Research & Management Science Volume 143 Series Editor: Frederick S. Hillier Stanford University For further volumes: http://www.springer.com/series/6161 T.C. Edwin
More informationGenerational and steady state genetic algorithms for generator maintenance scheduling problems
Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.
More informationA Tabu Genetic algorithm with Search Area Adaptation for the Job-Shop Scheduling Problem
Proceedings of the 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases, Corfu Island, Greece, February 16-19, 2007 76 A Tabu Genetic algorithm with Search Area Adaptation
More informationExpert Systems with Applications
Expert Systems with Applications 39 (2012) 1306 1314 Contents lists available at SciVerse ScienceDirect Expert Systems with Applications journal homepage: www.elsevier.com/locate/eswa A genetic algorithm
More informationRouting Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA
Journal of Industrial Engineering and Management JIEM, 2014 7(5) : 1097-1111 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.1126 Routing Optimization of Fourth Party Logistics
More informationA HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING
A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING PROF. SARVADE KISHORI D. Computer Science and Engineering,SVERI S College Of Engineering Pandharpur,Pandharpur,India KALSHETTY Y.R. Assistant Professor
More informationA Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem
www.ijcsi.org 8 A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem Maryam Mohammadi, Masine Md. Tap Department of Industrial Engineering, Faculty of Mechanical Engineering,
More informationMinimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA
, June 30 - July 2, 2010, London, U.K. Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA Imran Ali Chaudhry, Sultan Mahmood and Riaz
More informationOPTIMIZATION AND OPERATIONS RESEARCH Vol. IV - Inventory Models - Waldmann K.-H
INVENTORY MODELS Waldmann K.-H. Universität Karlsruhe, Germany Keywords: inventory control, periodic review, continuous review, economic order quantity, (s, S) policy, multi-level inventory systems, Markov
More informationExpert System for Mixed-Model Assembly Line Balancing
Expert System for Mixed-Model Assembly Line Balancing Suphasak Phonganant Department of Mechanical Engineering, Faculty of Engineering, Thonburi University Abstract A heuristic for solving the mixed-model
More informationA HYBRID MODERN AND CLASSICAL ALGORITHM FOR INDONESIAN ELECTRICITY DEMAND FORECASTING
A HYBRID MODERN AND CLASSICAL ALGORITHM FOR INDONESIAN ELECTRICITY DEMAND FORECASTING Wahab Musa Department of Electrical Engineering, Universitas Negeri Gorontalo, Kota Gorontalo, Indonesia E-Mail: wmusa@ung.ac.id
More informationCOMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO
COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam
More informationAvailable online at International Journal of Current Research Vol. 9, Issue, 07, pp , July, 2017
z Available online at http://www.journalcra.com International Journal of Current Research Vol. 9, Issue, 07, pp.53529-53533, July, 2017 INTERNATIONAL JOURNAL OF CURRENT RESEARCH ISSN: 0975-833X RESEARCH
More informationProcedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and ehavioral Sciences 189 ( 2015 ) 184 192 XVIII Annual International Conference of the Society of Operations Management (SOM-14)
More informationComputers Play the Beer Game: Can Artificial Agents Manage Supply Chains? 1
Computers Play the Beer Game: Can Artificial Agents Manage Supply Chains? 1 Steven O. Kimbrough The Wharton School, University of Pennsylvania, Philadelphia, PA 194, USA Sok@grace.wharton.upenn.edu D.J.
More informationModeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms
Computer Technology and Application 2 (2011) 487-499 Modeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms Son
More informationInternational Journal of Industrial Engineering Computations
International Journal of Industrial Engineering Computations 4 (213 437 446 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/ijiec
More informationDesign and Implementation of Genetic Algorithm as a Stimulus Generator for Memory Verification
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 9, September, 2015, PP 18-24 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Design and Implementation of Genetic
More informationCHAPTER 3 RESEARCH METHODOLOGY
72 CHAPTER 3 RESEARCH METHODOLOGY Inventory management is considered to be an important field in Supply chain management. Once the efficient and effective management of inventory is carried out throughout
More informationSupplemental Digital Content. A new severity of illness scale using a subset of APACHE data elements shows comparable predictive accuracy
Supplemental Digital Content A new severity of illness scale using a subset of APACHE data elements shows comparable predictive accuracy Alistair E. W. Johnson, BS Centre for Doctoral Training in Healthcare
More informationMulti-product inventory optimization in a multiechelon supply chain using Genetic Algorithm
Multi-product inventory optimization in a multiechelon supply chain using Genetic Algorithm T.V.S.R.K.Prasad 1, Sk.Abdul Saleem 3, C.Srinivas 2,Kolla srinivas 4 1 Associate Professor, 3 Assistant Professor,
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
More informationIntroduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST
Introduction to Artificial Intelligence Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Chapter 9 Evolutionary Computation Introduction Intelligence can be defined as the capability of a system to
More informationCHAPTER 3 FUZZY LOGIC BASED FRAMEWORK FOR SOFTWARE COST ESTIMATION
CHAPTER 3 FUZZY LOGIC BASED FRAMEWORK FOR SOFTWARE COST ESTIMATION The Fuzzy Logic System is one of the main components of soft computing, the field in computer science that deals with imprecision, uncertainty,
More informationComputational Intelligence Lecture 20:Intorcution to Genetic Algorithm
Computational Intelligence Lecture 20:Intorcution to Genetic Algorithm Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2012 Farzaneh Abdollahi Computational
More informationPerformance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray Value
American Journal of Applied Sciences 9 (8): 1268-1272, 2012 ISSN 1546-9239 2012 Science Publications Performance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray Value 1 Vishnu Raja, P.
More informationGenetic Algorithm: A Search of Complex Spaces
Genetic Algorithm: A Search of Complex Spaces Namita Khurana, Anju Rathi, Akshatha.P.S Lecturer in Department of (CSE/IT) KIIT College of Engg., Maruti Kunj, Sohna Road, Gurgaon, India ABSTRACT Living
More informationA Genetic Algorithm Applying Single Point Crossover and Uniform Mutation to Minimize Uncertainty in Production Cost
World Applied Sciences Journal 23 (8): 1013-1017, 2013 ISSN 1818-4952 IDOSI Publications, 2013 DOI: 10.5829/idosi.wasj.2013.23.08.956 A Genetic Algorithm Applying Single Point Crossover and Uniform Mutation
More informationMulti-objective Evolutionary Optimization of Cloud Service Provider Selection Problems
Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Cheng-Yuan Lin Dept of Computer Science and Information Engineering Chung-Hua University Hsin-Chu, Taiwan m09902021@chu.edu.tw
More informationA Variable Capacity Parallel Machine Scheduling Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Variable Capacity Parallel Machine Scheduling Problem Emine Akyol
More informationA Diagnostic Approach to Scheduling
Harish C Bahl * Neelam Bahl California State University, Chico, CA, U.S.A. Several algorithms and methodologies have been proposed for a variety of environments. In this paper, we suggest a diagnostic
More informationKeywords COCOMO model, cost estimation, genetic algorithm, ant colony optimization.
Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com COCOMO model
More informationTechUpdate. TechUpdate is published quarterly and is available exclusively at By: Michael L. Gonzales HandsOn-BI, LLC Quarter 1, 2006
TechUpdate TechUpdate is published quarterly and is available exclusively at www.tdwi.org. By: Michael L. Gonzales HandsOn-BI, LLC Quarter 1, 2006 See Technology Update Live! with Michael L. Gonzales at
More informationProceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds
Proceedings of the 0 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds OPTIMAL BATCH PROCESS ADMISSION CONTROL IN TANDEM QUEUEING SYSTEMS WITH QUEUE
More informationSolving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm
International Journal of Industrial Engineering, 16(1), 23-31, 2009. Solving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm Jen-Shiang Chen 1, Jason Chao-Hsien Pan
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 17: Genetic Algorithms and Evolutionary Computing Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationAPPLICATION OF COMPUTER FOR ANALYZING WORLD CO2 EMISSION
APPLICATION OF COMPUTER FOR ANALYZING WORLD CO2 EMISSION M. Kavoosi 1, B.shafiee 2 1 Department of Computer Engineering, Izeh Branch, Islamic Azad University, Izeh, Iran 1 E-mail address: Hakavoosi@yahoo.com
More informationIntelligent Techniques Lesson 4 (Examples about Genetic Algorithm)
Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Numerical Example A simple example will help us to understand how a GA works. Let us find the maximum value of the function (15x - x 2
More informationThe Weapon Target Assignment Strategy Research on Genetic Algorithm
2010 3rd International Conference on Computer and Electrical Engineering (ICCEE 2010) IPCSIT vol. 53 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V53.No.1.75 The Weapon Target Assignment
More informationAn Evolutionary Solution to a Multi-objective Scheduling Problem
, June 30 - July 2,, London, U.K. An Evolutionary Solution to a Multi-objective Scheduling Problem Sumeyye Samur, Serol Bulkan Abstract Multi-objective problems have been attractive for most researchers
More informationThe Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku
The Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku Nordin Abu Bakar, Muhammad Fadhil Mahadzir Faculty of Computer & Mathematical
More informationResearch Article Genetic Algorithm for Job Scheduling with Maintenance Consideration in Semiconductor Manufacturing Process
Mathematical Problems in Engineering Volume 212, Article ID 875641, 16 pages doi:1.1155/212/875641 Research Article Genetic Algorithm for Job Scheduling with Maintenance Consideration in Semiconductor
More informationPARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM
PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM Dr.V.Selvi Assistant Professor, Department of Computer Science Mother Teresa women s University Kodaikanal. Tamilnadu,India. Abstract -
More informationGenetic algorithms. History
Genetic algorithms History Idea of evolutionary computing was introduced in the 1960s by I. Rechenberg in his work "Evolution strategies" (Evolutionsstrategie in original). His idea was then developed
More informationGenetic Algorithm to Dry Dock Block Placement Arrangement Considering Subsequent Ships
Genetic Algorithm to Dry Dock Block Placement Arrangement Considering Subsequent Ships Chen Chen 1, Chua Kim Huat 2, Yang Li Guo 3 Abstract In this paper, a genetic algorithm (GA) is presented in order
More informationSustainable sequencing of N jobs on one machine: a fuzzy approach
44 Int. J. Services and Operations Management, Vol. 15, No. 1, 2013 Sustainable sequencing of N jobs on one machine: a fuzzy approach Sanjoy Kumar Paul Department of Industrial and Production Engineering,
More informationA Simulation-based Multi-level Redundancy Allocation for a Multi-level System
International Journal of Performability Engineering Vol., No. 4, July 205, pp. 357-367. RAMS Consultants Printed in India A Simulation-based Multi-level Redundancy Allocation for a Multi-level System YOUNG
More informationCombinatorial Optimization Model for Group Decision-Making
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 18, No 2 Sofia 2018 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2018-0028 Combinatorial Optimization Model
More informationGENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.
GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary
More informationSingle machine scheduling with two agents for total completion time objectives
Lecture Notes in Management Science (2016) Vol. 8, 106 112 ISSN 2008-0050 (Print), ISSN 1927-0097 (Online) Single machine scheduling with two agents for total completion time objectives Yuvraj Gajpal 1
More informationStructured System Analysis Methodology for Developing a Production Planning Model
Structured System Analysis Methodology for Developing a Production Planning Model Mootaz M. Ghazy, Khaled S. El-Kilany, and M. Nashaat Fors Abstract Aggregate Production Planning (APP) is a medium term
More informationHybridization of Genetic Algorithm and Neural Network for Optimization Problem
Hybridization of Genetic Algorithm and Neural Network for Optimization Problem Gaurang Panchal, Devyani Panchal Abstract The use of both, genetic algorithms and artificial neural networks, were originally
More informationA Genetic Algorithm on Inventory Routing Problem
A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract
More informationA HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING
DAAAM INTERNATIONAL SCIENTIFIC BOOK 2010 pp. 549-558 CHAPTER 48 A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING BANCILA, D.; BUZATU, C. & FOTA, A. Abstract: Starting
More informationDesign of artificial neural networks using a genetic algorithm to predict saturates of vacuum gas oil
8 DOI: 0.007/s8-00-005-y Design of artificial neural networks using a genetic algorithm to predict saturates of vacuum gas oil Dong Xiucheng, Wang Shouchun, Sun Renjin and Zhao Suoqi School of Business
More informationResearch on Optimization of Delivery Route of Online Orders
Frontiers in Management Research, Vol. 2, No. 3, July 2018 https://dx.doi.org/10.22606/fmr.2018.23002 75 Research on Optimization of Delivery Route of Online Orders Zhao Qingju School of Information Beijing
More informationProduction Management Modelling Based on MAS
International Journal of Automation and Computing 7(3), August 2010, 336-341 DOI: 10.1007/s11633-010-0512-x Production Management Modelling Based on MAS Li He 1 Zheng-Hao Wang 2 Ke-Long Zhang 3 1 School
More informationThe Role of Items Quantity Constraint to Control the Optimal Economic Order Quantity
Modern Applied Science; Vol. 11, No. 9; 2017 ISSN 1913-1844 E-ISSN 1913-1852 Published by Canadian Center of Science and Education The Role of Items Quantity Constraint to Control the Optimal Economic
More informationUsing Neural Network and Genetic Algorithm for Business Negotiation with Maximum Joint Gain in E-Commerce
EurAsia-ICT 2002, Shiraz-Iran, 29-3 Oct. Using Neural Networ and Genetic Algorithm for Business Negotiation with Maximum Joint Gain in E-Commerce Mohammad Gholypur Pazand Samaneh Information Technology
More informationA Method for Determining Inventory Policy Parameters for a Single Product under Limited Space
A Method for Determining Inventory Policy Parameters for a Single Product under Limited Space Doan Trinh Nguyen #1, Jirachai Buddhakulsomsiri #2, Kanokwan Singha #3 # School of Manufacturing Systems and
More informationGenetic algorithms in seasonal demand forecasting
MPRA Munich Personal RePEc Archive Genetic algorithms in seasonal demand forecasting Grzegorz Chodak and Witold Kwaśnicki Wroc law University of Technology, Poland 2000 Online at https://mpra.ub.uni-muenchen.de/34099/
More informationPath-finding in Multi-Agent, unexplored And Dynamic Military Environment Using Genetic Algorithm
International Journal of Computer Networks and Communications Security VOL. 2, NO. 9, SEPTEMBER 2014, 285 291 Available online at: www.ijcncs.org ISSN 2308-9830 C N C S Path-finding in Multi-Agent, unexplored
More informationResearch of Product Design based on Improved Genetic Algorithm
, pp. 45-50 http://dx.doi.org/10.14257/ijhit.2016.9.6.04 Research of Product Design based on Improved Genetic Algorithm Li Ma (Zhejiang Industry Polytechnic College Shaoxing Zhejiang 312000 China) zjsxmali@sina.com
More informationChanging Mutation Operator of Genetic Algorithms for optimizing Multiple Sequence Alignment
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 11 (2013), pp. 1155-1160 International Research Publications House http://www. irphouse.com /ijict.htm Changing
More informationGeneral-purpose SPWA with the Class-type Skill by Genetic Algorithm
General-purpose SPWA with the Class-type Skill by Genetic Algorithm Daiki Takano Graduate School of Engineering, Maebashi Institute of Technology Email: futsal_ido_me_jp@yahoo.co.jp Kenichi Ida Graduate
More informationCOMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM
COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM 1 MANSI GANGWAR, 2 MAIYA DIN, 3 V. K. JHA 1 Information Security, 3 Associate Professor, 1,3 Dept of CSE, Birla Institute of Technology, Mesra
More informationNiagara Falls, Ontario University of Manitoba ON FUZZY ECONOMIC ORDER QUANTITY USING POSSIBILISTIC APPROACH
ASAC 2009 Niagara Falls, Ontario S. S. Appadoo A. Dua University of Manitoba V. N. Sharma Department of Civil Engineering Technology Red River College ON FUZZY ECONOMIC ORDER QUANTITY USING POSSIBILISTIC
More informationTRENDS IN MODELLING SUPPLY CHAIN AND LOGISTIC NETWORKS
Advanced OR and AI Methods in Transportation TRENDS IN MODELLING SUPPLY CHAIN AND LOGISTIC NETWORKS Maurizio BIELLI, Mariagrazia MECOLI Abstract. According to the new tendencies in marketplace, such as
More informationA Genetic Algorithm-Based Decision Support System for Allocating International Apparel Demand
A Genetic Algorithm-Based Decision Support System for Allocating International Apparel Demand Shiue-Shiun Li 1, Rong-Chang Chen *, Chih-Chiang Lin 2 1 Graduate Institute of Business Administration * Department
More informationFuzzy Logic Approach to Corporate Strategy Mapping
Fuzzy Logic Approach to Corporate Strategy Mapping Nooraini Yusoff, Fadzilah Siraj and Siti Maimon Kamso Faculty of IT Universiti Utara Malaysia, 06010 Sintok Kedah, Malaysia Tel: +604-9284629, Fax: +604-9284753,
More informationVISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY. A seminar report on GENETIC ALGORITHMS.
VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY A seminar report on GENETIC ALGORITHMS Submitted by Pranesh S S 2SD06CS061 8 th semester DEPARTMENT OF COMPUTER SCIENCE
More information