On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP

On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP

In this paper, we show that the hard computing approach using the <i>p</i>-median problem (PMP) is a very effective strategy for optimally solving large-size generalized cell formation (GCF) problems. The soft computing approach, relying on heuristic or metaheuristic search algorithms, h...

Full description

Bibliographic Details
Main Author: Youkyung Won
Format: Article
Language:English
Published: MDPI AG 2020-05-01
Series:Applied Sciences
Subjects:
hard computing approach
<i>p</i>-median problem
generalized cell formation
Online Access:https://www.mdpi.com/2076-3417/10/10/3478
id doaj-e1b17a82780f40559dc740a892b69b8a
record_format Article
spelling doaj-e1b17a82780f40559dc740a892b69b8a2020-11-25T03:21:43ZengMDPI AGApplied Sciences2076-34172020-05-01103478347810.3390/app10103478On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMPYoukyung Won0Department of Business Administration, Kunsan National University, 558 Daehak-ro, Gunsan-si, Jeollabuk-do 54150, KoreaIn this paper, we show that the hard computing approach using the <i>p</i>-median problem (PMP) is a very effective strategy for optimally solving large-size generalized cell formation (GCF) problems. The soft computing approach, relying on heuristic or metaheuristic search algorithms, has been the prevailing strategy for solving large-size GCF problems with a short computation time at the cost of the global optimum in large instances of GCF problems; however, due to recent advances in computing technology, using hard computing techniques to solve large-sized GCF problems optimally is not time-prohibitive if an appropriate mathematical model is built. We show that the hard computing approach using the PMP-type model can even solve large 0–1 GCF instances optimally in a very short computation time with a powerful mixed integer linear programming (MILP) solver adopting an exact search algorithm such as the branch-and-bound algorithm.https://www.mdpi.com/2076-3417/10/10/3478hard computing approach<i>p</i>-median problemgeneralized cell formation
collection DOAJ
language English
format Article
sources DOAJ
author Youkyung Won
spellingShingle Youkyung Won
On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP
Applied Sciences
hard computing approach
<i>p</i>-median problem
generalized cell formation
author_facet Youkyung Won
author_sort Youkyung Won
title On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP
title_short On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP
title_full On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP
title_fullStr On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP
title_full_unstemmed On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP
title_sort on solving large-size generalized cell formation problems via a hard computing approach using the pmp
publisher MDPI AG
series Applied Sciences
issn 2076-3417
publishDate 2020-05-01
description In this paper, we show that the hard computing approach using the <i>p</i>-median problem (PMP) is a very effective strategy for optimally solving large-size generalized cell formation (GCF) problems. The soft computing approach, relying on heuristic or metaheuristic search algorithms, has been the prevailing strategy for solving large-size GCF problems with a short computation time at the cost of the global optimum in large instances of GCF problems; however, due to recent advances in computing technology, using hard computing techniques to solve large-sized GCF problems optimally is not time-prohibitive if an appropriate mathematical model is built. We show that the hard computing approach using the PMP-type model can even solve large 0–1 GCF instances optimally in a very short computation time with a powerful mixed integer linear programming (MILP) solver adopting an exact search algorithm such as the branch-and-bound algorithm.
topic hard computing approach
<i>p</i>-median problem
generalized cell formation
url https://www.mdpi.com/2076-3417/10/10/3478
work_keys_str_mv AT youkyungwon onsolvinglargesizegeneralizedcellformationproblemsviaahardcomputingapproachusingthepmp
_version_ 1724612895952601088

Similar Items