An evolutionary algorithm for polishing mixed integer programming solutions

INFORMS Journal on Computing

Volumn 19, Issue 4, 2007, Pages 534-541

  Rothberg, Edward ^a  

^a ILOG Inc   (United States)

Author keywords

Evolutionary algorithms; Metaheuristics; Mixed integer programming

Indexed keywords

EID: 46949101011     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1060.0189     Document Type: Article

References (21)

1. Anbil, R., E. Gclman, B. Patty, R. Tanga. 1991. Recent advances in crew-pairing optimization at Americal Airlines, Interfaces 21 62-74.
2. Applegate, D., W. Cook. 1991. A computational study of the job shop scheduling problem. ORSA J. Comput. 3 149-156.
3. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 1998. On the solution of traveling salesman problems. Doattmnta Mathematica, Extra Volume Proceedings ICM III (1998), 645-656, http://citcseerist.psu.edu/article/ applegate98solution.html.
4. Beck, J. C, E Refalo. 2002. Combining local search and linear programming to solve earliness/tardiness scheduling problems. Proc. Fourth Internat. Workshop Integration AI and OR Techniques Constraint Programming Combin. Optim. Problems (CP-AI- OR'02), LeCroisic, France, 221-235.
5. Bixby, R., M. Fenelon, Z. Gu, E. Rothberg, R. Wunderling. 2000. MIP: Theory and practice-Closing the gap. System Modelling and Optimization: Metliods, Theory, and Applications. Kluwer Academic Publishers, Boston, MA, 19-49. C
6. habrier, A., E. Danna, C. Le Pape, L. Perron. 2003. Solving a network design problem. Ann. Oper. Res. 130 217-239.
7. Danna, E., E. Rothberg, C. Le Pape. 2005. Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming 102 71-90.
8. Fischetti, M., A. Lodi. 2002. Local branching. Math. Programming 98 23-47.
9. Fischetti, M., F. Glover, A. Lodi. 2005. The feasibility pump. Math. Programming 104 91-104.
10. French, A., A. Robinson, J. Wilson. 2001. Using a hybrid genetic- algorithm/branch and bound approach to solve feasibility and optimization integer programming problems. J. Heuristics 7 551-564.
11. Glover, E, M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston, MA.
12. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
13. ILOG. 2002. CPLEX Customer Model. ILOG, Mountain View, CA. Martin, A., T. Achterberg, T. Koch. 2003. MIPLIB 2003, http://miplib.zib.de.
14. Mitchell, M. 1996. An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA.
15. Nieminen, K., S. Ruuth, I. Maros. 2003. Genetic algorithm for finding a good first integer solution for MILE Technical Report 2003/4, Imperial College, London, UK.
16. pochet, Y., M. Van Vyve. 2004. A general heuristic for production planning problems. INFORMS J. Comput. 16(3) 316-327.
17. Fuchinger, J., G. R. Raidl. 2005. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. J. Mira, J. R. Álvarez, eds. Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. Springer, Berlin, Germany, 41-53.
18. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. Fourth Internat. Conf. on Principles and Practice of Constraint Programming, Pisa, Italy, 417-431.
19. Surie, C. 2002. MLCLSP test instances.http://www.bwl.tu-darmstadt.de/ bwll/forschung/ti-mlclsp/ti-mlclsp.php?FG=bwll.
20. van Hoesel, S., J. W. Gocsscns, L. Kroon. 2001. A branch-and-cut approach to line planning problems. Technical Report, Erasmus University, Rotterdam, The Netherlands.
21. van Laarhoven, P. J. M., E. H. L. Aarts. 1987. Simulated Annealing: Theory and Practice. Kluwer Academic Publishers, Boston, MA.