A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

DOI10.3233/FI-2017-1596zbMath1381.68279OpenAlexW2765151454MaRDI QIDQ4606261

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

zbMATH Keywords

tabu searchvariable neighborhood searchminimum latency problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

A metaheuristic for the delivery man problem with time windows

This page was built for publication: A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem