In general, a complex system is composed of different components that are usually subject to maintenance policy. We take into account systems containing under both preventive and corrective maintenance. Preventive considered as failure-based model, where full renewal realized after the occurrence every nth failure. It offers an imperfect each repair deteriorates component or lifetime, probabili...

Decision trees have been well studied and widely used in knowledge discovery decision support systems. One of the applications binary integer programming to form or making is knapsack problem. The problem an that involves only one constraint. generally illustrated with a bag item. be solved maximize price goods certain capacity can loaded by too. In solving problem, it done directly. this paper...

Reactive power optimization is important to ensure power quality, improve system security, and reduce active power loss. So, this paper proposed parallel immune particle swarm optimization (PIPSO) algorithm. This algorithm makes basic particle swarm optimization (BPSO) and discrete particle swarm optimization (DPSO) to optimize in parallel, and improves the convergence capability of particle sw...

This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.

A list of questions and problems posed and discussed in September 2011 at the following consecutive events held at the Fields Institute, Toronto: Workshop on Discrete Geometry, Conference on Discrete Geometry and Optimization, and Workshop on Optimization. We hope these questions and problems will contribute to further stimulate the interaction between geometers and optimizers.

This paper improves constrained simulated annealing (CSA), a discrete global minimization algorithm with asymptotic convergence to discrete constrained global minima with probability one. The algorithm is based on the necessary and suucient conditions for discrete constrained local minima in the theory of discrete La-grange multipliers. We extend CSA to solve nonlinear continuous constrained op...

A relation exists between the manner in which a statistical model is developed and the measure employed for gauging its performance. Often the model is developed by optimizing some continuous measure of performance, while its final performance is assessed in terms of some discrete measure. The question then arises as to whether a model based on the direct optimization of the discrete measure ma...