Log in

Relevant bibliographies by topics / Constraint Handling Techniques / Journal articles

To see the other types of publications on this topic, follow the link: Constraint Handling Techniques.

Journal articles on the topic 'Constraint Handling Techniques'

Author: Grafiati

Published: 4 June 2021

Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Constraint Handling Techniques.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

LIU, BING. "SPECIFIC CONSTRAINT HANDLING IN CONSTRAINT SATISFACTION PROBLEMS." International Journal on Artificial Intelligence Tools 03, no. 01 (1994): 79–96. http://dx.doi.org/10.1142/s0218213094000066.

Full text

Abstract:

Abundant literatures exist on consistency techniques for solving Constraint Satisfaction Problems (CSPs). These literatures, however, focused mainly on finding efficient general techniques to achieve network consistency and to solve CSPs. So far, many techniques have been reported, e.g., node consistency, arc consistency, path consistency, k-consistency, forward checking, lookahead, partial lookahead, etc. Not enough attention has been given to individual constraints, and how constraint specific features may be exploited for more efficient consistency check. Many types of constraints exist in

APA, Harvard, Vancouver, ISO, and other styles

2

Kramer, Oliver. "A Review of Constraint-Handling Techniques for Evolution Strategies." Applied Computational Intelligence and Soft Computing 2010 (2010): 1–11. http://dx.doi.org/10.1155/2010/185063.

Full text

Abstract:

Evolution strategies are successful global optimization methods. In many practical numerical problems constraints are not explicitly given. Evolution strategies have to incorporate techniques to optimize in restricted solution spaces. Famous constraint-handling techniques are penalty and multiobjective approaches. Past work has shown that in particular an ill-conditioned alignment between the coordinate system of Gaussian mutation and the constraint boundaries leads to premature convergence. Covariance matrix adaptation evolution strategies offer a solution to this alignment problem. Last, met

APA, Harvard, Vancouver, ISO, and other styles

3

Mallipeddi, R., and Ponnuthurai N. Suganthan. "Ensemble of Constraint Handling Techniques." IEEE Transactions on Evolutionary Computation 14, no. 4 (2010): 561–79. http://dx.doi.org/10.1109/tevc.2009.2033582.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nordin, Axel, Damien Motte, Andreas Hopf, Robert Bjärnemo, and Claus-Christian Eckhardt. "Constraint-handling techniques for generative product design systems in the mass customization context." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 27, no. 4 (2013): 387–99. http://dx.doi.org/10.1017/s0890060413000383.

Full text

Abstract:

AbstractGenerative product design systems used in the context of mass customization are required to generate diverse solutions quickly and reliably without necessitating modification or tuning during use. When such systems are employed to allow for the mass customization of product form, they must be able to handle mass production and engineering constraints that can be time-consuming to evaluate and difficult to fulfill. These issues are related to how the constraints are handled in the generative design system. This article evaluates two promising sequential constraint-handling techniques an

APA, Harvard, Vancouver, ISO, and other styles

5

Yang, Ning, and Hai-Lin Liu. "Adaptively Allocating Constraint-Handling Techniques for Constrained Multi-objective Optimization Problems." International Journal of Pattern Recognition and Artificial Intelligence 35, no. 08 (2021): 2159032. http://dx.doi.org/10.1142/s0218001421590321.

Full text

Abstract:

For solving constrained multi-objective optimization problems (CMOPs), an effective constraint-handling technique (CHT) is of great importance. Recently, many CHTs have been proposed for solving CMOPs. However, no single CHT can outperform all kinds of CMOPs. This paper proposes an algorithm, namely, ACHT-M2M, which adaptively allocates the existing CHTs in an M2M framework for solving CMOPs. To be more specific, a CMOP is first decomposed into several constrained multi-objective optimization subproblems by ACHT-M2M. Each subproblem has a subpopulation in a subregion. CHT for each subregion is

APA, Harvard, Vancouver, ISO, and other styles

6

Malan, Katherine M., and I. Moser. "Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces." Evolutionary Computation 27, no. 2 (2019): 267–89. http://dx.doi.org/10.1162/evco_a_00222.

Full text

Abstract:

The notion and characterisation of fitness landscapes has helped us understand the performance of heuristic algorithms on complex optimisation problems. Many practical problems, however, are constrained, and when significant areas of the search space are infeasible, researchers have intuitively resorted to a variety of constraint-handling techniques intended to help the algorithm manoeuvre through infeasible areas and toward feasible regions of better fitness. It is clear that providing constraint-related feedback to the algorithm to influence its choice of solutions overlays the violation lan

APA, Harvard, Vancouver, ISO, and other styles

7

Javed, Hassan, Muhammad Asif Jan, Nasser Tairan, et al. "On the Efficacy of Ensemble of Constraint Handling Techniques in Self-Adaptive Differential Evolution." Mathematics 7, no. 7 (2019): 635. http://dx.doi.org/10.3390/math7070635.

Full text

Abstract:

Self-adaptive variants of evolutionary algorithms (EAs) tune their parameters on the go by learning from the search history. Adaptive differential evolution with optional external archive (JADE) and self-adaptive differential evolution (SaDE) are two well-known self-adaptive versions of differential evolution (DE). They are both unconstrained search and optimization algorithms. However, if some constraint handling techniques (CHTs) are incorporated in their frameworks, then they can be used to solve constrained optimization problems (COPs). In an early work, an ensemble of constraint handling

APA, Harvard, Vancouver, ISO, and other styles

8

Cinar, Ahmet, and Mustafa Kiran. "The Performance of Penalty Methods on Tree-Seed Algorithm for Numerical Constrained Optimization Problems." International Arab Journal of Information Technology 17, no. 5 (2020): 799–807. http://dx.doi.org/10.34028/iajit/17/5/13.

Full text

Abstract:

The constraints are the most important part of many optimization problems. The metaheuristic algorithms are designed for solving continuous unconstrained optimization problems initially. The constraint handling methods are integrated into these algorithms for solving constrained optimization problems. Penalty approaches are not only the simplest way but also as effective as other constraint handling techniques. In literature, there are many penalty approaches and these are grouped as static, dynamic and adaptive. In this study, we collect them and discuss the key benefits and drawbacks of thes

APA, Harvard, Vancouver, ISO, and other styles

9

Villa-Acevedo, Walter, Jesús López-Lezama, and Jaime Valencia-Velásquez. "A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem." Energies 11, no. 9 (2018): 2352. http://dx.doi.org/10.3390/en11092352.

Full text

Abstract:

This paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming at minimizing power losses while keeping network constraints. The proposed constraint handling approach is based on a product of sub-functions that represents permissible limits on system variables and that includes a specific goal on power loss reduction. The main advantage of this approach is the fact that it allows a straightforward verification o

APA, Harvard, Vancouver, ISO, and other styles

10

Carvalho, Érica Da Costa Reis, José Pedro Gonçalves Carvalho, Heder Soares Bernardino, Patrícia Habib Hallak, and Afonso Celso de Castro Lemonge. "AN ADAPTIVE CONSTRAINT HANDLING TECHNIQUE FOR PARTICLE SWARM IN CONSTRAINED OPTIMIZATION PROBLEMS." Revista CIATEC-UPF 8, no. 1 (2016): 39. http://dx.doi.org/10.5335/ciatec.v8i1.6023.

Full text

Abstract:

Nature inspired meta-heuristics are largely used to solve optimization problems. However, these techniques should be adapted when solving constrained optimization problems, which are common in real world situations. Here an adaptive penalty approach (called Adaptive Penalty Method, APM) is combined with a particle swarm optimization (PSO) technique to solve constrained optimization problems. This approach is analyzed using a benchmark of test-problems and 5 mechanical engineering problems. Moreover, three variants of APM are considered in the computational experiments. Comparison results show

APA, Harvard, Vancouver, ISO, and other styles

11

Hobbie, Jared G., Amir H. Gandomi, and Iman Rahimi. "A Comparison of Constraint Handling Techniques on NSGA-II." Archives of Computational Methods in Engineering 28, no. 5 (2021): 3475–90. http://dx.doi.org/10.1007/s11831-020-09525-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Asif Jan, Muhammad, Yasir Mahmood, Hidayat Ullah Khan, et al. "Feasibility-Guided Constraint-Handling Techniques for Engineering Optimization Problems." Computers, Materials & Continua 67, no. 3 (2021): 2845–62. http://dx.doi.org/10.32604/cmc.2021.015294.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Hellwig, Michael, та Dirk V. Arnold. "Comparison of Constraint-Handling Mechanisms for the (1,λ)-ES on a Simple Constrained Problem". Evolutionary Computation 24, № 1 (2016): 1–23. http://dx.doi.org/10.1162/evco_a_00139.

