in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then, we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim’s algorithm for the unconstrained minimum spanning ...

This paper describes the design and implementation of robotic agents for the RoboCup Simulation 2D category that learns using a recently proposed Heuristic Reinforcement Learning algorithm, the Heuristically Accelerated Q–Learning (HAQL). This algorithm allows the use of heuristics to speed up the well-known Reinforcement Learning algorithm Q–Learning. A heuristic function that influences the c...

The scale of data in a MapReduce system is increasing quickly. Thus how to efficiently schedule a set of production jobs has become increasingly important. For a given set of jobs, a well-designed scheduling algorithm can significantly reduce makespan and increase the utilization of clusters. However, there exists very few studies that aim to construct a scheduler that minimizes the makespan of...

abstract the muskingum method is frequently used to route floods in hydrology. however, application of the model is still difficult because of the parameter estimation’s. recently, some of heuristic methods have been used in order to estimate the nonlinear muskingum model. this paper presents a efficient heuristic algorithm, simulated annealing, which has been used to estimate the three paramet...

The aim of this study is to present a hybrid algorithm based on two meta-heuristic algorithms named Vibration Damping Optimization (VDO) algorithm and Genetic Algorithm (GA) for solving the stochastic capacitated location-allocation problem. For solving the model more efficiently, the simplex algorithm, stochastic simulation and the proposed hybrid algorithm are integrated to design a powerful ...

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

A Two-phase model for configuring a cellular manufacturing system is proposed. In phase (I), for the first time, number of cells is considered as a decision variable. In phase (II), pursing two different objectives, one minimization of underload and the other, maximization of similarity of parts within a group, the design procedure is performed. As one cannot have these two objects together, a ...

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...