Search Results - (( using linear problem algorithm ) OR ( evolution optimisation based algorithm ))
Search alternatives:
- evolution optimisation »
- optimisation based »
- problem algorithm »
- linear problem »
-
1
-
2
Performance evaluation and benchmarking of an extended computational model of ant colony system for DNA sequence design
Published 2014“…Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. …”
Get full text
Get full text
Get full text
Article -
3
A competitive co-evolutionary approach for the nurse scheduling problem
Published 2026“…The competitive approach further exhibits smoother convergence behaviour across generations, indicating stronger optimisation dynamics and improved robustness. These findings demonstrate that competitive co-evolution provides an effective and practical alternative to static fitness-based evolutionary methods for nurse scheduling, with broader applicability to healthcare scheduling and constraint optimisation problems.…”
Get full text
Get full text
Get full text
Article -
4
A hyper-heuristic based strategy for image segmentation using multilevel thresholding
Published 2025“…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
Get full text
Get full text
Get full text
Article -
5
A hyper-heuristic based strategy for image segmentation using multilevel thresholding
Published 2025“…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
Get full text
Get full text
Get full text
Article -
6
Comparison Between Linear Programming And Integer Linear Programming: A Review
Published 2018“…Three criteria were used to evaluate the characteristics: time complexity, problem size and computational time. …”
Get full text
Get full text
Get full text
Article -
7
Stock market turning points rule-based prediction / Lersak Photong … [et al.]
Published 2021“…Finally, rule-based optimisation techniques such as Particle Swarm Optimization (PSO), Differential Evolution (DE) and Grey Wolf Optimizer (GWO) were used to minimise the amount of time employed in the stock market turning points prediction. …”
Get full text
Get full text
Book Section -
8
Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems
Published 2018“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
Genetic algorithm techniques for the design of nonlinear microwave circuits
Published 2004“…By using Sample Balance's differential of current linear and nonlinear equation as an objective function, a Genetic Algorithm routine then been constructed. …”
Get full text
Get full text
Get full text
Thesis -
10
Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions
Published 2018“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text
Thesis -
11
-
12
On network flow problems with convex cost
Published 2004“…To address this problem, we derive the optimality conditions for minimising convex and differentiable cost functions, and devise an algorithm based on the primal-dual algorithm commonly used in linear programming. …”
Get full text
Get full text
Get full text
Article -
13
Hybrid evolutionary optimization algorithms: A case study in manufacturing industry
Published 2014“…This membership function is applied for its useful performance through industrial production problems by employing hybrid evolutionary optimization algorithms. …”
Get full text
Get full text
Book -
14
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004Get full text
Get full text
Monograph -
15
Optimal power flow based on fuzzy linear programming and modified Jaya algorithms
Published 2017“…The first proposed approach is a multi-objective fuzzy linear programming optimization (MFLP) algorithm to solve the MOOPF problem. …”
Get full text
Get full text
Thesis -
16
Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance
Published 2021“…Linear programming (LP) is a mathematical modelling that formulate a problem into three components which are decision variables, objective function and constraints. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Path planning algorithm for a car like robot based on MILP method
Published 2013“…It is shown that this problem can be rewritten as a linear program with mixed integer / linear constraints that account for the collision avoidance. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
Classification for large number of variables with two imbalanced groups
Published 2020“…Several approaches have been devoted to study such problems using linear and non-linear classification rules, but limited to group imbalance rather than the combination of both problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
Get full text
Get full text
Article -
20
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
Get full text
Get full text
Article