To read this content please select one of the options below:

Hybrid revised weighted fuzzy c-means clustering with Nelder-Mead simplex algorithm for generalized multisource Weber problem

Tarik Kucukdeniz (Department of Industrial Engineering, Istanbul University, Istanbul, Turkey)
Sakir Esnaf (Department of Industrial Engineering, Istanbul University, Istanbul, Turkey)

Journal of Enterprise Information Management

ISSN: 1741-0398

Article publication date: 26 September 2018

Issue publication date: 10 October 2018

239

Abstract

Purpose

The purpose of this paper is to propose hybrid revised weighted fuzzy c-means (RWFCM) clustering and Nelder–Mead (NM) simplex algorithm, called as RWFCM-NM, for generalized multisource Weber problem (MWP).

Design/methodology/approach

Although the RWFCM claims that there is no obligation to sequentially use different methods together, NM’s local search advantage is investigated and performance of the proposed hybrid algorithm for generalized MWP is tested on well-known research data sets.

Findings

Test results state the outstanding performance of new hybrid RWFCM and NM simplex algorithm in terms of cost minimization and CPU times.

Originality/value

Proposed approach achieves better results in continuous facility location problems.

Keywords

Acknowledgements

Conflict of interest: the authors declare that they have no conflict of interest.

Compliance with ethical standards: this paper does not contain any studies with human participants or animals performed by any of the authors.

Citation

Kucukdeniz, T. and Esnaf, S. (2018), "Hybrid revised weighted fuzzy c-means clustering with Nelder-Mead simplex algorithm for generalized multisource Weber problem", Journal of Enterprise Information Management, Vol. 31 No. 6, pp. 908-924. https://doi.org/10.1108/JEIM-01-2018-0002

Publisher

:

Emerald Publishing Limited

Copyright © 2018, Emerald Publishing Limited

Related articles