Multipath adaptive tabu search for a vehicle control problem
Summary: Tabu search has become acceptable worldwide as one of the most efficient intelligent searches applied to various real-world problems. There have been different modifications made to the generic tabu search in recent years to achieve better performances. Among those reviewed in the introduction of this paper, the Adaptive Tabu Search (ATS) has incorporated the backtracking and the adaptive search radius mechanisms that help accelerate the search and release it from a local solution lock. The paper explains an enhancement made to the ATS to accomplish Multipath ATS (MATS) algorithms. Performances of the ATS and the MATS are evaluated using surface optimization problems, and results are presented in the paper. Finally, the MATS is applied to solve a real-world vehicle control problem.
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A new heuristic method for the flow shop sequencing problem
- A reactive tabu search for the vehicle routing problem
- An advanced tabu search algorithm for the job shop problem
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1859297 (Why is no real title available?)
- Parametric tabu-search for mixed integer programs
- Tabu Search—Part I
- The Reactive Tabu Search
- Toward a Taxonomy of Parallel Tabu Search Heuristics
This page was built for publication: Multipath adaptive tabu search for a vehicle control problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411085)