An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions

References

• Anbil R., Gelman E., Patty B., Tanga R. Recent advances in crew-pairing optimization at Americal Airlines. Interfaces (1991) 21:62–74Link, Google Scholar
• Applegate D., Cook W. A computational study of the job shop scheduling problem. ORSA J. Comput. (1991) 3:149–156Link, Google Scholar
• Applegate D., Bixby R., Chvátal V., Cook W. On the solution of traveling salesman problems. Documenta Mathematica, Extra Volume Proceedings ICM III (1998) (1998) 645–656 http://citeseer.ist.psu.edu/article/applegate98solution.htmlCrossref, Google Scholar
• Beck J. C., Refalo P. 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) (2002) LeCroisic, France:221–235Google Scholar
• Bixby R., Fenelon M., Gu Z., Rothberg E., Wunderling R. MIP: Theory and practice—Closing the gap. System Modelling and Optimization: Methods, Theory, and Applications (2000) (Kluwer Academic Publishers, Boston, MA) 19–49Crossref, Google Scholar
• Chabrier A., Danna E., Le Pape C., Perron L. Solving a network design problem. Ann. Oper. Res. (2003) 130:217–239Crossref, Google Scholar
• Danna E., Rothberg E., Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming (2005) 102:71–90Crossref, Google Scholar
• Fischetti M., Lodi A. Local branching. Math. Programming (2002) 98:23–47Crossref, Google Scholar
• Fischetti M., Glover F., Lodi A. The feasibility pump. Math. Programming (2005) 104:91–104Crossref, Google Scholar
• French A., Robinson A., Wilson J. Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems. J. Heuristics (2001) 7:551–564Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Holland J. H.Adaptation in Natural and Artificial Systems (1975) (University of Michigan Press, Ann Arbor, MI) Google Scholar
• ILOGCPLEX Customer Model (2002) (ILOG, Mountain View, CA) Google Scholar
• Martin A., Achterberg T., Koch T. MIPLIB 2003, http://miplib.zib.de. (2003) Google Scholar
• Mitchell M.An Introduction to Genetic Algorithms (1996) (MIT Press, Cambridge, MA) Google Scholar
• Nieminen K., Ruuth S., Maros I. Genetic algorithm for finding a good first integer solution for MILP. (2003) . Technical Report 2003/4, Imperial College, London, UKGoogle Scholar
• Pochet Y., Van Vyve M. A general heuristic for production planning problems. INFORMS J. Comput. (2004) 16(3):316–327Link, Google Scholar
• Puchinger J., Raidl G. R., Mira J., Álvarez J. R. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach (2005) (Springer, Berlin, Germany) 41–53Crossref, Google Scholar
• Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Fourth Internat. Conf. on Principles and Practice of Constraint Programming (1998) Pisa, Italy:417–431Crossref, Google Scholar
• Surie C. MLCLSP test instances. (2002) . http://www.bwl.tu-darmstadt.de/bwl1/forschung/ti_mlclsp/ti_mlclsp.php?FG=bwl1Google Scholar
• van Hoesel S., Goessens J. W., Kroon L. A branch-and-cut approach to line planning problems. (2001) . Technical Report, Erasmus University, Rotterdam, The NetherlandsGoogle Scholar
• van Laarhoven P. J. M., Aarts E. H. L.Simulated Annealing: Theory and Practice (1987) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar