Population-Based Variable Neighborhood Descent for Discrete Optimization (CROSBI ID 679795)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Afrić, Petar ; Kurdija, Adrian Satja ; Šikić, Lucija ; Šilić, Marin ; Delač, Goran ; Vladimir, Klemo ; Srbljić, Siniša
engleski
Population-Based Variable Neighborhood Descent for Discrete Optimization
Many problems in smart solution development make use of discrete optimization techniques. It is expected that smart cities will have a constant need for parcel delivery and vehicle routing which is heavily reliant on discrete optimization. In this paper we present an improvement to the Variable neighborhood descent (VND) algorithm for discrete optimization. Our method makes the search procedure more exhaustive at the expense of time performance. Instead of keeping track of a single solution which is being improved, we allow branching of the solution into at most M promising solutions and keep track of them. Our experiments show that the proposed method produces results superior to VND. We analyze the impact on time complexity and give general usage guidelines for our method.
Variable neighborhood descent, Population, Discrete optimization, Capacitated vehicle routing problem
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
1-12.
2019.
objavljeno
Podaci o matičnoj publikaciji
International Conference on AI and Mobile Services
Podaci o skupu
8th International Conference Artificial Intelligence and Mobile Services (AIMS 2019)
predavanje
25.06.2019-30.06.2019
San Diego (CA), Sjedinjene Američke Države