A hybrid approach using TOPSIS, Differential Evolution, and Tabu Search to find multiple solutions of constrained non-linear integer optimization problems

This paper presents a novel method to find multiple solutions of multi-modal constrained non-linear integer optimization problems. First, the constrained optimization problem is cast into a bi-objective optimization problem, where the constraints are inserted as another objective function. Next, the novel method to solve multi-objective optimization problems is developed and applied to solve the reformulated problem. The novel method developed to solve multi-objective optimization problems is based on the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) whereas the multi-objective problem is cast in single-objectives problems. The Differential Evolution (DE) algorithm in its three versions (standard DE, DEbest and DEGL) are used as optimizer. Since the solutions found by the DE algorithms are continuous, a Tabu Searh (TS) is employed to find integer solutions during the optimization process. Experimental results show the effectiveness of the proposed method.

[1]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[2]  Xiaodong Li,et al.  Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology , 2010, IEEE Transactions on Evolutionary Computation.

[3]  M. F. Cardoso,et al.  A simulated annealing approach to the solution of minlp problems , 1997 .

[4]  Kun Shen,et al.  Solving mixed integer nonlinear programming problems with line-up competition algorithm , 2004, Comput. Chem. Eng..

[5]  C. Mohan,et al.  A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems , 1999, Comput. Optim. Appl..

[6]  Michael Nikolaou,et al.  A hybrid approach to global optimization using a clustering algorithm in a genetic search framework , 1998 .

[7]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[8]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[9]  João Pedro Pedroso,et al.  Tabu Search for Mixed Integer Programming , 2005 .

[10]  Jingwen Huang.  Combining entropy weight and TOPSIS method For information system selection , 2008, ICAL 2008.

[11]  Maw-Sheng Chern,et al.  Reliability Optimization Problems with Multiple Constraints , 1986, IEEE Transactions on Reliability.

[12]  R. Ge,et al.  A continuous approach to nonlinear integer programming , 1989 .

[13]  Wen-xing Zhu,et al.  An approximate algorithm for nonlinear integer programming , 1998, Appl. Math. Comput..

[14]  Xiaodong Li,et al.  Erratum to "Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology" [Feb 10 150-169] , 2010, IEEE Trans. Evol. Comput..

[16]  H. Zimmermann.  Fuzzy programming and linear programming with several objective functions , 1978 .

[17]  M. Montaz Ali,et al.  Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming , 2009, Comput. Oper. Res..

[18]  Duan Li,et al.  Logarithmic-exponential penalty formulation for integer programming , 1999 .

[19]  Atef Fahim,et al.  A two-phase optimization procedure for integer programming problems , 2001 .

[20]  Ching-Lai Hwang,et al.  Fuzzy Multiple Attribute Decision Making - Methods and Applications , 1992, Lecture Notes in Economics and Mathematical Systems.

[21]  Richard Bellman,et al.  Decision-making in fuzzy environment , 2012 .

[22]  C. Hwang,et al.  TOPSIS for MODM , 1994 .

[23]  Mohammad S. Sabbagh,et al.  A partial enumeration algorithm for pure nonlinear integer programming , 2008 .

[24]  Chunfeng Wang,et al.  Optimal Design of Multiproduct Batch Chemical Process Using Genetic Algorithms , 1996 .

[25]  Yi-Chung Hu,et al.  Finding multiple solutions to general integer linear programs , 2008, Eur. J. Oper. Res..

[26]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[27]  Amit Konar,et al.  Differential Evolution Using a Neighborhood-Based Mutation Operator , 2009, IEEE Transactions on Evolutionary Computation.

[28]  YangYongjian,et al.  A new discrete filled function algorithm for discrete global optimization , 2007 .

[29]  Russell C. Eberhart,et al.  Computational intelligence - concepts to implementations , 2007 .

[30]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[31]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[32]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[33]  Zhi-You Wu,et al.  A new filled function method for nonlinear integer programming problem , 2006, Appl. Math. Comput..