Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics

DOI10.1155/2015/713043MaRDI QIDQ1666410zbMATH OpenOpenAlexWikidataFDO

Authors Oscar Montiel, Francisco Javier Díaz Delgadillo

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/713043

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 644467
• Using concepts of fuzzy mathematics for formalization and solution of combinatorial optimization problems
• Bottleneck combinatorial optimization problems with fuzzy scenarios
• A fuzzy valuation-based local search framework for combinatorial problems
• The use of fuzzy logic in various combinatorial optimization problems
• Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives
• scientific article; zbMATH DE number 2050755
• An adaptive membrane algorithm for solving combinatorial optimization problems

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 2010446 (Why is no real title available?)
• scientific article; zbMATH DE number 2064407 (Why is no real title available?)
• 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
• An Algorithm for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computational Complexity
• Evolutionary algorithm to traveling salesman problems
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
• Path planning on a cuboid using genetic algorithms
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Solution of a Large-Scale Traveling-Salesman Problem
• The traveling salesman problem. A computational study.
• The traveling salesman problem: An overview of exact and approximate algorithms

Cited in

(3)

• Generalization of machine learning for problem reduction: a case study on travelling salesman problems
• Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers
• MineReduce: an approach based on data mining for problem size reduction

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666410)