Abstract

The Uncapacitated Facility Location Problem (UFLP) is considered in this paper. Given a set of customers and a set of potential facility locations, the objective of UFLP is to open a subset of facilities to satisfy the demands of all the customers such that the sum of the opening cost for the opened facilities and the service cost is minimized. UFLP is a well-known combinatorial optimization problem which is also NP-hard. So, a metaheuristic algorithm for solving this problem is natural choice. In this paper, a relatively new swarm intelligence-based algorithm known as the Monkey Algorithm (MA) is applied to solve UFLP. To validate the efficiency of the proposed binary MA-based algorithm, experiments are carried out with various data instances of UFLP taken from the OR-Library and the results are compared with those of the Firefly Algorithm (FA) and the Artificial Bee Colony (ABC) algorithm.

Keywords

uncapacitated facility location problem;simple plant location problem;warehouse location problem;monkey algorithm;

Data

Language: English
Year of publishing:
Typology: 1.08 - Published Scientific Conference Contribution
Organization: UNG - University of Nova Gorica
UDC: 004
COBISS: 149331459 Link will open in a new window
Views: 131
Downloads: 0
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

URN: URN:SI:UNG
Type (COBISS): Not categorized
Pages: Str. 71-78
DOI: 10.1007/978-981-10-7566-7_8
ID: 18625136