Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Hashing vectors for tabu search
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Journal of Heuristics
Proceedings of the 3rd International Conference on Genetic Algorithms
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
Dynamic Subset Selection Based on a Fitness Case Topology
Evolutionary Computation
Optimizing parameters of a motion detection system by means of a distributed genetic algorithm
Image and Vision Computing
Accurate estimation of ICA weight matrix by implicit constraint imposition using lie group
IEEE Transactions on Neural Networks
Grasp and Guided Local Search for the examination timetabling problem
International Journal of Artificial Intelligence and Soft Computing
A survey on optimization metaheuristics
Information Sciences: an International Journal
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Journal of Heuristics
Hi-index | 0.00 |
The Guided Local Search method has been successfully applied to a number of hard combinatorial optimisation problems from the well-known TSP and QAP to real-world problems such as frequency assignment and workforce scheduling.In this paper, it is demonstrated that the potential applications of GLS are not limited to optimisation problems of discrete nature but also to difficult continuous optimisation problems. Continuous optimisation problems arise in many engineering disciplines (such as electrical and mechanical engineering) in the context of analysis, design or simulation tasks. The problem examined gives an illustrative example of the behaviour of GLS, providing insights on the mechanisms of the algorithm.