A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming

References

• Achterberg T, Berthold T (2007) Improving the feasibility pump. Discrete Optim. 4(1):77–86.Crossref, Google Scholar
• Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Management Sci. 25(1):73–78.Link, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015a) A criterion space search algorithm for biobjective integer programming: The balanced box method. INFORMS J. Comput. 27(4):735–754.Link, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015b) A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method. INFORMS J. Comput. 27(4):597–618.Link, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2016a) The L-shape search method for triobjective integer programming. Math. Programming Comput. 8(2):217–251.Crossref, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2016b) The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3):873–885.Crossref, Google Scholar
• Boland NL, Eberhard AC, Engineer FG, Fischetti M, Savelsbergh MWP, Tsoukalas A (2014) Boosting the feasibility pump. Math. Programming Comput. 6(3):255–279.Crossref, Google Scholar
• Captivo ME, Clímaco J, Figueira J, Martins E, Santos JL (2003) Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Comput. Oper. Res. 30(12):1865–1886.Crossref, Google Scholar
• Castillo Tapia M, Coello Coello CA (2007) Applications of multi-objective evolutionary algorithms in economics and finance: A survey (IEEE, Piscataway, NJ), 532–539.Crossref, Google Scholar
• Chalmet LG, Lemonidis L, Elzinga DJ (1986) An algorithm for bi-criterion integer programming problem. Eur. J. Oper. Res. 25(2):292–300.Crossref, Google Scholar
• Coello Coello CA, Lamont GB, Van Veldhuizen DA (2007) Evolutionary Algorithms for Solving Multi-Objective Problems (Springer, New York).Google Scholar
• Dächert K, Klamroth K (2014) A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Global Optim. 61(4):643–676.Crossref, Google Scholar
• Dächert K, Gorski J, Klamroth K (2012) An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems. Comput. Oper. Res. 39(12):2929–2943.Crossref, Google Scholar
• Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Comput. 6(2):182–197.Crossref, Google Scholar
• Degoutin F, Gandibleux X (2002) Un retour dexpériences sur la résolution de problemes combinatoires bi-objectifs. Journée Programmation Mathématique Multiobjectifs (PM2O), Angers, France.Google Scholar
• Delorme X, Gandibleux X, Degoutin F (2010) Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem. Eur. J. Oper. Res. 204(2):206–217.Crossref, Google Scholar
• Ehrgott M, Gandibleux X (2004) Approximative solution methods for multiobjective combinatorial optimization. Top 12(1):1–63.Crossref, Google Scholar
• Fischetti M, Glover F, Lodi A (2005) The feasibility pump. Math. Programming 104(1):91–104.Crossref, Google Scholar
• Gandibleux X, Freville A (2000) Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case. J. Heuristics 6(3):361–383.Crossref, Google Scholar
• Isermann H (1977) The enumeration of the set of all efficient solutions for a linear multiple objective program. Oper. Res. Quart. 28(3):711–725.Crossref, Google Scholar
• Kirlik G, Sayın S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3):479–488.Crossref, Google Scholar
• Köksalan M, Lokman B (2014) Finding nadir points in multi-objective integer programs. J. Global Optim. 62(1):55–77.Crossref, Google Scholar
• Lei D (2009) Multi-objective production scheduling: A survey. Internat. J. Advanced Manufacturing Tech. 43(9):926–938.Crossref, Google Scholar
• Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2):498–516.Link, Google Scholar
• Lubin M, Dunning I (2015) Computing in operations research using Julia. INFORMS J. Comput. 27(2):238–248.Link, Google Scholar
• Lust T, Teghem J (2010) The multiobjective traveling salesman problem: A survey and a new approach. Coello Coello CA, Dhaenens C, Jourdan L, eds. Advances in Multi-Objective Nature Inspired Computing. Studies in Computational Intelligence, Vol. 272 (Springer, Berlin), 119–141.Crossref, Google Scholar
• Marler R, Arora J (2004) Survey of multi-objective optimization methods for engineering. Structural Multidisciplinary Optim. 26(6):369–395.Crossref, Google Scholar
• Özlen M, Burton BA, MacRae CAG (2013) Multi-objective integer programming: An improved recursive algorithm. J. Optim. Theory Appl. 160(2):470–482.Crossref, Google Scholar
• Papadimitriou CH, Yannakakis M (2000) On the approximability of trade-offs and optimal access of web sources. 41st Annual Sympos. Foundations Comput. Sci. Proc. (IEEE, Piscataway, NJ), 86–92.Google Scholar
• Paquete L, Schiavinotto T, Stützle T (2007) On local optima in multiobjective combinatorial optimization problems. Ann. Oper. Res. 156(1):83–97.Crossref, Google Scholar
• Sayın S (2000) Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Programming 87(3):543–560.Crossref, Google Scholar
• Soylu B (2015) Heuristic approaches for biobjective mixed 0-1 integer linear programming problems. Eur. J. Oper. Res. 245(3):690–703.Crossref, Google Scholar
• Tricoire F (2012) Multi-directional local search. Comput. Oper. Res. 39(12):3089–3101.Crossref, Google Scholar
• Zhou A, Qu BY, Li H, Zhao SZ, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Comput. 1(1):32–49.Crossref, Google Scholar
• Zitzler E, Brockhoff D, Thiele L (2007) The hypervolume indicator revisited: On the design of Pareto-compliant indicators via weighted integration. Obayashi S, Deb K, Poloni C, Hiroyasu T, Murata T, eds. Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, Vol. 4403 (Springer, Berlin), 862–876.Crossref, Google Scholar
• Zitzler E, Thiele L, Laumanns M, Fonseca C, Grunert da Fonseca V (2003) Performance assessment of multiobjective optimizers: An analysis and review. Evolutionary Comput., IEEE Trans. 7(2):117–132.Crossref, Google Scholar