ACO with Lookahead Procedures for Solving Set Partitioning and Covering Problems
نویسندگان
چکیده
Set Covering Problem and Set Partitioning Problem can model several real life situations. In this paper we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of them with Constraint Programming techniques. The Lookahead mechanism allows the incorporation of information on the anticipated decisions that are beyond the immediate choice horizon. Computational results are presented showing the advantages to use additional mechanisms to Ant Colony Optimization in strongly constrained problems like Set Partitioning Problem.
منابع مشابه
Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems
Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of information on the anticipated decisions that are beyond the immediate choic...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملACO Home January 1998 Seminars & Colloquia January 8
The set packing and set covering models are two useful models in integer programming. Sometimes, due to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution which is integral, thus solving the problem. Perfect, ideal and balanced matrices are three classes of constraint matrices with such integrality properties (for the set packing...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005