Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
نویسندگان
چکیده
منابع مشابه
Scale Multicommodity Capacitated Fixed-Charge Network Design
We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. The restricted master problem solved at each column generation iteration is obtained directly from the compact arc-based model by considering only a subset of the commodity flow variables. The pricing subproblem corresponds to a Lagrangian rela...
متن کاملCommodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design
We improve the mixed-integer programming formulation of the multicommodity capacitated fixed-charge network design problem by incorporating valid inequalities into a cutting-plane algorithm. We use five classes of valid inequalities: the strong, cover, minimum cardinality, flow cover, and flow pack inequalities. The first class is particularly useful when a disaggregated representation of the c...
متن کاملThe Impact of Filtering in a Branch-and-Cut Algorithm for Multicommodity Capacitated Fixed Charge Network Design
In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND). This algorithm combines bounding and branching procedures inspired by the latest developments in mixed-integer programming (MIP) software tools. Several filtering methods that exploit the structure of the MCND are also developed and embedded ...
متن کاملCycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
We propose new cycle-based neighbourhood structures for meta-heuristics aimed at the fixedcharge capacitated multicommodity network design formulation. The neighbourhood defines moves that take explicitly into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously. Moves are identified through a shortest path-like ne...
متن کاملLearning Mechanisms and Local Search Heuristics for the Fixed Charge Capacitated Multicommodity Network Design
In this paper, we propose a method based on learning mechanisms to address the fixed charge capacitated multicommodity network design problem. Learning mechanisms are applied on each solution to extract meaningful fragments to build a pattern solution. Cycle-based neighborhoods are used both to generate solutions and to move along a path leading to the pattern solution by a tabu-like local sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2014
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-014-0020-9