Encontrados 11 documentos, a visualizar página 1 de 2

SAFE-PORT project: an Approach to Port Surveillance and Protection

SAFE-PORT is a recently started project addressing the complex issue of determining the best configurations of resources for harbour and port surveillance and protection. More specifically, the main goal is to find, for any given scenario, an adequate set of configuration solutions - i.e., number and type of sensors and equipments, their locations and operating modes, the corresponding personnel and other suppo...

The Safe-Port project: an approach to port surveillance and protection

SAFE-PORT is a recently started project addressing the complex issue of determining the best configurations of resources for harbour and port surveillance and protection. More specifically, the main goal is to find, for any given scenario, an adequate set of configuration solutions — i.e., number and type of sensors and equipments, their locations and operating modes, the corresponding personnel and other suppo...

A dynamic location problem with maximum decreasing capacities

Abstract In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This problem i...

A memetic algorithm for multi-objective dynamic location problems

Abstract This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, closed a...

SABILOC: um sistema de apoio à decisão para análise de problemas de localização...

Internet packet routing: Application of a K-quickest path algorithm

This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely ...

Efficient primal-dual heuristic for a dynamic location problem

In this paper the dynamic location problem with opening, closure and reopening of facilities is formulated and an efficient primal-dual heuristic that computes both upper and lower limits to its optimal solution is described. The problem here studied considers the possibility of reconfiguring any location more than once over the planning horizon. This problem is NP-hard (the simple plant location problem is a s...

Computational experiments with a lazy version of a  K  quickest simple path ran...

Abstract The quickest path problem is related to the classical shortest path problem, but its objective function concerns the transmission time of a given amount of data throughout a path, which involves both cost and capacity. The K-quickest simple paths problem generalises the latter, by looking for a given number K of simple paths in non-decreasing order of transmission time. Two categories of algorithm...

A comprehensive survey on the quickest path problem

Abstract This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a n...

An algorithm for ranking quickest simple paths

In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is , which is also the best-known complexity to solve this problem. The worst-case memory complexity is , which improves the existing algorithms. Finally, comparative computational results, with o...