A tabu search algorithm with a probabilistic neighbor selection criterion for capacitated multicommodity network flow problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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 (TS-PCNS).

Original languageEnglish
Title of host publicationProceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010
Pages322-326
Number of pages5
DOIs
StatePublished - 1 Dec 2010
Event2010 15th Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010 - Hsinchu, Taiwan, Province of China
Duration: 18 Nov 201020 Nov 2010

Publication series

NameProceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010

Conference

Conference2010 15th Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010
Country/TerritoryTaiwan, Province of China
CityHsinchu
Period18/11/1020/11/10

Keywords

  • Multicommodity Network flow problem
  • Network design
  • Tabu search

Fingerprint

Dive into the research topics of 'A tabu search algorithm with a probabilistic neighbor selection criterion for capacitated multicommodity network flow problem'. Together they form a unique fingerprint.

Cite this