Data collection methods used for localization in healthcare facilities involving human data collection often tend to generate inconsistent and ambiguous data. To address these issues, an automated ceiling mounted mobile Real-Time Location System (mRTLS) is proposed. The system utilizes mobile Radio Frequency IDentification (RFID) and is evaluated using agent based modeling. A prototypical agent...

We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization (MOCO) problems to construct an approximation of the e$cient set of such problem. In order to deal with large-scale problems, we transform this approach to propose an interactive procedure. The method is tested on the multi-objective knapsack problem and the multi-objective assig...

The circuit design problem consists in determining acceptable parameter values (resistors, capacitors, transistor geometries . . . I which allow the circuit to meet various user given operational criteria (DC consumption, AC bandwidth, transient rise times, etc). This task is equivalent to a multidimensional and/or multi objective optimization problem: n-variables functions have to be minimized...

Providing resource for virtual services in cloud computing which requires saving the resource and minimizing the amount of energy consumption is critical. In this study, we propose the resource model and linear programming formulation for multi-dimensional resource allocation problem. Based on the simulated annealing algorithm, RASA algorithms were designed to solve and evaluate through Cloudsi...

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...

In this paper, we present a data mining approach to challenges in the matching and integration of heterogeneous datasets. In particular, we propose solutions to two problems that arise in combining information from different results of scientific research. The first problem, attribute matching, involves discovery of correspondences among distinct numeric-typed summary features (“attributes”) th...

Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a wellstudied NP-hard problem of importance in communications network design and other network-related problems. In this paper we describe some previously proposed algorithms for solving the problem, and then introduce a novel tree construction algorithm called the Randomised Primal Method (RPM) which builds degree-const...

THE DRP (dial a ride problem) consists on determining and planifiying the operated tours of vehicles in order to satisfy the user’s requests hoping to become origin’s points to destination’s points. The DRP is bind to NPdifficult problems, in order to solve it, many researchers have been used multi objective approached methods; actually our approach consists on reducing the number of vehicles, ...

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...