Loading...

Hybrid meta-heuristic algorithms for solving network design problem

Poorzahedy, H ; Sharif University of Technology | 2007

304 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.ejor.2006.07.038
  3. Publisher: 2007
  4. Abstract:
  5. 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. © 2006 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Genetic algorithms ; Heuristic algorithms ; Problem solving ; Simulated annealing ; Tabu search ; Ant system ; Base network ; Hybrid algorithms ; Network design ; Network architecture
  8. Source: European Journal of Operational Research ; Volume 182, Issue 2 , 2007 , Pages 578-596 ; 03772217 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0377221706008502