Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
type: Item
instance of: scholarly article
title: Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
zbMATH Open document ID: 1186.65077
author: Y. H. Liu
published in: Applied Mathematics and Computation
publication date: 2010-03-31T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5688854
zbMATH Keywords: genetic algorithm
zbMATH Keywords: initial solution generator
zbMATH Keywords: probabilitsic traveling salesman problem
zbMATH Keywords: permutation test
zbMATH Keywords: stochastic network problems
zbMATH Keywords: numerical experiments
MaRDI profile type: Publication
full work available at URL: j.amc.2010.01.021
OpenAlex ID: W2095134601
cites work: A Priori Optimization
cites work: Computational Approaches to Stochastic Vehicle Routing Problems
cites work: Aggregation for the probabilistic traveling salesman problem
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
cites work: Further results on the probabilistic traveling salesman problem
cites work: Q3787809
cites work: Q3790960
cites work: Solving the probabilistic TSP with ant colony optimization
cites work: Estimation-based metaheuristics for the probabilistic traveling salesman problem
cites work: An Evolutionary Algorithm with Diversified Crossover Operator for the Heterogeneous Probabilistic TSP
cites work: Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
cites work: A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
cites work: Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
cites work: Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
cites work: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
cites work: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
cites work: A hybrid scatter search for the probabilistic traveling salesman problem
cites work: Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
cites work: Q5687948
cites work: Q4692508
cites work: Q3799802
cites work: Genetic algorithms for the traveling salesman problem
cites work: Synchronized permutation tests in replicated \(I \times J\) designs
DOI: 10.1016/J.AMC.2010.01.021
Recommended article: A random-key genetic algorithm for the generalized traveling salesman problem
Recommended article: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
Recommended article: Q3518157
Recommended article: Genetic algorithms for the traveling salesman problem
Recommended article: Q3829370
Recommended article: Solving traveling salesman problems by genetic algorithms
Recommended article: Q3606240
Recommended article: Some issues of designing genetic algorithms for traveling salesman problems
Recommended article: Solving constrained traveling salesman problems by genetic algorithms
Recommended article: COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
description: scientific article; zbMATH DE number 5688854