By Topic

Tabu search-based algorithm for capacitated multicommodity network design problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zaleta, N.C. ; Fac. de Ingenieria Meccanica y Electrica, Univ. Autonoma de Nuevo Leon, Monterrey, Mexico ; Socarras, A.M.A.

The paper presents an efficient procedure to find good solutions to realistically sized fixed-charge, capacitated, multicommodity, network design problems. At present, there exists no algorithm that can solve large instances, common in several applications, in a reasonable period of time, so that heuristic procedures must be applied. The design problem is formulated as a mixed-integer programming problem and solved by a procedure based on a tabu search meta-heuristic. Computational experiments were conducted and results are compared with those obtained by an evolutionary algorithm.

Published in:

Electronics, Communications and Computers, 2004. CONIELECOMP 2004. 14th International Conference on

Date of Conference:

16-18 Feb. 2004