Full text

Abstract:

This paper investigates constraint-handling techniques used in nonelitist single-parent evolution strategies for the problem of maximizing a linear function with a single linear constraint. Two repair mechanisms are considered, and the analytical results are compared to those of earlier repair approaches in the same fitness environment. The first algorithm variant applies reflection to initially infeasible candidate solutions, and the second repair method uses truncation to generate feasible solutions from infeasible ones. The distributions describing the strategies’ one-generation behavior ar

APA, Harvard, Vancouver, ISO, and other styles

14

Hu, Tengfei, Yong Shi, Zhenyu Luan, Yifan Xu, and Jingqiao Mao. "Ensemble of constraint-handling techniques for solving reservoir scheduling problems." Journal of Hydroinformatics 21, no. 6 (2019): 962–79. http://dx.doi.org/10.2166/hydro.2019.121.

Full text

Abstract:

Abstract Reservoir scheduling based on evolutionary algorithms needs to handle potentially stringent physical and operational constraints. Both generic and reservoir scheduling problem-specific constraint-handling techniques (CHTs) have their own merits and limitations. No CHT currently available can yield better solutions than the others consistently. To ensure good reservoir operation schedules, we develop an ensemble of CHTs (ECHT) that can utilize the advantages of different individual CHTs. In the ensemble, each CHT has its own population. In every generation, the different offspring popu

APA, Harvard, Vancouver, ISO, and other styles

15

Koziel, Slawomir, and Zbigniew Michalewicz. "Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization." Evolutionary Computation 7, no. 1 (1999): 19–44. http://dx.doi.org/10.1162/evco.1999.7.1.19.

Full text

Abstract:

During the last five years, several methods have been proposed for handling nonlinear constraints using evolutionary algorithms (EAs) for numerical optimization problems. Recent survey papers classify these methods into four categories: preservation of feasibility, penalty functions, searching for feasibility, and other hybrids. In this paper we investigate a new approach for solving constrained numerical optimization problems which incorporates a homomorphous mapping between n-dimensional cube and a feasible search space. This approach constitutes an example of the fifth decoder-based categor

APA, Harvard, Vancouver, ISO, and other styles

16

Song, Erping, and Hecheng Li. "Differential evolution using novel individual evaluation and constraint handling techniques for constrained optimization." Soft Computing 25, no. 14 (2021): 9025–44. http://dx.doi.org/10.1007/s00500-021-05831-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Yen, Gary G., and Wen-Fung Leong. "A Multiobjective Particle Swarm Optimizer for Constrained Optimization." International Journal of Swarm Intelligence Research 2, no. 1 (2011): 1–23. http://dx.doi.org/10.4018/jsir.2011010101.

Full text

Abstract:

Constraint handling techniques are mainly designed for evolutionary algorithms to solve constrained multiobjective optimization problems (CMOPs). Most multiojective particle swarm optimization (MOPSO) designs adopt these existing constraint handling techniques to deal with CMOPs. In the proposed constrained MOPSO, information related to particles’ infeasibility and feasibility status is utilized effectively to guide the particles to search for feasible solutions and improve the quality of the optimal solution. This information is incorporated into the four main procedures of a standard MOPSO a

APA, Harvard, Vancouver, ISO, and other styles

18

Muñoz-Reina, José Saúl, Miguel Gabriel Villarreal-Cervantes, and Leonel Germán Corona-Ramírez. "Empirical Study of Constraint-Handling Techniques in the Optimal Synthesis of Mechanisms for Rehabilitation." Applied Sciences 11, no. 18 (2021): 8739. http://dx.doi.org/10.3390/app11188739.

Full text

Abstract:

Currently, rehabilitation systems with closed kinematic chain mechanisms are low-cost alternatives for treatment and health care. In designing these systems, the dimensional synthesis is commonly stated as a constrained optimization problem to achieve repetitive rehabilitation movements, and metaheuristic algorithms for constrained problems are promising methods for searching solutions in the complex search space. The Constraint Handling Techniques (CHTs) in metaheuristic algorithms have different capacities to explore and exploit the search space. However, the study of the relationship in the

APA, Harvard, Vancouver, ISO, and other styles

19

Miranda-Varela, Mariana-Edith, and Efrén Mezura-Montes. "Constraint-handling techniques in surrogate-assisted evolutionary optimization. An empirical study." Applied Soft Computing 73 (December 2018): 215–29. http://dx.doi.org/10.1016/j.asoc.2018.08.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Cantú, Victor H., Catherine Azzaro-Pantel, and Antonin Ponsich. "Constraint-handling techniques within differential evolution for solving process engineering problems." Applied Soft Computing 108 (September 2021): 107442. http://dx.doi.org/10.1016/j.asoc.2021.107442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

S., Islam, Rasha M., and R. M. "Some Penalty-based Constraint Handling Techniques with Ant Lion Optimizer for Solving Constrained Optimization Problems." International Journal of Computer Applications 181, no. 30 (2018): 24–36. http://dx.doi.org/10.5120/ijca2018917412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Zeltni, Kamel, Souham Meshoul, and Heyam H. Al-Baity. "On the Convergence and Diversity of Pareto Fronts Using Swarm Intelligence Metaheuristics for Constrained Search Space." International Journal of Swarm Intelligence Research 9, no. 1 (2018): 20–38. http://dx.doi.org/10.4018/ijsir.2018010102.

Full text

Abstract:

This article reviews existing constraint-handling techniques then presents a new design for Swarm Intelligence Metaheuristics (SIM) to deal with constrained multi-objective optimization problems (CMOPs). This new design aims to investigate potential effects of leader concepts that characterize the dynamic of SIM in the hope to help the population to reach Pareto optimal solutions in a constrained search space. The new leader-based constraint handling mechanism is incorporated in Constrained Multi-Objective Cuckoo Search (C-MOCS) and Constrained Multi-Objective Particle Swarm Optimization (C-MO

APA, Harvard, Vancouver, ISO, and other styles

23

Cervantes-Culebro, Hector, Carlos A. Cruz-Villar, Maria-Guadalupe Martinez Penaloza, and Efren Mezura-Montes. "Constraint-Handling Techniques for the Concurrent Design of a Five-Bar Parallel Robot." IEEE Access 5 (2017): 23010–21. http://dx.doi.org/10.1109/access.2017.2764883.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Wu, Z. Y., and T. Walski. "Self-Adaptive Penalty Approach Compared with Other Constraint-Handling Techniques for Pipeline Optimization." Journal of Water Resources Planning and Management 131, no. 3 (2005): 181–92. http://dx.doi.org/10.1061/(asce)0733-9496(2005)131:3(181).

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Salcedo-Sanz, Sancho. "A survey of repair methods used as constraint handling techniques in evolutionary algorithms." Computer Science Review 3, no. 3 (2009): 175–92. http://dx.doi.org/10.1016/j.cosrev.2009.07.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Galán, Severino F., and Ole J. Mengshoel. "Constraint Handling Using Tournament Selection: Abductive Inference in Partly Deterministic Bayesian Networks." Evolutionary Computation 17, no. 1 (2009): 55–88. http://dx.doi.org/10.1162/evco.2009.17.1.55.

Full text

Abstract:

Constraints occur in many application areas of interest to evolutionary computation. The area considered here is Bayesian networks (BNs), which is a probability-based method for representing and reasoning with uncertain knowledge. This work deals with constraints in BNs and investigates how tournament selection can be adapted to better process such constraints in the context of abductive inference. Abductive inference in BNs consists of finding the most probable explanation given some evidence. Since exact abductive inference is NP-hard, several approximate approaches to this inference task ha

APA, Harvard, Vancouver, ISO, and other styles

27

BANBARA, MUTSUNORI, BENJAMIN KAUFMANN, MAX OSTROWSKI, and TORSTEN SCHAUB. "Clingcon: The next generation." Theory and Practice of Logic Programming 17, no. 4 (2017): 408–61. http://dx.doi.org/10.1017/s1471068417000138.

Full text

Abstract:

AbstractWe present the third generation of the constraint answer set systemclingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solvergecode, the newclingconsystem pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solverclasp. No extension is needed for parsing and groundingclingcon's hybrid modeling language since both can be accommodated by the new generic theory handling capabilities of the ASP grounde

APA, Harvard, Vancouver, ISO, and other styles

28

Chen, Y., B. W. Wah, and C. Hsu. "Temporal Planning using Subgoal Partitioning and Resolution in SGPlan." Journal of Artificial Intelligence Research 26 (August 6, 2006): 323–69. http://dx.doi.org/10.1613/jair.1918.

Full text

Abstract:

In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong locality of mutex constraints observed in many benchmarks of the Fourth International Planning Competition (IPC4), we propose to partition the constraints of a planning problem into groups based on their subgoals. Constraint partitioning leads to significantly easier subproblems that are similar to the original problem and that can be efficiently solved by the same planner with some modifications to its objective fun

APA, Harvard, Vancouver, ISO, and other styles

29

Azmi, Azralmukmin, Samila Mat Zali, Mohd Noor Abdullah, Mohammad Faridun Naim Tajuddin, and Siti Rafidah Abdul Rahim. "The performance of COR optimisation using different constraint handling strategies to solve ELD." Indonesian Journal of Electrical Engineering and Computer Science 17, no. 2 (2020): 680. http://dx.doi.org/10.11591/ijeecs.v17.i2.pp680-688.

Full text

Abstract:

This research compares the performance of Competitive Over Resources (COR) optimisation method using a different type of constraint handling strategy to solve the economic load dispatch (ELD) problem. Previously, most research focused on proposing various optimisation techniques using the Penalty Factor Strategy (PFS) to search for a better global optimum. The issue using the penalty factor is that it is difficult to find the correct tune of constant value that influences the algorithm to find the solution. The other technique is using Feasible Solution Strategy (FSS), the idea of which is to

APA, Harvard, Vancouver, ISO, and other styles

30

Wei, Yanting, Quanxi Feng, and Sainan Yuan. "Differential Evolution Algorithm Based on Ensemble of Constraint Handling Techniques and Multi-Population Framework." International Journal of Intelligence Science 10, no. 02 (2020): 22–40. http://dx.doi.org/10.4236/ijis.2020.102003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Biswas, Partha P., P. N. Suganthan, R. Mallipeddi, and Gehan A. J. Amaratunga. "Optimal power flow solutions using differential evolution algorithm integrated with effective constraint handling techniques." Engineering Applications of Artificial Intelligence 68 (February 2018): 81–100. http://dx.doi.org/10.1016/j.engappai.2017.10.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Cai, Hui, Bin Liu, and Shu Pan. "On the Cooperation Between Evolutionary Algorithms and Constraint Handling Techniques: A Further Empirical Study." IEEE Access 8 (2020): 130598–606. http://dx.doi.org/10.1109/access.2020.3009429.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

de Lucena, Rodrigo Ribeiro, Juliana Souza Baioco, Beatriz Souza Leite Pires de Lima, Carl Horst Albrecht, and Breno Pinheiro Jacob. "Optimal design of submarine pipeline routes by genetic algorithm with different constraint handling techniques." Advances in Engineering Software 76 (October 2014): 110–24. http://dx.doi.org/10.1016/j.advengsoft.2014.06.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Gerevini, A., A. Saetti, and I. Serina. "An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events." Journal of Artificial Intelligence Research 25 (February 23, 2006): 187–231. http://dx.doi.org/10.1613/jair.1742.

Full text

Abstract:

The treatment of exogenous events in planning is practically important in many real-world domains where the preconditions of certain plan actions are affected by such events. In this paper we focus on planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows. When actions have durations, handling such temporal constraints adds an extra difficulty to planning. We propose an approach to planning in these domains which integrates constraint-based temporal reasoning in

APA, Harvard, Vancouver, ISO, and other styles

35

Jan, Muhammad Asif, and Rashida Adeeb Khanum. "A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D." Applied Soft Computing 13, no. 1 (2013): 128–48. http://dx.doi.org/10.1016/j.asoc.2012.07.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

GARİP, Zeynep, Murat Erhan ÇİMEN, and Ali Fuat BOZ. "Application of Harris Hawks and Whale Optimization Algorithm with Constraint Handling Techniques: A comparative study." Journal of Intelligent Systems: Theory and Applications 4, no. 2 (2021): 76–85. http://dx.doi.org/10.38016/jista.857881.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Wu, Wenhai, Xiaofeng Guo, Siyu Zhou, and Jintao Liu. "Adaptive Constrained Differential Evolution Algorithm by Using Generalized Opposition-Based Learning." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 37, no. 5 (2019): 1000–1010. http://dx.doi.org/10.1051/jnwpu/20193751000.

Full text

Abstract:

Differential evolution is a global optimization algorithm based on greedy competition mechanism, which has the advantages of simple structure, less control parameters, higher reliability and convergence. Combining with the constraint-handling techniques, the constraint optimization problem can be efficiently solved. An adaptive differential evolution algorithm is proposed by using generalized opposition-based learning (GOBL-ACDE), in which the generalized opposition-based learning is used to generate initial population and executes the generation jumping. And the adaptive trade-off model is ut

APA, Harvard, Vancouver, ISO, and other styles

38

Sharma, Manisha, and Manjaree Pandit. "Reserve Constrained Multi-Area Economic Dispatch Employing Evolutionary Approach." International Journal of Applied Evolutionary Computation 1, no. 3 (2010): 49–69. http://dx.doi.org/10.4018/jaec.2010070103.

Full text

Abstract:

The objective of Multi-area economic dispatch (MAED) is to determine the generation levels and the interchange power between areas that minimize fuel costs, while satisfying power balance and generating limit and transmission constraints. If an area with excess power is not adjacent to a power deficient area, or the tie-line between the two areas is at transmission limit, it is necessary to find an alternative path between these two areas to transmit additional power. When a MAED problem is solved with spinning reserve constraints, the problem becomes further complicated. The power allocation

APA, Harvard, Vancouver, ISO, and other styles

39

Lee, Jung-Hua, and Ping-Teng Chang. "A survey and numerical comparison of factor-free penalty function constraint-handling techniques in genetic algorithms." Journal of the Chinese Institute of Industrial Engineers 29, no. 1 (2012): 61–86. http://dx.doi.org/10.1080/10170669.2012.656329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Nguyen, Phuong Hoai, Dong Wang, and Tung Khac Truong. "A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem." Indonesian Journal of Electrical Engineering and Computer Science 1, no. 3 (2016): 411. http://dx.doi.org/10.11591/ijeecs.v1.i3.pp411-418.

Full text

Abstract:

This paper proposes a new binary particle swarm optimization with a greedy strategy to solve 0-1 knapsack problem. Two constraint handling techniques are consider to cooperation with binary particle swarm optimization that are penalty function and greedy. The sigmoid transfer function is used to convert real code to binary code. The experimental results have proven the superior performance of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

41

Arnold, Dirk V. "Resampling versus Repair in Evolution Strategies Applied to a Constrained Linear Problem." Evolutionary Computation 21, no. 3 (2013): 389–411. http://dx.doi.org/10.1162/evco_a_00088.

Full text

Abstract:

We study the behaviour of multi-recombination evolution strategies for the problem of maximising a linear function with a single linear constraint. Two variants of the algorithm are considered: a strategy that resamples infeasible candidate solutions and one that applies a simple repair mechanism. Integral expressions that describe the strategies’ one-generation behaviour are derived and used in a simple zeroth order model for the steady state attained when operating with constant step size. Applied to the analysis of cumulative step size adaptation, the approach provides an intuitive explanat

APA, Harvard, Vancouver, ISO, and other styles

42

Uppal, Tarun, Soumyendu Raha, and Suresh Srivastava. "Inverse Simulation for Gas Turbine Engine Control through Differential Algebraic Inequality Formulation." International Journal of Turbo & Jet-Engines 35, no. 4 (2018): 373–83. http://dx.doi.org/10.1515/tjj-2016-0057.

Full text

Abstract:

Abstract Modern day gas turbines are prime movers in land, air and sea. They have stringent performance requirements to meet the complex mission objectives. Optimal control strategies can help them meet their performance objectives more efficiently. A novel inverse simulation method for optimal control and system analysis studies using Differential Algebraic Equality/Inequality (DAE/DAI) technique is brought out in this paper with a case study. The gas turbine model together with safety constraints and performance specifications is represented as a high index DAI/DAE system. The solution for t

APA, Harvard, Vancouver, ISO, and other styles

43

Saudagar, Abdul Khader Jilani. "Biomedical Image Compression Techniques for Clinical Image Processing." International Journal of Online and Biomedical Engineering (iJOE) 16, no. 12 (2020): 133. http://dx.doi.org/10.3991/ijoe.v16i12.17019.

Full text

Abstract:

Image processing is widely used in the domain of biomedical engineering especially for compression of clinical images. Clinical diagnosis receives high importance which involves handling patient’s data more accurately and wisely when treating patients remotely. Many researchers proposed different methods for compression of medical images using Artificial Intelligence techniques. Developing efficient automated systems for compression of medical images in telemedicine is the focal point in this paper. Three major approaches were proposed here for medical image compression. They are image compres

APA, Harvard, Vancouver, ISO, and other styles

44

Yoo, Do Guen, Ho Min Lee, Eui Hoon Lee, and Joong Hoon Kim. "Efficiency Evaluation of Harmony Search Algorithm according to Constraint Handling Techniques : Application to Optimal Pipe Size Design Problem." Journal of the Korea Academia-Industrial cooperation Society 16, no. 7 (2015): 4999–5008. http://dx.doi.org/10.5762/kais.2015.16.7.4999.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Coello Coello, Carlos A. "Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art." Computer Methods in Applied Mechanics and Engineering 191, no. 11-12 (2002): 1245–87. http://dx.doi.org/10.1016/s0045-7825(01)00323-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Balande, Umesh, and Deepti Shrimankar. "SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems." Mathematics 7, no. 3 (2019): 250. http://dx.doi.org/10.3390/math7030250.

Full text

Abstract:

Firefly-Algorithm (FA) is an eminent nature-inspired swarm-based technique for solving numerous real world global optimization problems. This paper presents an overview of the constraint handling techniques. It also includes a hybrid algorithm, namely the Stochastic Ranking with Improved Firefly Algorithm (SRIFA) for solving constrained real-world engineering optimization problems. The stochastic ranking approach is broadly used to maintain balance between penalty and fitness functions. FA is extensively used due to its faster convergence than other metaheuristic algorithms. The basic FA is mo

APA, Harvard, Vancouver, ISO, and other styles

47

Uppal, T., S. Raha, and S. Srivastava. "Trajectory feasibility evaluation using path prescribed control of unmanned aerial vehicle in differential algebraic equations framework." Aeronautical Journal 121, no. 1240 (2017): 770–89. http://dx.doi.org/10.1017/aer.2017.36.

Full text

Abstract:

ABSTRACTMission simulation is a critical activity in the development and operation of Unmanned Aerial Vehicles (UAVs). It is important to ascertain the feasibility of a trajectory in a mission. In this work, an algorithm has been developed for feasibility study of a trajectory of a UAV using prescribed path optimal control through an inverse simulation method. This has been done under a Differential Algebraic Equations (DAE)/Inequalities (DAI) framework. The UAV model together with constraints is represented as a high index DAE system. The trajectory that UAV shall take is prescribed as one of

APA, Harvard, Vancouver, ISO, and other styles

48

Liu, Yang. "3D Garment Real-Time Simulation in Character Animation." Advanced Materials Research 108-111 (May 2010): 753–58. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.753.

Full text

Abstract:

In this paper, a framework of 3D Real-time Garment Simulation System for character animation is presented .For the problem of computational efficiency and stability for cloth physical modeling, we proposed a cloth mass-spring model based on constraint. Take geometry sphere and cylinder as example to explaining the whole strategy which used to dealing with cloth deformable bodies colliding with environment object. We described the procedure of physically based simulation, and illustrated the result and analysis of the experiment. By using the technique of parameterized human body modelling, vir

APA, Harvard, Vancouver, ISO, and other styles

49

Escrig, M. Teresa, and Francisco Toledo. "The Integration of Qualitative Orientation and Named Distances: Application to a Qualitative Navigation Simulator." International Journal on Artificial Intelligence Tools 06, no. 04 (1997): 451–80. http://dx.doi.org/10.1142/s0218213097000244.

Full text

Abstract:

Human beings reason about different aspects of space (such as relative orientation, cardinal directions, distance, size and shape of objects) quite easily. With the aim of simulating human behavior, several models for these spatial concepts have been developed in the recent years. Cognitive considerations have made these frameworks qualitative, because they seem to deal better with the imprecision that human perception provides. However, an operational model to reason with all these spatial aspects in an integrated way has not been developed, up to now. The first aim of our research work has b

APA, Harvard, Vancouver, ISO, and other styles

50

GOMES, CARLA P. "Artificial intelligence and operations research: challenges and opportunities in planning and scheduling." Knowledge Engineering Review 15, no. 1 (2000): 1–10. http://dx.doi.org/10.1017/s0269888900001090.

Full text

Abstract:

Both the Artificial Intelligence (AI) and the Operations Research (OR) communities are interested in developing techniques for solving hard combinatorial problems, in particular in the domain of planning and scheduling. AI approaches encompass a rich collection of knowledge representation formalisms for dealing with a wide variety of real-world problems. Some examples are constraint programming representations, logical formalisms, declarative and functional programming languages such as Prolog and Lisp, Bayesian models, rule-based formalism, etc. The downside of such rich representations is th

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!