Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
From MaRDI portal
Publication:2668611
Recommendations
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- Multi-type ant colony system for solving the multiple traveling salesman problem
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
Cites work
- A Cutting Planes Algorithm for the m-Salesmen Problem
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- A neural network algorithm for the multiple traveling salesman problem
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- A random-key genetic algorithm for the generalized traveling salesman problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- Evolution strategies. A comprehensive introduction
- Grouping evolution strategies: an effective approach for grouping problems
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Integer linear programming formulations of multiple salesman problems and its variations
- Integer Programming Formulation of Traveling Salesman Problems
- Introduction to evolutionary computing
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Multi-depot multiple TSP: a polyhedral study and computational results
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
- Record breaking optimization results using the ruin and recreate principle
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- The m-Traveling Salesman Problem with Minmax Objective
- Topological design of centralized computer networks—formulations and algorithms
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(8)- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- Using 2-Opt based evolution strategy for travelling salesman problem
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
- Learning-guided iterated local search for the minmax multiple traveling salesman problem
- A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
This page was built for publication: Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668611)
