Pareto-based and weighted sum GA-based approaches

Povzetek

The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem having single-objective function. The objective of UFLP is to find a subset of facilities from a given set of potential facility locations such that the sum of the opening costs of the opened facilities and the service cost to serve all the customers is minimized. In traditional UFLP, customers are served by their nearest facilities. In this article, we have proposed a multi-objective UFLP where each customer has a preference for each facility. Hence, the objective of the multi-objective UFLP with customers’ preferences (MOUFLPCP) is to open a subset of facilities to serve all the customers such that the sum of the opening cost and service cost is minimized and the sum of the preferences is maximized. In this article, the elitist non-dominated sorting genetic algorithm II (NSGA-II), a popular Pareto-based GA, is employed to solve this problem. Moreover, a weighted sum genetic algorithm (WSGA)-based approach is proposed to solve MOUFLPCP where conflicting two objectives of the problem are aggregated to a single quality measure. For experimental purposes, new test instances of MOUFLPCP are created from the existing UFLP benchmark instances and the experimental results obtained using NSGA-II and WSGA-based approaches are demonstrated and compared for these newly created test instances.

Ključne besede

uncapacitated facility location problems;UFLP;multi-objective UFLP with customers' preferences;MOUFLPCP;NSGA-II;weighted sum genetic algorithms;WSGA;

Podatki

Jezik: Angleški jezik
Leto izida:
Tipologija: 1.01 - Izvirni znanstveni članek
Organizacija: UNG - Univerza v Novi Gorici
UDK: 004
COBISS: 149343747 Povezava se bo odprla v novem oknu
ISSN: 1432-7643
Št. ogledov: 147
Št. prenosov: 0
Ocena: 0 (0 glasov)
Metapodatki: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Ostali podatki

URN: URN:SI:UNG
Vrsta dela (COBISS): Delo ni kategorizirano
Strani: str. 12347-12362
Letnik: ǂVol. ǂ23
Zvezek: ǂissue ǂ23
Čas izdaje: 2019
DOI: 10.1007/s00500-019-03774-1
ID: 18625122