Optimizing Large- Scale Combinatorial Problems using Max-Min Ant System Algorithm
نویسندگان
چکیده
The maintenance scheduling of thermal generators is a large-scale combinatorial optimization problem with constraints. In this paper we introduce the Max-Min Ant System based version of the Ant System. This algorithm reinforces local search in neighborhood of the best solution found in each iteration while implementing methods to slow convergence and facilitate exploration.Max-Min Ant System (MMAS) algorithm has been proved to be very effective in finding optimum solution to hard combinational optimization problems. To show its efficiency and effectiveness, the proposed Max-Min Ant System is applied to a realscale system, and further experimenting leads to results that are commented.
منابع مشابه
MAX-MIN Ant System
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...
متن کاملMax{min Ant System and Local Search for the Traveling Salesman Problem
| Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX{MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the we...
متن کاملReactive Max-min Ant System: an Experimental Analysis of the Combination with K-opt Local Searche
Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. The exploration versus exploitation dilemma rises in ACO search. Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation. It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary explora...
متن کاملMultiobjective Max-Min Ant System. An application to Multicast Traffic Engineering
Ant Colony Optimization (ACO) has been already established as a practical approach to solve single-objective combinatorial problems. This work proposes a new approach for the resolutions of Multi-Objective Problems (MOPs) inspired in Max-Min Ant System (MMAS). To probe our new approach, a multicast traffic-engineering problem was solved using the proposed approach as well as a Multiobjective Mu...
متن کاملImprovements on the Ant - System :
In this paper we present MAX{MIN Ant System (MMAS) that improves on Ant System. MMAS is a general purpose heuristic algorithm based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In the experiments we apply MMAS to symmetric and asymmetric Traveling Salesman Problems. We describe in detail the improvements on Ant System, discuss the a...
متن کامل