Combinatorial Designs on Constraint Satisfaction Problem (VRP)
| Autor: | Manuel Ornelas-Rodríguez, Héctor Puga, Lucero Ortiz-Aguilar, J. Martín Carpio, Juan A. Montesino-Guerra, Alfonso Rojas-Domínguez |
|---|---|
| Rok vydání: | 2020 |
| Předmět: | |
| Zdroj: | Intuitionistic and Type-2 Fuzzy Logic Enhancements in Neural and Optimization Algorithms: Theory and Applications ISBN: 9783030354442 Intuitionistic and Type-2 Fuzzy Logic Enhancements in Neural and Optimization Algorithms |
| DOI: | 10.1007/978-3-030-35445-9_36 |
| Popis: | The constraint satisfaction problems (CSP) often show great complexity and require a combination of heuristic methods and combinatorial search to be solved in a reasonable time. Therefore, they are of particular importance in the area of intelligent systems. A proposal of a methodology for solving CSP problems is presented, in which the characteristics of combinatorial designs based on algebraic structures, such as Mutually Orthogonal Latin Squares, are exploited in the search for solutions (answers) to a CSP problem. The proposal and the set of heuristics associated with the combinatorial design are evaluated, looking for the pair of heuristics with the best performance in the set of artificial instances of the vehicle routing problem (VRP). The results show the usefulness of the combinatorial designs to find solutions that resolve artificial instances and support the feasibility to extend its application on instances of the state-of-the-art and later on different problem domains. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|