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

B. Goldengorin, D. Krushynskyi

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationNetwork Optimization : 5th International Conference, INOC 201, Hamburg, Germany, June 13-16, 2011, Proceedings
EditorsJ. Pahl, T. Reiners, S. Voß
Place of PublicationBerlin
PublisherSpringer
Pages503-516
ISBN (Print)978-3-642-21526-1
DOIs
Publication statusPublished - 2011
Eventconference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16 -
Duration: 13 Jun 201116 Jun 2011

Publication series

NameLecture Notes in Computer Science
Volume6701
ISSN (Print)0302-9743

Conference

Conferenceconference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16
Period13/06/1116/06/11
Other5th International Network Optimization Conference (INOC 2011)

Fingerprint

Dive into the research topics of 'A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation'. Together they form a unique fingerprint.

Cite this