The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

The simulated annealing algorithm has been introduced into the broadcast routing of wireless sensor network so as to reduce the length and energy of broadcast path. However, its new solution is generated by randomly exchanging the location of two sensor nodes of broadcast path. Though the simulated annealing algorithm is better than 2-opt algorithm, its method of generating new solution has sti...

Less Flexibility First(LFF) principle is inspired and developed by enhancing some rule-of-thumb guidelines resulting from the generation-long work experience of human professionals in ancient days. In this paper, we generalize this principle to the classical Traveling Salesman Problem and propose a tour construction heuristic. Our new heuristic is closely related to Cheapest Insertion, a well-k...

In this paper, we propose new analog neural approaches to combinatorial optimization problems, in particular, quadratic assignment problems (QAPs). Our proposed methods are based on an analog version of the -opt heuristics, which simultaneously changes assignments for elements in a permutation. Since we can take a relatively large value, our new methods can achieve a middle-range search over po...

This paper deals with multi-period project portfolio selection problem. In this problem, the available budget is invested on the best portfolio of projects in each period such that the net profit is maximized. We also consider more realistic assumptions to cover wider range of applications than those reported in previous studies. A novel mathematical model is presented to solve the problem, con...

Statistical disclosure control (SDC) methods reconcile the need to release information to researchers with the need to protect privacy of individual records. Microaggregation is a SDC method that protects data subjects by guarantying k-anonymity: Records are partitioned into groups of size at least k and actual data values are replaced by the group means so that each record in the group is indi...

Local search with k change neighborhoods is perhaps the oldest and most widely used heuristic method for the traveling salesman problem yet almost no theoretical performance guarantees for it were previously known This paper develops several results some worst case and some probabilistic on the performance of and k opt local search for the TSP with respect to both the quality of the solution an...

Abstract. Let G be a complete (undirected) graph with 3l vertices. Given a binary weight function on the edges of G, the binary maximum 2-path partitioning problem is to compute a set of of l vertex-disjoint simple 2-edge paths with maximum total edge weight. The problem is NP-hard [6]. In this paper we propose a simple local search algorithm with polynomial running time for the problem and ana...

For a given graph G over n vertices, let OPT G denote the size of an optimal solution in G of a particular minimization problem (e.g., the size of a minimum vertex cover). A randomized algorithm will be called an α-approximation algorithm with an additive error for this minimization problem, if for any given additive error parameter > 0 it computes a value ÕPT such that, with probability at lea...