A performance study on multi improvement neighborhood search strategy

DOI10.1016/j.endm.2017.03.026zbMath1390.90481OpenAlexW2606804169MaRDI QIDQ1687681

Cristina Boeres, Igor M. Coelho, Eyder Rios, Vitor N. Coelho, Nenad Mladenović, Luiz Satoru Ochi

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.026

zbMATH Keywords

neighborhood searchGPUminimum latency problemDVNDmulti improvement

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection

Cites Work

• A hybrid algorithm for a class of vehicle routing problems
• Variable neighborhood search
• A simple and effective metaheuristic for the minimum latency problem
• Variable neighborhood search for the travelling deliveryman problem
• The minimum latency problem
• Special cases of traveling salesman and repairman problems with time windows
• The traveling salesman problem with cumulative costs

This page was built for publication: A performance study on multi improvement neighborhood search strategy