Abstract
A heuristic algorithm for solving mixed-integer programming problems is proposed. The basic idea is to search good feasible solutions located near the LP optimal solution. It consists of four phases: Phase 0, computation of LP optimal solution; Phase 1, computation of the central trajectory T of the feasible region; Phase 2, search for (integer) feasible solutions along T; Phase 3, improvements of feasible solutions. The computational results are encouraging. For example, randomly generated problems with 50 constraints and 400 variables consumed 2∼3 minutes on a FACOM 230/60. The quality of the obtained solutions seem to be quite high. In fact, for many problems with known optimal solutions, our algorithm was successful in obtaining exact optimal solutions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This paper is a slightly shortened version of the working paper [8], which is available from the authors. A FORTRAN list of the entire code is also available upon request.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Balas, “An additive algorithm for solving linear programs with zero-one variables”, Operations Research 13 (1965) 517–546.
R.E. Echols and L. Cooper, “Solution of integer linear programming problems by direct search”, Journal of the Association for Computing Machinery 15 (1968) 75–84.
P. Gray, “Mixed integer programming algorithms for site selection and other fixed charge problems having capacity constraints”, SED-Special Rept., Stanford Research Institute, Menlo Park, Calif. (1967).
J. Haldi, “25 integer programming test problems”, Rept. of Graduate School of Business, Stanford University, Stanford, Calif. (1964).
F.S. Hillier, “Efficient heuristic procedures for integer linear programming with an interior”, Operations Research 17 (1969) 600–636.
F.S. Hillier, “A bound-and-scan algorithm for pure integer linear programming with general variables”, Rept. No. 3, Department of Operations Research, Stanford University, Stanford, Calif. (1969).
Huard, “Programmes mathematiques nonlineares a variables bivalentes”, in: H.W. Kuhn, ed., Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton, N.J., 1970).
T. Ibaraki, T. Ohashi and H. Mine, “A heuristic algorithm for mixed-integer programming problems”, Fall Conference of Operations Research Society of Japan, 1971 and 1972; Working paper. Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan (1972).
A.H. Land and A.G. Doig, “An automatic method of solving discrete programming problems”, Econometrica 28 (1960) 497–520.
A.S. Manne, “A mixed integer algorithm for project evaluation”, Memorandom 71-3, Development Research Center, International Bank for Reconstruction and Development, Washington, D.C. (1971).
S. Muroga and T. Ibaraki, “Logical design of an optimum network by integer linear programming”, Rept. No. 264, Department of Computer Science, University of Illinois, Urbana, Ill. (1968).
S. Reiter and D.B. Rice, “Discrete optimizing solution procedures for linear and nonlinear integer programming problems”, Management Science 12 (1966) 829–850.
R.H. Roth, “An approach to solving linear discrete optimization problems”, Journal of the Association for Computing Machinery 17 (1970) 300–313.
S. Senju and Y. Toyoda, “An approach to linear programming with 0–1 variables, Management Science 15 (1968) B196–B207.
G.L. Thompson, “The stopped simplex method: 1. Basic theory for mixed integer programming”, Revue Francaise de Recherche Operationnelle 8 (1964) 159–182.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 The Mathematical Programming Society
About this chapter
Cite this chapter
Ibaraki, T., Ohashi, T., Mine, H. (1974). A heuristic algorithm for mixed-integer programming problems. In: Balinski, M.L. (eds) Approaches to Integer Programming. Mathematical Programming Studies, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120691
Download citation
DOI: https://doi.org/10.1007/BFb0120691
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00739-2
Online ISBN: 978-3-642-00740-8
eBook Packages: Springer Book Archive