Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Back, T. (1995) Generalized convergence models for tournament-and (μ, λ)-selection. Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 2-8.
Booker, L. B., Goldberg, D. E. and Holland, J. H. (1989) Classifier systems and genetic algorithms. Artificial Intelligence, 40, 235-282.
Bui, T. and Moon, B. (1994) A new genetic approach for the traveling salesman problem. Proceedings of the First IEEE Conference on Evolutionary Computation, Vol 1, pp. 7-12.
Chen, C. H., Kumar, V. and Luo, Y. H. (1998) Motion planning of walking robots using ordinal optimization. IEEE Robotics & Automation Magazine, 5(2), 22-32.
Chen, C. H., Kumar, V. and Luo, Y. H. (1999) Motion planning of walking robots in environments with uncertainty. Journal of Robotic Systems, 16(10), 527-545.
Cheung, J. Y. (1994) Scheduling, Artificial Neural Networks for Intelligent Manufacturing, C. H. Dagli (ed.), Chapman & Hall, London, England.
Dagli, C. and Lammers, S. (1989) Possible applications of neural networks in manufacturing. Proceedings of the International Conference on Neural Networks, Vol. 2, IEEE, New York, p. 605.
De John, K. A. (1975) An analysis of behavior of a class of genetic adaptive systems. Ph.D. Dissertation, University of Michigan.
De John, K. A. and Spears, W. M. (1989) Using Genetic Algorithms to Solve NP-Complete Problems. Proceedings of The Third International Conference on Genetic Algorithms, Fairfax, VA, pp. 124-132.
Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to The Theory of NP-Completeness, W. H. Freeman and Company.
Galt, S. and Luk, B. (1997) Evolutionary Design and Development Techniques for an 8-Legged Robot. International Conference on Genetic Algorithm in Engineering Systems: Innovation and Applications 2nd, University of Strathclyde, Glasgow, UK.
Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley.
Guignard, M. and Wang, S. (1999) A continuous time formulation for chemical batch processing, OPIM Department Report 99-11-01, University of Pennsylvania.
Hinterding, R. (1994) Mapping, order-independent genes and the knapsack problem. Proceedings of The First IEEE Conference on Evolutionary Computation, Vol. 1, pp. 13-17.
Ho, Y. C. and Deng, M. (1994) The problem of large search space in stochastic optimization. Proceedings of the 33rd Conference of Decision and Control.
Ho, Y. C., Sreenivas, R. S. and Vakili, P. (1992) Ordinal optimization of DEDS. Journal of Discrete Event Dynamic Systems, 2(2), 61-88.
Holland, John H. (1975) Adaptation in Natural and Artificial Systems, The University of Michigan Press.
Jang, J.-S. R., Sun, C.-T. and Mizutani, E. (1997) Neuro-Fuzzy and Soft Computing. Prentice Hall.
Kobayashi, S., Ono, I. and Yamamura, M. (1995) An efficient genetic algorithm for job shop scheduling problems. Proceedings of the Sixth International Conference on Genetic Algorithms, University of Pittsburgh, pp. 506-511.
Nemhauser, G. L. and Wolsey, L. A. (1988) Integer and Combinatorial Optimization, John Wiley.
Pawlowsky, M. A. (1995) Crossover operators. L. Chambers (ed.), Practical Handbook of Genetic Algorithms, CRC Press.
Ronald, S. (1995) Routing and scheduling problems. L. Chambers (ed.), Practical Handbook of Genetic Algorithms, CRC Press.
Spielberg, K. and Guignard, M., (1999) Sequential (Pseudo) hot starts for advanced solutions to (0,1) MIP programming problems. Department of OPIM Report 99-12-21, Department of OPIM, The Wharton School, University of Pennsylvania.
Van Hentenryck, P. (1999) The OPL Optimization Programming Language, The MIT Press.
Westenberger, H. and Kallrath, J. (1995) Formulation of a job shop problem in process industries. Joint Working Paper, Bayer and BASF.
Wijkman, P. (1997) Solving the TSP problem with a new model in evolutionary computation. Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pp. 145-150.
Yan, H. (1996) Solving Some Difficult Mixed Integer Programming Problems in Production and Forest Management. Ph.D. Dissertation, Department of OPIM, the Wharton School, University of Pennsylvania.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Luo, YC., Guignard, M. & Chen, CH. A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization. Journal of Intelligent Manufacturing 12, 509–519 (2001). https://doi.org/10.1023/A:1012256521687
Issue Date:
DOI: https://doi.org/10.1023/A:1012256521687