Search results for "Algorithm"
showing 10 items of 4887 documents
Evolution of OO Methods: the unified case
1997
This paper takes an evaluative look into OO methods and especially the evolution of the new snified method from its ancestors, OMT and OODA. The paper ries to classify the components of the earlier ethods and identify the parts that have been taken into the Unified ethod. The research applies the method metrics approach. For the sake of compactness we limit ourselves to the class diagram technique of all methods. We make observations about the number of concepts in each variation and show how the metrics can be used to analyse the changes in the techniques.
A branch and bound algorithm for the matrix bandwidth minimization
2008
In this article, we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the non-zero elements of the corresponding symmetrical matrix. We propose a new branch and bound algorithm and new expressions for known lower bounds for this problem. Empirical results with a collection of previously reported instances indicate that the propose…
Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
2021
Abstract The multi-compartment vehicle routing problem with flexible compartment sizes is a variant of the classical vehicle routing problem in which customers demand different product types and the vehicle capacity can be separated into different compartments each dedicated to a specific product type. The size of each compartment is not fixed beforehand but the number of compartments is limited. We consider two variants for dividing the vehicle capacity: On the one hand the vehicle capacity can be discretely divided into compartments and on the other hand compartment sizes can be divided continuously. The objective is to minimize the total distance of all vehicle routes such that all custo…
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.
An ant colony optimization-based fuzzy predictive control approach for nonlinear processes
2015
In this paper, a new approach for designing an adaptive fuzzy model predictive control (AFMPC) based on the ant colony optimization (ACO) is proposed. On-line adaptive fuzzy identification is introduced to identify the system parameters. These parameters are used to calculate the objective function based on a predictive approach and structure of RST control. Then the optimization problem is solved based on an ACO algorithm, used at the optimization process in AFMPC to determine optimal controller parameters of RST control. The utility of the proposed controller is demonstrated by applying it to two nonlinear processes, where the proposed approach provides better performances compared with p…
A Framework for Assessing the Condition of Crowds Exposed to a Fire Hazard Using a Probabilistic Model
2014
Published version of an article in the journal: International Journal of Machine Learning and Computing. Also available from the publisher at: http://dx.doi.org/10.7763/IJMLC.2014.V4.379 open Access Allocating limited resources in an optimal manner when rescuing victims from a hazard is a complex and error prone task, because the involved hazards are typically evolving over time; stagnating, building up or diminishing. Typical error sources are: miscalculation of resource availability and the victims’ condition. Thus, there is a need for decision support when it comes to rapidly predicting where the human fatalities are likely to occur to ensure timely rescue. This paper proposes a probabil…
Some Experiments in Supervised Pattern Recognition with Incomplete Training Samples
2002
This paper presents some ideas about automatic procedures to implement a system with the capability of detecting patterns arising from classes not represented in the training sample. The procedure aims at incorporating automatically to the training sample the necessary information about the new class for correctly recognizing patterns from this class in future classification tasks. The Nearest Neighbor rule is employed as the central classifier and several techniques are added to cope with the peril of incorporating noisy data to the training sample. Experimental results with real data confirm the benefits of the proposed procedure.
Multiple UAV cooperative path planning via neuro-dynamic programming
2004
In this paper, a team of n unmanned air-vehicles (UAVs) in cooperative path planning is given the task of reaching the assigned target while i) avoiding threat zones ii) synchronizing minimum time arrivals on the target, and iii) ensuring arrivals coming from different directions. We highlight three main contributions. First we develop a novel hybrid model and suit it to the problem at hand. Second, we design consensus protocols for the management of information. Third, we synthesize local predictive controllers through a distributed, scalable and suboptimal neuro-dynamic programming (NDP) algorithm.
Distributed Coverage of Ego Networks in F2F Online Social Networks
2016
Although most online social networks rely on a centralized infrastructure, several proposals of Distributed Online Social Networks (DOSNs) have been recently presented. Since in DOSNs user profiles are stored on the peers of the users belonging to the network, one of the main challenges comes from guaranteeing the profile availability when the owner of the data is not online. In this paper, we propose a DOSN based on a friend-to-friend P2P overlay where the user's data is stored only on friend peers. Our approach is based on the ego-network concept, which models the social network from the local point of view of a single user. We propose a distributed algorithm which is based on the notion …