Branch-and-bound for bi-objective integer programming

In bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent ...

[1]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[2]  Giovanni Righini,et al.  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..

[3]  Kathrin Klamroth,et al.  An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems , 2012, Comput. Oper. Res..

[4]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[5]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[6]  Walter J. Gutjahr,et al.  The bi-objective stochastic covering tour problem , 2012, Comput. Oper. Res..

[7]  Ana Paula Barbosa-Póvoa,et al.  Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns , 2014 .

[8]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[9]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[10]  Matthias Ehrgott,et al.  Bound sets for biobjective combinatorial optimization problems , 2007, Comput. Oper. Res..

[11]  Philippe Fortemps,et al.  Performance of the MOSA Method for the Bicriteria Assignment Problem , 2000, J. Heuristics.

[12]  Michael Masin,et al.  Diversity Maximization Approach for Multiobjective Optimization , 2008, Oper. Res..

[13]  Markus Leitner,et al.  The bi-objective prize-collecting Steiner tree problem , 2013 .

[14]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[15]  Jacques Teghem,et al.  Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..

[16]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[17]  Matthias Ehrgott,et al.  Multicriteria Optimization (2. ed.) , 2005 .

[18]  George Mavrotas,et al.  A branch and bound algorithm for mixed zero-one multiple objective linear programming , 1998, Eur. J. Oper. Res..

[19]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[20]  Marco Laumanns,et al.  An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..

[21]  Nicolas Jozefowiez,et al.  Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective , 2013, ATMOS.

[22]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[23]  D. J. Elzinga,et al.  An algorithm for the bi-criterion integer programming problem , 1986 .

[24]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[25]  Pietro Belotti,et al.  Fathoming rules for biobjective mixed integer linear programs: Review and extensions , 2016 .

[26]  Anthony Przybylski,et al.  Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case , 2013, Comput. Oper. Res..

[27]  S. L. Gadegaard,et al.  Bi-objective branch – and – cut algorithms : Applications to the single source capacitated facility location problem , 2016 .

[28]  Pietro Belotti,et al.  Efficient storage of Pareto points in biobjective mixed integer programming , 2014, INFORMS J. Comput..

[29]  Gilbert Laporte,et al.  A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem , 2012, INFORMS J. Comput..

[30]  Markus Leitner,et al.  A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem , 2015, INFORMS J. Comput..

[31]  Anthony Przybylski,et al.  Two phase algorithms for the bi-objective assignment problem , 2008, Eur. J. Oper. Res..

[32]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[33]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[34]  Jacques Desrosiers,et al.  Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems , 2002 .

[35]  Martin W. P. Savelsbergh,et al.  A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method , 2015, INFORMS J. Comput..

[36]  Martin W. P. Savelsbergh,et al.  A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method , 2015, INFORMS J. Comput..

[37]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[38]  Thomas R. Stidsen,et al.  A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs , 2014, Manag. Sci..

[39]  Matthias Ehrgott,et al.  A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling , 2011, OR Spectr..

[40]  Fabien Tricoire,et al.  Multi-directional local search , 2012, Comput. Oper. Res..

[41]  A. M. Geoffrion.  Proper efficiency and the theory of vector maximization , 1968 .

[42]  Francis Sourd,et al.  A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem , 2008, INFORMS J. Comput..

[43]  Kris Braekers,et al.  Production , Manufacturing and Logistics A bi-objective home care scheduling problem : Analyzing the trade-off between costs and client inconvenience , 2015 .

[44]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .