scientific article; zbMATH DE number 2079898
From MaRDI portal
Publication:4472039
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
Cited in
(10)- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- Computational Science - ICCS 2004
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- The multiagent planning problem
- Solution attractor of local search system: a method to reduce computational complexity of the traveling salesman problem
- Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- 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
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
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)