Št. zadetkov: 17
Izvirni znanstveni članek
Oznake:
graph labeling;square grid;labeling number;frequency assignment problems;FAP;
For a fixed integer $D (\geq 3)$ and $\lambda$ $\in$ $\mathbb{Z}^+$, a $\lambda$-$L(D, 2, 1)$-$labeling$ of a graph $G = (V, E)$ is the problem of assigning non-negative integers (known as labels) from the set $\{0, \ldots, \lambda\}$ to the vertices of $G$ such that if any two vertices in $V$ are o ...
Leto:
2019
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
single-row facility layout problem;SRFLP;single-row equidistant facility layout problem;SREFLP;population-based heuristic;improvement heuristic;local search;
The Single-Row Facility Layout Problem (SRFLP) is a well-known combinatorial optimization problem. The objective of SRFLP is to find out the arrangement of facilities with given lengths on a line so that the weighted sum of the distances between all pairs of facilities is minimized. This problem is ...
Leto:
2019
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
short term demand fluctuation;frequency assignment problem;FAP;cellular network;perturbation;heuristic algorithm;
In cellular network short term demand fluctuation is a very common phenomenon. The demand of any cell may increase or decrease slightly or the system may expand by adding additional cells or the system may shrink if the demands of certain number of cells become zero. In this paper, the perturbation- ...
Leto:
2018
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
frequency assignment problem;perturbation-minimizing frequency assignment problem;perturbation;heuristic algorithm;
Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for ...
Leto:
2016
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
k-center sum problem;clustering problem;multi-objective optimization;NSGA-II;facility location problem;
Given a set P of n objects in two dimensional plane and a positive integer k (≤ n), we have considered the problem of partitioning P into k clusters of circular shape so as to minimize the following two objectives: (i) the sum of radii of these k circular clusters and (ii) the number of points of P ...
Leto:
2015
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
L(4, 3, 2, 1)-labeling;labeling number;graph labeling;channel assignment problem;
An L(4, 3, 2, 1)-labeling of a graph is a function which assigns label to each vertex of the graph such that if two vertices are one, two, three and four distance apart then assigned labels must have a difference of at least 4, 3, 2 and 1 respectively between them. This paper presents L(4, 3, 2, 1)- ...
Leto:
2015
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
facility location;enclosing problem;optimization problem;genetic algorithm;
Given a set P of n-points (customers) on the plane and a positive integer k (1 ≤ k ≤ n), the objective is to find a placement of k circles (facilities) such that the union of k circles contains all the points of P and the sum of the radii of the circles is minimized. We have proposed a Genetic Algor ...
Leto:
2014
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
maximal covering location problem;facility location;genetic algorithm;
It is often needed to install limited number of facilities to address the demand of customers due to resource constraints and thus the requirement to provide service to all customers is not possible to meet. In such situation, the facilities are installed (placed) so that the maximum demand can be m ...
Leto:
2013
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
facility location problem (FLP);fuzzy capacitated maximal covering location problem (FCMCLP);particle swarm optimization (PSO);differential evolution (DE);artificial bee colony (ABC);firefly algorithm (FA);
The Maximal Covering Location Problem (MCLP) is concerned with the optimal placement of a fixed number of facilities to cover the maximum number of customers. This article considers a new variant of MCLP where both the coverage radii of facilities and the distance between customer and facility are f ...
Leto:
2022
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
maximal covering location problem;MCLP;multi-objective MCLP;customers' preferences;multi-objective harmony search algorithm;MOHSA;NSGA II;CPLEX;
The maximal covering location problem (MCLP) is a well-known combinatorial optimization problem with several applications in emergency and military services as well as in public services. Traditionally, MCLP is a single objective problem where the objective is to maximize the sum of the demands of c ...
Leto:
2021
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)