A new approach to solving the multiple traveling salesperson problem using genetic algorithms
From MaRDI portal
Publication:2432849
Recommendations
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- A novel approach to solve multiple traveling salesmen problem by genetic algorithm
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 4104743 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 4115948 (Why is no real title available?)
- A genetic algorithm for service level based vehicle scheduling
- A hybrid genetic algorithm for the open shop scheduling problem
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- An Algorithm for the Traveling Salesman Problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Genetic algorithm crossover operators for ordering applications
- Genetic algorithms and traveling salesman problems
- Genetic algorithms for the traveling salesman problem
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
Cited in
(35)- Bio-inspired meta-heuristics for emergency transportation problems
- Quality inspection scheduling for multi-unit service enterprises
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink
- Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system
- Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case
- A comparative study of solution representations for the unrelated machines environment
- Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- Genetic algorithm for combinatorial path planning: the subtour problem
- A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
- A comparative study of task assignment and path planning methods for multi-UGV missions
- The multiagent planning problem
- Path planning on a cuboid using genetic algorithms
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem
- Solving the response time variability problem by means of a genetic algorithm
- Completion time variance minimization in single machine and multi-machine systems
- A new heuristic algorithm for multiple traveling Salesman problem
- Emergency scheduling of engineering rescue tasks in disaster relief operations and its application in China
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- A novel approach to solve multiple traveling salesmen problem by genetic algorithm
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Optimization of non-linear multiple traveling salesman problem using \(k\)-means clustering, shrink wrap algorithm and meta-heuristics
- scientific article; zbMATH DE number 2079898 (Why is no real title available?)
- The multiple traveling salesman problem with backup coverage
- 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
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- An improved multi-objective framework for the rich arc routing problem
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
- An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
This page was built for publication: A new approach to solving the multiple traveling salesperson problem using genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432849)
