Title :
A Tabu Search Algorithm with a Probabilistic Neighbor Selection Criterion for Capacitated Multicommodity Network Flow Problem
Author :
Cabrera G, G. ; Toledo C, Carlos
Author_Institution :
Inf. Eng. Sch., Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile
Abstract :
In recent years, network design has been an important issue not only for researchers but also for the industries. This is due to the impact that an efficient distribution network design can have over both costs and the environment. In this article we presented a heuristic solution approach for the multicommodity capacitated network flow (MCNF) problem, which corresponds to a very complex problem within the network design problems. This problem is solved by a Tabu Search (TS) algorithm which obtains improvements in comparison with the used benchmark, especially in small and medium instances. Particularly, this TS algorithm selects the best candidate on the list, through a probabilistic approach based on evolutionary algorithms (TSPCNS).
Keywords :
evolutionary computation; probability; search problems; transportation; capacitated multicommodity network flow problem; distribution network design; evolutionary algorithms; heuristic solution approach; probabilistic neighbor selection criterion; tabu search algorithm; Multicommodity Network Flow Problem; Network Design; Tabu Search;
Conference_Titel :
Technologies and Applications of Artificial Intelligence (TAAI), 2010 International Conference on
Conference_Location :
Hsinchu City
Print_ISBN :
978-1-4244-8668-7
Electronic_ISBN :
978-0-7695-4253-9
DOI :
10.1109/TAAI.2010.93