Št. zadetkov: 22
Izvirni znanstveni članek
Oznake:
maximal covering location problem;harmony search algorithm;opposition-based learning;facility location problem;opposite number;
In this article, an improved harmony search algorithm (IHSA) that utilizes opposition-based learning is presented for solving the maximal covering location problem (MCLP). The MCLP is a well-known facility location problem where a fixed number of facilities are opened at a given potential set of fac ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
single allocation p-hub location problem;ring backbone network;VoD services;particle swarm optimization;PSO;factoradics;CPLEX;
In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allo ...
Leto:
2021
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
video-on-demand services;VoD services;content distribution networks;database segment location;hub location;multiple hub allocation;differential evolution;IBM ILOG CPLEX;
In video-on-demand (VoD) services, large volumes of digital data are kept at hubs which are spatially distributed over large geographic areas and users are connected to these hubs based on their demands. In this article, we consider a large database of video files, that are pre-partitioned to multip ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
optical network;WDM;traffic grooming;network components;green optical network;
The cost of optical backbone network has increased nowadays. So we need to reduce this cost. One of the major contributory costs is the power consumed by the underlying network. Power may also be consumed by different network equipments viz. add-drop multiplexers (ADM), Network Interface Device (NID ...
Leto:
2012
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
dynamic pickup problem;dynamic delivery problem;time windows;heuristic;
Motivated by the challenges faced by a logistics company, we present a new variant of the dynamic capacitated pickup and delivery problem with time windows (PDPTW) where excessive changes of unaffected routes are undesirable. In real-life scenarios, different dynamism sources such as canceled reques ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
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)