Tabu Search Algorithm (TSA): A Comprehensive Survey
Vishnu Kumar Prajapati, Mayank Jain, Lokesh Chouhan
Abstract
This paper is presents a Comprehensive Survey on Tabu Search Algorithms (TSA). TSA is a meta heuristics kind of algorithm which works on global optimal solution for a given problem such as vehicle routing problem (VRP), open vehicle routing problem (OVRP), multi-trip vehicle routing and scheduling problem (MTVRSP), container loading problem (CLP) and job shop problem, etc. in this paper focuses on main characteristics of TSA and its behaviour.
Topics & Concepts
Tabu searchVehicle routing problemHeuristicsComputer scienceJob shop schedulingMathematical optimizationGuided Local SearchRouting (electronic design automation)Scheduling (production processes)Job shopAlgorithmFlow shop schedulingMathematicsComputer networkVehicle Routing Optimization MethodsOptimization and Packing ProblemsOptimization and Search Problems