Solving of TSP with time restraints by memetic algorithm

MaRDI QIDQ3403221zbMATH OpenFDO

Authors Liang Gao, Wenjun Liu, Chi Zhou

Publication date 12 February 2010

zbMATH Keywords

greed recessive variationmemetic algorithmrecursive arc insertiontime restraintstraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1839653
• A memetic algorithm for the vehicle routing problem with time windows
• An Effective PSO-Based Memetic Algorithm for TSP
• A memetic algorithm for the travelling salesperson problem with hotel selection
• A memetic algorithm for the generalized traveling salesman problem

Cited in

(5)

• Analyzing the performance of TSP solver methods
• An Effective PSO-Based Memetic Algorithm for TSP
• A memetic algorithm for the travelling salesperson problem with hotel selection
• A memetic random key algorithm for the balanced travelling salesman problem
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem

This page was built for publication: Solving of TSP with time restraints by memetic algorithm

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