A simple model for the multiple traveling salesmen problem with single depot and multiple sink
From MaRDI portal
Publication:2970607
DOI10.1108/03321641311296945zbMath1358.90118OpenAlexW2066090427MaRDI QIDQ2970607
Daibo Liu, Mengshu Hou, Hong Qu
Publication date: 30 March 2017
Published in: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03321641311296945
algorithmcombinatorial optimizationtraveling salesman problemcomplexity theoryoptimization techniquesmultiple traveling salesmen problemprogramming and algorithm theory
Related Items (1)
Uses Software
Cites Work
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective
- A hybrid genetic algorithm for the open shop scheduling problem
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- A columnar competitive model for solving multi-traveling salesman problem
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink
- TSPLIB—A Traveling Salesman Problem Library
- Some Theorems on Abstract Graphs
This page was built for publication: A simple model for the multiple traveling salesmen problem with single depot and multiple sink
