A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

Authors:
Boris Goldengorin;Dmitry Krushinsky
Affiliations:
Department of Applied Mathematics and Informatics, Russia;Department of Operations, University of Groningen, The Netherlands
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 14
Cited 0

Efficient algorithms for the capacitated concentrator location problem

Computers and Operations Research
Manufacturing cell formation using an improved p-median model

Computers and Industrial Engineering - Cellular manufacturing systems: design, analysis and implementation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving the Simple Plant Location Problem using a Data Correcting Approach

Journal of Global Optimization
Modified p-median approach for efficient GT cell formation

Computers and Industrial Engineering
Solution methods for the p-median problem: An annotated bibliography

Networks
Solving the p-Median Problem with a Semi-Lagrangian Relaxation

Computational Optimization and Applications
Computational study of large-scale p-Median problems

Mathematical Programming: Series A and B
The Optimal Diversity Management Problem

Operations Research
BEAMR: An exact and approximate model for the p-median problem

Computers and Operations Research
A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method

Computers and Operations Research
Data aggregation for p-median problems

Journal of Combinatorial Optimization
From the editor: Systems studies of voting systems and elections

Mathematical and Computer Modelling: An International Journal
Complexity evaluation of benchmark instances for the p-median problem

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.