Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1121.90024
Poorzahedy, Hossain; Rouhani, Omid M.
Hybrid meta-heuristic algorithms for solving network design problem. (English)
[J] Eur. J. Oper. Res. 182, No. 2, 578-596 (2007). ISSN 0377-2217

Summary: Network design problem has been, and is, an important problem in transportation. Following an earlier effort in designing a meta-heuristic search technique by an ant system, this paper attempts to hybridize this concept with other meta-heuristic concepts such as genetic algorithm, simulated annealing, and tabu search. Seven hybrids have been devised and tested on the network of Sioux Falls. It has been observed that the hybrids are more effective to solve the network design problem than the base ant system. Application of the hybrid containing all four concepts on a real network of a city with over 2 million population has also proved to be more effective than the base network, in the sense of finding better solutions sooner.

MSC 2000:: *90B06 Transportation, logistics
90B10 Flows in networks
90C59 Approximation methods and heuristics

Keywords: transportation; network design; ant system; hybrid algorithm

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]