HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM

DOI10.1080/01969729508927504zbMath0833.90117OpenAlexW1997850987MaRDI QIDQ4848805

No author found.

Publication date: 18 March 1996

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969729508927504

zbMATH Keywords

traveling salesmangenetic algorithminversion with embedded Newton- Raphson search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

A Bayesian hierarchical approach to dual response surface modelling

Uses Software

• Genocop

Cites Work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM