A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem
DOI10.3233/FI-2017-1596zbMATH Open1381.68279OpenAlexW2765151454MaRDI QIDQ4606261FDOQ4606261
Authors: Ha-Bang Ban, Duc Nghia Nguyen 
Publication date: 2 March 2018
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2017-1596
Recommendations
- A simple and effective metaheuristic for the minimum latency problem
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- A branch-and-price algorithm for the minimum latency problem
- Variable neighborhood search
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (7)
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- A performance study on multi improvement neighborhood search strategy
- A branch-and-price algorithm for the minimum latency problem
- A metaheuristic for the delivery man problem with time windows
- A simple and effective metaheuristic for the minimum latency problem
This page was built for publication: A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606261)
