Analysis of multiobjective evolutionary algorithms on the biobjective traveling salesman problem (1,2)

No abstract is available for this paper.

• Publication year

  2020

• Venue

  Multimedia tools and applications

• Publication date

  2020-08-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s11042-020-09399-z
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Running Time Analysis of MOEA/D with Crossover on Discrete Optimization Problem

  2019cited by this paper
• On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism

  2018cited by this paper
• Evolutionary multi-objective optimization made faster by sequential decomposition

  2017cited by this paper
• Unsupervised Band Selection Based on Evolutionary Multiobjective Optimization for Hyperspectral Images

  2016cited by this paper
• A Primary Theoretical Study on Decomposition-Based Multiobjective Evolutionary Algorithms

  2016cited by this paper
• Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax

  2016influential reference
• An Evolutionary Multiobjective Approach to Sparse Reconstruction

  2014cited by this paper
• Runtime analysis for maximizing population diversity in single-objective optimization

  2014cited by this paper
• On the Runtime Analysis of Fitness Sharing Mechanisms

  2014cited by this paper
• The Effect of Memory Size on the Evolutionary Stability of Strategies in Iterated Prisoner's Dilemma

  2014cited by this paper
• Population size matters: rigorous runtime results for maximizing the hypervolume indicator

  2013influential reference
• Average Drift Analysis and Population Scalability

  2013cited by this paper
• A large population size can be unhelpful in evolutionary algorithms

  2012cited by this paper
• Theoretical analysis of two ACO approaches for the traveling salesman problem

  2012cited by this paper
• An analysis on recombination in multi-objective evolutionary optimization

  2011cited by this paper
• Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem

  2011cited by this paper
• Theoretical analysis of two ACO approaches for the traveling salesman problem

  2011cited by this paper
• On the approximation ability of evolutionary optimization with application to minimum set cover

  2010cited by this paper
• How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem

  2010cited by this paper
• A comparative runtime analysis of heuristic algorithms for satisfiability problems

  2009cited by this paper
• Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of a Simple Evolutionary Algorithm for the Multiobjective Shortest Path Problem

  2008influential reference
• UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models

  2007cited by this paper
• On Approximating Multi-Criteria TSP

  2007cited by this paper
• Simulated Annealing versus Metropolis for a TSP instance

  2007cited by this paper
• (Non)-Approximability for the Multi-criteria TSP(1, 2)

  2005cited by this paper
• Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics

  2005cited by this paper
• Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems

  2005cited by this paper
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem

  2004cited by this paper
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem

  2004cited by this paper
• The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems

  2004cited by this paper
• Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem

  2004cited by this paper
• The analysis of evolutionary algorithms on sorting and shortest paths problems

  2004cited by this paper
• A study of drift analysis for estimating computation time of evolutionary algorithms

  2004cited by this paper
• Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions

  2004cited by this paper
• Expected runtimes of a simple multi-objective evolutionary algorithm

  2003cited by this paper
• Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem

  2002cited by this paper
• On the analysis of the (1+1) evolutionary algorithm

  2002cited by this paper
• The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help

  2002cited by this paper
• Drift analysis and average time complexity of evolutionary algorithms

  2001cited by this paper
• Approximation of Multiobjective Optimization Problems

  2001cited by this paper
• Multimedia tools and applications

  1995cited by this paper
• Reducibility Among Combinatorial Problems

  1972cited by this paper

• A multi-strategy enhanced circle search algorithm based on adaptive evolutionary framework and its application in image segmentation

  2025cites this paper
• Optimizing the routing of optical distribution points on a fiber network using modified genetic algorithm (GA’s) with a travelling salesman problem approach

  2024cites this paper
• Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures

  2023cites this paper
• The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem

  2023cites this paper
• A grade-based search adaptive random slime mould optimizer for lupus nephritis image segmentation

  2023cites this paper
• Quantum Nelder‐Mead Hunger Games Search for optimizing photovoltaic solar cells

  2022cites this paper
• Novel Feedrate Optimization Method for NURBS Tool Paths Under Various Constraints

  2022cites this paper
• PECCO: A profit and cost‐oriented computation offloading scheme in edge‐cloud environment with improved Moth‐flame optimization

  2022cites this paper
• Parameter estimation of static solar photovoltaic models using Laplacian Nelder-Mead hunger games search

  2022cites this paper
• Multi-level thresholding segmentation for pathological images: Optimal performance design of a new modified differential evolution

  2022cites this paper
• Extremal Nelder–Mead colony predation algorithm for parameter estimation of solar photovoltaic models

  2022cites this paper
• Mutational Slime Mould Algorithm for Gene Selection

  2022cites this paper
• An adaptive quadratic interpolation and rounding mechanism sine cosine algorithm with application to constrained engineering optimization problems

  2022cites this paper
• Boosted backtracking search optimization with information exchange for photovoltaic system evaluation

  2022cites this paper
• Multi-threshold image segmentation using a multi-strategy shuffled frog leaping algorithm

  2022cites this paper
• Individual Disturbance and Attraction Repulsion Strategy Enhanced Seagull Optimization for Engineering Design

  2022cites this paper
• Adaptive Harris hawks optimization with persistent trigonometric differences for photovoltaic model parameter extraction

  2022cites this paper
• Performance optimization of photovoltaic systems: Reassessment of political optimization with a quantum Nelder-mead functionality

  2022cites this paper
• Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-way Testing

  2022cites this paper
• Parameter identification of photovoltaic models using a sine cosine differential gradient based optimizer

  2022cites this paper
• An optimized machine learning framework for predicting intradialytic hypotension using indexes of chronic kidney disease-mineral and bone disorders

  2022cites this paper
• Boosted Sine Cosine Algorithm with Application to Medical Diagnosis

  2022cites this paper
• Simulated annealing-based dynamic step shuffled frog leaping algorithm: Optimal performance design and feature selection

  2022cites this paper
• Predicting Entrepreneurial Intention of Students: Kernel Extreme Learning Machine with Boosted Crow Search Algorithm

  2022cites this paper
• An efficient multilevel thresholding image segmentation method based on the slime mould algorithm with bee foraging mechanism: A real case with lupus nephritis images

  2021cites this paper
• Performance optimization of salp swarm algorithm for multi-threshold image segmentation: Comprehensive study of breast cancer microscopy

  2021cites this paper
• Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem

  2021cites this paper
• An evolutionary Nelder–Mead slime mould algorithm with random learning for efficient design of photovoltaic models

  2021cites this paper
• Gaussian Barebone Salp Swarm Algorithm with Stochastic Fractal Search for medical image segmentation: A COVID-19 case study

  2021cites this paper
• An effective model for predicting serum albumin level in hemodialysis patients

  2021cites this paper
• Chaotic diffusion‐limited aggregation enhanced grey wolf optimizer: Insights, analysis, binarization, and feature selection

  2021cites this paper