LARGE-SCALE SET PARTITIONING PROBLEMS: SOME REAL‐WORLD INSTANCES HIDE A BENEFICIAL STRUCTURE
نویسندگان
چکیده
منابع مشابه
Advanced OR and AI Methods in Transportation LARGE-SCALE SET PARTITIONING PROBLEMS: CONJECTURES ON THE BENEFICIAL STRUCTURE OF SOME REAL-WORLD INSTANCES
In this work we consider large-scale set partitioning problems. Our main purpose is to show that real-world set partitioning problems originating from the container-trucking industry are easier to tackle with respect to general ones. We show such different behavior through computational experiments: in particular, we have applied both a heuristic algorithm and some exact solution approaches to ...
متن کاملA Combined Lagrangian , and Implication Heuristic Partitioning Problems Linear Programming , for Large - Scale Set
Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high-quality solutions in an acceptable amount of computation time. The algorithm is iterative and co...
متن کاملA Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems
We describe a parallel linear programming and implication based heuristic for solving set partitioning problems on distributed memory computer architectures Our implementation is carefully designed to exploit parallelism to greatest advantage in advanced techniques like preprocessing and probing primal heuristics and cut generation A primal dual subproblem simplex method is used for solving the...
متن کاملA combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Given a nite ground set a set of subsets and costs on the subsets the set partitioning problem is to nd a minimum cost partition of the ground set Many combinatorial optimization problems can be formulated as set partitioning problems We present an approximation algorithm that produces high quality solutions in an acceptable amount of computation time The algorithm is iterative and combines pro...
متن کاملExploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems
We present a data mining approach for reducing the search space of local search algorithms in large-scale set partitioning problems (SPPs). We construct a k-nearest neighbor graph by extracting variable associations from the instance to be solved, in order to identify promising pairs of flipping variables in the large neighborhood search. We incorporate the search space reduction technique into...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technological and Economic Development of Economy
سال: 2006
ISSN: 2029-4913,2029-4921
DOI: 10.3846/13928619.2006.9637717