Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design

DOI10.1016/j.ejor.2018.01.022zbMath1403.90199MaRDI QIDQ1754304

Bernard Gendron, Saïd Hanafi, Raca Todosijević

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.022

zbMATH Keywords

heuristics; mixed-integer programming; slope scaling; multicommodity capacitated fixed charge network design; iterative linear programming

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C11: Mixed integer programming

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

Related Items

MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• A capacity scaling heuristic for the multicommodity capacitated network design problem
• A local branching heuristic for the capacitated fixed-charge network design problem
• Zero-one programming with many variables and few constraints
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• New convergent heuristics for 0-1 mixed integer programming
• A first multilevel cooperative algorithm for capacitated multicommodity network design
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
• Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Accelerating benders decomposition with heuristicmaster problem solutions
• Algorithms – ESA 2005
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Benchmarking optimization software with performance profiles.