A performance study on multi improvement neighborhood search strategy
Authors:
- Eyder RiosEREyder Rios
- Luiz Satoru OchiLOLuiz Satoru Ochi
- Cristina BoeresCBCristina Boeres
- Igor M. CoelhoICIgor M. Coelho
- Vitor N. CoelhoVCVitor N. Coelho
- Nenad MladenovićNMNenad Mladenović
- 1 April 2017
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 58, 199-206
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A hybrid algorithm for a class of vehicle routing problemsComputers & Operations Research, 2013
- Efficient local search on the GPU—Investigations on the vehicle routing problemJournal of Parallel and Distributed Computing, 2013
- Variable neighborhood search for the travelling deliveryman problem4OR, 2012
- A simple and effective metaheuristic for the Minimum Latency ProblemEuropean Journal of Operational Research, 2012
- Debunking the 100X GPU vs. CPU mythACM SIGARCH Computer Architecture News, 2010
- GPU ComputingProceedings of the IEEE, 2008
- Variable neighborhood searchComputers & Operations Research, 1997
- The traveling salesman problem with cumulative costsNetworks, 1993
- Special cases of traveling salesman and repairman problems with time windowsNetworks, 1992