scientific article; zbMATH DE number 2079898

zbMATH Open1044.68800MaRDI QIDQ4472039FDOQ4472039

Authors:

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2279/22790153.htm

Title of this publication is not available (Why is that?)

Recommendations

• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• Evolutionary algorithm to traveling salesman problems
• A novel approach to solve multiple traveling salesmen problem by genetic algorithm
• Optimization of non-linear multiple traveling salesman problem using \(k\)-means clustering, shrink wrap algorithm and meta-heuristics
• A new heuristic algorithm for multiple traveling Salesman problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (9)

• Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem
• Optimization of non-linear multiple traveling salesman problem using \(k\)-means clustering, shrink wrap algorithm and meta-heuristics
• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• Computational Science - ICCS 2004
• Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
• The multiagent planning problem

Uses Software

• J-MEANS

This page was built for publication:

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