Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
From MaRDI portal
Publication:2668611
DOI10.1016/j.cor.2020.105192OpenAlexW3118630579MaRDI QIDQ2668611
Hande Oztop, Korhan Karabulut, Levent Kandiller, M. Fatih Tasgetiren
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105192
evolution strategymodeling and optimizationmultiple traveling salesmen problem\textit{minmax} mTSP\textit{minsum} mTSP
Related Items (4)
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 ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
Uses Software
Cites Work
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
- Multi-depot multiple TSP: a polyhedral study and computational results
- A random-key genetic algorithm for the generalized traveling salesman problem
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- Evolution strategies. A comprehensive introduction
- A neural network algorithm for the multiple traveling salesman problem
- Record breaking optimization results using the ruin and recreate principle
- Grouping evolution strategies: an effective approach for grouping problems
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- Integer linear programming formulations of multiple salesman problems and its variations
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Integer Programming Formulation of Traveling Salesman Problems
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Topological design of centralized computer networks—formulations and algorithms
- TSPLIB—A Traveling Salesman Problem Library
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- The m-Traveling Salesman Problem with Minmax Objective
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Introduction to evolutionary computing
This page was built for publication: Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
