Search results for "Computer programming"
showing 10 items of 741 documents
Complementary Judgment Matrix Method with Imprecise Information for Multicriteria Decision-Making
2018
The complementary judgment matrix (CJM) method is an MCDA (multicriteria decision aiding) method based on pairwise comparisons. As in AHP, the decision-maker (DM) can specify his/her preferences using pairwise comparisons, both between different criteria and between different alternatives with respect to each criterion. The DM specifies his/her preferences by allocating two nonnegative comparison values so that their sum is 1. We measure and pinpoint possible inconsistency by inconsistency errors. We also compare the consistency of CJM and AHP trough simulation. Because preference judgments are always more or less imprecise or uncertain, we introduce a way to represent the uncertainty throu…
State-Feedback Stabilization for a Class of Stochastic Feedforward Nonlinear Time-Delay Systems
2013
We investigate the state-feedback stabilization problem for a class of stochastic feedforward nonlinear time-delay systems. By using the homogeneous domination approach and choosing an appropriate Lyapunov-Krasovskii functional, the delay-independent state-feedback controller is explicitly constructed such that the closed-loop system is globally asymptotically stable in probability. A simulation example is provided to demonstrate the effectiveness of the proposed design method.
A New Crowded Comparison Operator in Constrained Multiobjective Optimization for Capacitors Sizing and Siting in Electrical Distribution Systems
2005
This paper presents a new Crowded Comparison Operator (CCO) for NSGA-II to solve the Multiobjective and constrained problem of optimal capacitors placement in electrical distribution systems.
Incremental heuristic approach for meter placement in radial distribution systems
2019
The evolution of modern power distribution systems into smart grids requires the development of dedicated state estimation (SE) algorithms for real-time identification of the overall system state variables. This paper proposes a strategy to evaluate the minimum number and best position of power injection meters in radial distribution systems for SE purposes. Measurement points are identified with the aim of reducing uncertainty in branch power flow estimations. An incremental heuristic meter placement (IHMP) approach is proposed to select the locations and total number of power measurements. The meter placement procedure was implemented for a backward/forward load flow algorithm proposed by…
Biased Modern Heuristics for the OCST Problem
2011
Biasing modern heuristics is an appropriate possibility in designing problem-specific and high-quality modern heuristics. If we have knowledge about a problem we can bias the design elements of modern heuristics, namely the representation and search operator, fitness function, the initial solution, or even the search strategy. This chapter presents a case study on how the performance of modern heuristics can be increased by biasing the design elements towards high-quality solutions. Results show that problem-specific and biased modern heuristics outperform standard variants and even for large problem instances high-quality solutions can be found.
Cross-entropy-based adaptive optimization of simulation parameters for Markovian-driven service systems
2005
Abstract Markov fluid models represent a general description of the process of service request arrivals to service systems. The solution of performance analysis problems incorporating them often calls for a simulation approach, for which a reference methodology is Importance Sampling. However, in this case the appropriate choice of the biasing conditions is a problem in itself. In this paper an iterative method based on the cross-entropy is proposed for this choice. The equations are given that allow to derive the biasing conditions from the simulation itself. The application of the proposed method to three different sample cases, referring to one transient scenario (finite time horizon and…
An Island Strategy for Memetic Discrete Tomography Reconstruction
2014
In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …
A choice of bilevel linear programming solving parameters: factoraggregation approach
2013
Our paper deals with the problem of choosing correct parameters for the bilevel linear program- ming solving algorithm proposed by M. Sakawa and I. Nishizaki. We suggest an approach based on fac- toraggregation, which is a specially designed general aggregation operator. The idea of factoraggregation arises from factorization by the equivalence relation generated by the upper level objective function. We prove several important properties of the factorag- gregation result regarding the analysis of param- eters in order to find an optimal solution for the problem. We illustrate the proposed method with some numerical and graphical examples, in particu- lar we consider a modification of the m…
Learning Automata-Based Solutions to Stochastic Nonlinear Resource Allocation Problems
2009
“Computational Intelligence” is an extremely wide-ranging and all-encompassing area. However, it is fair to say that the strength of a system that possesses “Computational Intelligence” can be quantified by its ability to solve problems that are intrinsically hard. One such class of NP-Hard problems concerns the so-called family of Knapsack Problems, and in this Chapter, we shall explain how a sub-field of Artificial Intelligence, namely that which involves “Learning Automata”, can be used to produce fast and accurate solutions to “difficult” and randomized versions of the Knapsack problem (KP).
Simultaneous Airline Scheduling
2008
Currently, there are no solution approaches available to construct and optimize airline schedules within a single model. All existing approaches decompose the problem into smaller and less complex subproblems and solve those subproblems separately. This chapter presents a metaheuristic for simultaneous airline scheduling where several different subproblems are integrated into one single optimization model, except for crew scheduling. The problem-specific metaheuristic uses an adaptive procedure for operator selection to allow an efficient choice between a variety of different operators. Experiments are conducted as proof-of-concept and to calibrate free parameters. Comparing different searc…