A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization

Hybrid methods are promising tools in integer programming, as they combine the best features of different methods in a complementary fashion. This paper presents such a framework, integrating the notions of genetic algorithm, linear programming, and ordinal optimization in an effort to shorten computation times for large and/or difficult integer programming problems. Capitalizing on the central idea of ordinal optimization and on the learning capability of genetic algorithms to quickly generate good feasible solutions, and then using linear programming to solve the problem that results from fixing the integer part of the solution, one may be able to obtain solutions that are close to optimal. Indeed ordinal optimization guarantees the quality of the solutions found. Numerical testing on a real-life complex scheduling problem demonstrates the effectiveness and efficiency of this approach.

[1]  Vijay Kumar,et al.  Motion planning of walking robots in environments with uncertainty , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[2]  Vijay Kumar,et al.  Motion planning of walking robots using ordinal optimization , 1998, IEEE Robotics Autom. Mag..

[3]  Nigel Steele.  A review of “Artificial Neural Networks for Intelligent Manufacturing” Cihan H. Dagli (Ed.) London, Chapman & Hall, 1994, £45 , 1994 .

[4]  P.A.I. Wijkman,et al.  Solving the TSP problem with a new model in evolutionary computation , 1997 .

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

[6]  Byung Ro Moon,et al.  A new genetic approach for the traveling salesman problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[8]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[9]  D.E. Goldberg,et al.  Classifier Systems and Genetic Algorithms , 1989, Artif. Intell..

[10]  Robert Hinterding,et al.  Mapping, order-independent genes and the knapsack problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  C. H. Dagli,et al.  Possible applications of neural networks in manufacturing , 1989, International 1989 Joint Conference on Neural Networks.

[12]  Yu-Chi Ho,et al.  Ordinal optimization of DEDS , 1992, Discret. Event Dyn. Syst..

[13]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Thomas Bäck,et al.  Generalized Convergence Models for Tournament- and (mu, lambda)-Selection , 1995, ICGA.

[16]  Huan Yan.  Solving some difficult mixed integer programming problems in production and forest management , 1996 .

[17]  B. L. Luk,et al.  Evolutionary design and development techniques for an 8-legged robot , 1997 .

[18]  Yu-Chi Ho,et al.  The problem of large search space in stochastic optimization , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.