A new approach to solving the multiple traveling salesperson problem using genetic algorithms
From MaRDI portal
Publication:2432849
DOI10.1016/J.EJOR.2005.04.027zbMATH Open1137.90690OpenAlexW2036573713MaRDI QIDQ2432849FDOQ2432849
Authors: Arthur E. Carter, Cliff T. Ragsdale 
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.027
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for the Traveling Salesman Problem
- Genetic algorithms and traveling salesman problems
- A genetic algorithm for service level based vehicle scheduling
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genetic algorithms for the traveling salesman problem
- Genetic algorithm crossover operators for ordering applications
- A hybrid genetic algorithm for the open shop scheduling problem
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
Cited In (33)
- Quality inspection scheduling for multi-unit service enterprises
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- 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
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Genetic algorithm for combinatorial path planning: the subtour problem
- Title not available (Why is that?)
- Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
- Emergency scheduling of engineering rescue tasks in disaster relief operations and its application in China
- An improved multi-objective framework for the rich arc routing problem
- Completion time variance minimization in single machine and multi-machine systems
- A new heuristic algorithm for multiple traveling Salesman problem
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- 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
- A comparative study of solution representations for the unrelated machines environment
- The multiple traveling salesman problem with backup coverage
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- A novel approach to solve multiple traveling salesmen problem by genetic algorithm
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Path planning on a cuboid using genetic algorithms
- An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
- A comparative study of task assignment and path planning methods for multi-UGV missions
- Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
- Solving the response time variability problem by means of a genetic algorithm
- Bio-inspired meta-heuristics for emergency transportation problems
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- The multiagent planning problem
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)
