An application of extended elitist non-dominated sorting Genetic Algorithm in multi-objective linear programming problem of tea industry with interval objectives

Bhunia, A.; Biswas, A.; Sen, N.

Growing Science » Uncertain Supply Chain Management » An application of extended elitist non-dominated sorting Genetic Algorithm in multi-objective linear programming problem of tea industry with interval objectives

Journals

USCM Volumes

Volume 1 (22)
- Issue 1 (4)
- Issue 2 (6)
- Issue 3 (6)
- Issue 4 (6)

Volume 2 (32)
- Issue 1 (7)
- Issue 2 (5)
- Issue 3 (10)
- Issue 4 (10)

Volume 3 (39)
- Issue 1 (9)
- Issue 2 (13)
- Issue 3 (10)
- Issue 4 (7)

Volume 4 (31)
- Issue 1 (10)
- Issue 2 (6)
- Issue 3 (6)
- Issue 4 (9)

Volume 5 (26)
- Issue 1 (6)
- Issue 2 (6)
- Issue 3 (8)
- Issue 4 (6)

Volume 6 (25)
- Issue 1 (7)
- Issue 2 (6)
- Issue 3 (6)
- Issue 4 (6)

Volume 7 (57)
- Issue 1 (8)
- Issue 2 (19)
- Issue 3 (14)
- Issue 4 (16)

Volume 8 (82)
- Issue 1 (20)
- Issue 2 (15)
- Issue 3 (17)
- Issue 4 (30)

Volume 9 (117)
- Issue 1 (25)
- Issue 2 (26)
- Issue 3 (32)
- Issue 4 (34)

Volume 10 (150)
- Issue 1 (28)
- Issue 2 (32)
- Issue 3 (44)
- Issue 4 (46)

Volume 11 (190)
- Issue 1 (42)
- Issue 2 (45)
- Issue 3 (50)
- Issue 4 (53)

Volume 12 (244)
- Issue 1 (55)
- Issue 2 (59)
- Issue 3 (63)
- Issue 4 (67)

Volume 13 (30)
- Issue 1 (15)
- Issue 2 (15)

Keywords

Authors

Countries

Uncertain Supply Chain Management

ISSN 2291-6830 (Online) - ISSN 2291-6822 (Print) Quarterly Publication Volume 2 Issue 4 pp. 245-256 , 2014

An application of extended elitist non-dominated sorting Genetic Algorithm in multi-objective linear programming problem of tea industry with interval objectives Pages 245-256 Download PDF

Authors: Asoke Kumar Bhunia, Amiya Biswas, Nabendu Sen

Keywords: Genetic algorithm, Interval mathematics, Interval order relations, Linear programming, Multi-objective optimization, Non-dominated sorting

Abstract: In this paper, we have modeled a decision making problem of a tea industry as a multi-objective optimization problem in interval environment. The goal of this problem is to maximize the overall profit as well as to minimize the total production cost subject to the given resource constraints depending on budget, storage space and allotted processing times in different machines. For this purpose, the problem has been formulated as a multi-objective integer linear programming problem with interval objectives. To solve the problem, we have proposed extended elitist non-dominated sorting genetic algorithm (ENSGA-II) for integer variables with interval fitness, crowded tournament selection, intermediate crossover, one neighborhood mutation and elitism. To develop this algorithm, we have proposed modified non-dominated sorting and crowding distance based on interval mathematics and interval order relations. Finally, to test the performance of the proposed algorithm, a numerical example has been solved.

How to cite this paper

 Bhunia, A., Biswas, A & Sen, N. (2014). An application of extended elitist non-dominated sorting Genetic Algorithm in multi-objective linear programming problem of tea industry with interval objectives.Uncertain Supply Chain Management, 2(4), 245-256.

Refrences

Bhunia, A. K., & Samanta, S. S. (2014). A study of interval metric and its application in Multi-objective optimization with interval objective. Computers & Industrial Engineering, 74, 169-178.

Bhunia, A.K., Sahoo, L. & Kapoor, P.K. (2012). Genetic algorithm based multi-objective reliability optimization in interval environment. Computers and Industrial Engineering, 62, 152-160.

Bhunia, A.K., Sahoo, L. & Roy, D. (2010). Reliability stochastic optimization for a series system with interval component reliability via Genetic Algorithm. Applied Mathematics and Computation, 216(3), 929-939.

Deb, K., Agrawal, S., Pratap, A. & Meyarivan, T. (2000). A Fast Elitist Non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the Parallel Problem Solving from Nature VI Conference, 16-20 September, Paris, France, 849-858.

Gupta, R.K., Bhunia A.K. & Roy, D. (2009). A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliabilities of components. Journal of Computational and Applied Mathematics, 232(2), 275-284.

Hansen, E. & Walster, G.W. (2004). Global optimization using interval analysis. Marcel Dekker Inc, New York.

Hu, B. Q. & Wang, S. (2006). A novel approach in uncertain programming Part I: New arithmetic and order relation for interval numbers. Journal of Industrial and Management Optimization, 2(4), 351-371.

Karmakar, S., Mahato, S.K. & Bhunia, A.K. (2009). Interval oriented multi-section techniques for global optimization. Journal of Computation and Applied Mathematics, 224(2), 476-491.

Miettinen, K. (2004). Nonlinear multi-objective optimization. Kluwer Academic Publishers.
Nahar, S., Sahni, S. & Shragowitz, E. (1986). Simulated annealing and combinatorial optimization. Proceedings of the 23rd ACM/IEEE Design Automation Conference , 293-299.

Moore. R.E. (1979). Method and Applications of Interval Analysis, SIAM, Philadelphia.

Sen, N. (2012). A note on Goal Programming Approach to Tea Industry of Barak Valley of Assam. American Journal of Mathematics and Statistics, 5,108-113.

Sinha, B. & Sen, N. (2011). Goal Programming approach to tea industry of Barak Valley of Assam. Applied Mathematical Sciences, 5(29),1409-1419.

Srinivas, N. & Deb, K. (1995). Multi-Objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation, 2(3), 221–248.