This paper proposes a heuristic method for the sensor selection problem that uses a state vector fusion approach as a data fusion method. We explain the heuristic to estimate a stationary target position. Given a first sensor with specified accuracy and by using genetic algorithm, the heuristic selects second sensor such that the fusion of two sensor measurements would yield an optimal estimati...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

integrated production-distribution planning (pdp) is one of the most important approaches in supply chain networks. we consider a supply chain network (scn) to consist of multi suppliers, plants, distribution centers (dcs), and retailers. a bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multiple sinks. We design an approximation algorithm to minimize the latency of data collection schedule and show that it gives a constant-factor performance guarantee. We also present a heuristic algorithm based on breadth...

In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A RWA problem for scheduled lightpath demands (SLDs) has been solved by combinatorial optimal solution (COS) and graph coloring, or heuristic sequential RWA (sRWA). Such methods are very complex and incurs large computational over...

In this paper, we present a dynamic ant colony optimisation (ACO) algorithm to solve dynamic traffic routing problem. The main objective of this work is to search out the least-time-cost route in a variable-edge-weight graph. We introduce time-dependent pheromones and electric-field model as two heuristic factors to improve the basic ACO. The simulation results show that the proposed dynamic AC...

Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, the connectivity matrix of edges is used for genotype representation. Some novel heuristic algorithms are also proposed for mutation, crossover, and creation of...

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffic of multicast in hypercube multiprocessors. We propose three heuristic algorithms for the three ...

The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, the predecessors encoding is used for genotype representation. Some novel...