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

DOI10.1155/2015/713043zbMATH Open1394.90572OpenAlexW1606593177WikidataQ59119000 ScholiaQ59119000MaRDI QIDQ1666410FDOQ1666410

Authors: Oscar Montiel, Francisco Javier Díaz Delgadillo 

Publication date: 27 August 2018

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

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• 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
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems

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)