Abstract Balanced sampling is a random method for sample selection, the use of which preferable when auxiliary information available all units population. However, implementing balanced can be challenging task, and this due in part to computational efforts required necessity respect balancing constraints inclusion probabilities. In present paper, new algorithm selecting samples proposed. This i...

Software testing is an important stage in the software development process, which key to ensure quality and improve reliability. fault localization most part of testing. In this paper, problem modeled as a combinatorial optimization problem, using function call path starting point. A heuristic search algorithm based on hybrid genetic simulated annealing used locate defects. Experimental results...

Received on:2/6/2009 Accepted on:1/4/2010 Abstract Simulated annealing (SA) has been considered as a good tool for search and optimization problems which represent the abstraction of obtaining the crystalline structure through a physical process. This algorithm works sequentially that the current state will produce only one next state. That will make the search to be slower and the important dr...

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis...