A modified firefly algorithm for general inverse p-median location problems under different distance norms

This paper concerns a general inverse p -median location problem on the k -dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of p predetermine...

Full description

Saved in:
Bibliographic Details
Published inOpsearch Vol. 54; no. 3; pp. 618 - 636
Main Authors Alizadeh, Behrooz, Bakhteh, Somayeh
Format Journal Article
LanguageEnglish
Published New Delhi Springer India 01.09.2017
Springer Nature B.V
Subjects
Algorithms
Business and Management
Chebyshev approximation
Computational efficiency
Computing time
Cost engineering
Management
Mathematics
Norms
Operations research
Operations Research/Decision Theory
Site selection
Theoretical Article
Facility location
median problem
Inverse optimization
Firefly algorithm
Online AccessGet full text

Cover

More Information
Summary:This paper concerns a general inverse p -median location problem on the k -dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of p predetermined facility points becomes an optimal p -median location under the new weights and coordinates. A modified firefly algorithm is proposed to solve the problem under the rectilinear, Chebyshev and Euclidean distance norms. By computational experiments, the high efficiency of the algorithm is illustrated.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-016-0296-z