Development and Application of CM-GATS Algorithms in Solving Large Multilevel Hierarchical Network Design Problems

Kerati Kijmanawat and Hitoshi Ieda

Research in Transportation Economics, 2005, vol. 13, issue 1, 121-142

Abstract: This study discusses a method that overcomes the size limitations in solving large size multilevel hierarchical hub location problem with a single allocation by using a stepwise solving approach called CM-GATS. This model uses a clustering algorithm to divide a given network into several small clusters with a manageable number of nodes then separately use hybrid heuristic algorithm based on Genetic Algorithm and Tabu Search to solve each cluster. The applicability of the proposed model in solving large multilevel hierarchical network design problems was verified by providing calculation results of CM-GATS in a large network containing up to 2,000 nodes.

Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0739-8859(05)13006-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:retrec:v:13:y:2005:i:1:p:121-142

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_2&version=01

Access Statistics for this article

Research in Transportation Economics is currently edited by M. Dresner

More articles in Research in Transportation Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().