An Application of Opposition Based Colonial Competitive Algorithm to Solve Network Count Location Problem
Hamid Reza Lashgarian Azad · International Journal of Intelligent Systems and Applications · 2013
Orig in-destination (OD) matrix estimation largely depends on the quality and quantity of the input data, which in turn depends on the number and sites of count locations.In this paper, we focus on the network count location problem (NCLP), namely the identification of informative lin ks in the road network.Also we emp loy opposition based colonial competit ive algorith m (OCCA), which orig inally inspired by imperialistic co mpetition, to determine the desirable number and locations of counting points satisfying location rules.The model and algorithm is illustrated with numerical examples.