Case injected genetic algorithms for traveling salesman problems

DOI10.1016/S0020-0255(99)00124-3zbMATH Open1147.90419MaRDI QIDQ1854036FDOQ1854036

Authors: Sushil J. Louis, Gong Li 

Publication date: 23 January 2003

Published in: Information Sciences (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4104744
• scientific article; zbMATH DE number 710383
• A new genetic algorithm applied to the traveling salesman problem
• Genetic algorithms and traveling salesman problems
• An Efficient Genetic Algorithm for the Traveling Salesman Problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Optimization by simulated annealing
• Title not available (Why is that?)
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Title not available (Why is that?)
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem

Uses Software

• TSPLIB

This page was built for publication: Case injected genetic algorithms for traveling salesman problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854036)