Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation

From MaRDI portal
Publication:1310113
Jump to:navigation, search

DOI10.1007/BF01185425zbMath0800.68608MaRDI QIDQ1310113

Károly F. Pál

Publication date: 2 January 1994

Published in: Biological Cybernetics (Search for Journal in Brave)



Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)


Related Items

Metaheuristics: A bibliography



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Optimization by Simulated Annealing
  • Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
  • The ``molecular traveling salesman
  • ``Neural computation of decisions in optimization problems
  • The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
  • Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
  • Computer Solutions of the Traveling Salesman Problem
  • An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1310113&oldid=13431210"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki