The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Set Covering Problem and Set Partitioning Problem are models for many important industrial applications. In this paper, we solve some Operational Research benchmarks with Ant Colony Optimization using a new transition rule. A Lookahead mechanism was incorporated to check constraint consistency in each iteration. Computational results are presented showing the advantages to use this additional mechanism...
Subset problems are models for many important applications in the field of operational research. In this paper, we solve some benchmarks of the set partitioning problem with an ant-based algorithm using a transition rule with a lookahead mechanism. It was incorporated to check constraint consistency in each iteration. Computational results are presented showing the advantages to use this additional...
A two-phase set partitioning model is proposed to solve passenger transportation, this problem is a real life application for the pickup and delivery problem where vehicles have to transport passengers from their locations to different destinations with minimal routing cost. Following the classical cluster-first route-second approach the problem is modelled in two phases and solved like a set partitioning...
This paper is motivated by the need to address the innovative development of algorithms to solve combinatorial problems, generally issued from decision making. Because modeling and resolution of this kind of problems is a software engineering subject, then to find better ways of developing algorithms, solvers and metaheuristics is our interest too. Here, we fixed some concepts from knowledge management,...
In order to be able to solve any combinatorial optimization problem it seems that a good idea is to use both incomplete and complete techniques together. When problems are easy enough to allow searching for the optimal solution, complete techniques can be used. When problems become harder, incomplete techniques represent a good alternative in order to solve approximately the problem. Particularly,...
Constraint programming is one of the major contributions of computer science for solving problems of high complexity. This paradigm is used to represent a wide variety of problems that can be modeled like constraint satisfaction problems and solving them via constraint propagation and enumeration. In this work, we study the resolution of puzzles with this approach, we evaluate the performance of different...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.