0 citations0 references

Finding integer efficient solutions for multiple objective network programming problems

Networks2010Vol. 57(4), pp. 362–375

Citations Over TimeTop 23% of 2010 papers

Abstract

For many practical multiple objective network programming (MONP) problems, only integer solutions are meaningful and acceptable. Representative efficient solutions are usually generated by solving augmented weighted Tchebycheff network programs (AWTNPs), sub-problems derived from MONP problems. However, efficient solutions generated this way are usually not integer valued. In this study, two algorithms are developed to construct integer efficient solutions starting from fractional efficient solutions. One algorithm finds a single integer efficient solution in the neighborhood of the fractional efficient solution. The other enumerates all integer efficient solutions in the same neighborhood. Theory supporting the proposed algorithms is developed. Two detailed examples are presented to demonstrate the algorithms. Computational results are reported. The best integer efficient solution is very close, if not equal, to the integer optimal solution. The CPU time taken to find integer efficient solutions is negligible, when compared with that taken to solve AWTNPs. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(4), 362-375 2011

Related Papers

→ Decomposition techniques for MILP: Lagrangian relaxation; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming: Lagrangian relaxation; Simplicial pivoting algorithms for integer programming; Time-dependent traveling salesman problem INTEGER PROGRAMMING DUALITY(2001)

→ Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; NP-complete problems and proof methodology; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: CUTTING PLANE ALGORITHMS(2001)