A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 141-151
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A new approach to solving the multiple traveling salesperson problem using genetic algorithmsEuropean Journal of Operational Research, 2006
- The multiple traveling salesman problem: an overview of formulations and solution proceduresOmega, 2006
- A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlinesInternational Journal of Production Economics, 2001
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel ComplexEuropean Journal of Operational Research, 2000
- A genetic algorithm for service level based vehicle schedulingEuropean Journal of Operational Research, 1996
- A Boolean neural network approach for the traveling salesman problemIEEE Transactions on Computers, 1993
- Artificial intelligence, heuristic frameworks and tabu searchManagerial and Decision Economics, 1990
- The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithmDiscrete Applied Mathematics, 1986
- A Cutting Planes Algorithm for the m-Salesmen ProblemJournal of the Operational Research Society, 1980
- Using cutting planes to solve the symmetric Travelling Salesman problemMathematical Programming, 1978