Solution of multi-objective competitive facility location problems using parallel NSGA-II on large scale computing systems

Authors:
Algirdas Lančinskas;Julius Żilinskas
Affiliations:
Institute of Mathematics and Informatics, Vilnius University, Vilnius, Lithuania;Institute of Mathematics and Informatics, Vilnius University, Vilnius, Lithuania
Venue:
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Year:
2012

Citing 8
Cited 0

A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Optimal location and design of a competitive facility

Mathematical Programming: Series A and B
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Muiltiobjective optimization using nondominated sorting in genetic algorithms

Evolutionary Computation
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models

Computers and Operations Research
Validity of the single processor approach to achieving large scale computing capabilities

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Heuristics for the facility location and design (1|1)-centroid problem on the plane

Computational Optimization and Applications
Approaches to parallelize pareto ranking in NSGA-II algorithm

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-objective firm expansion problem on competitive facility location model, and an evolutionary algorithm suitable to solve multi-objective optimization problems are reviewed in the paper. Several strategies to parallelize the algorithm utilizing both the distributed and shared memory parallel programing models are presented. Results of experimental investigation carried out by solving the competitive facility location problem using up to 2048 processing units are presented and discussed.