Hamid Reza Lashgarian Azad

An Application of Opposition Based Colonial Competitive Algorithm to Solve Network Count Location Problem

Full Text (PDF, 658KB), PP.29-35

Views: 0 Downloads: 0

Author(s)

Hamid Reza Lashgarian Azad ^1,*

1. Dept. of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran

* Corresponding author.

DOI: https://doi.org/10.5815/ijisa.2014.01.04

Received: 22 Apr. 2013 / Revised: 10 Sep. 2013 / Accepted: 17 Oct. 2013 / Published: 8 Dec. 2013

Index Terms

Origin–Destination (OD) Matrix, Network Count Location Problem (NCLP), Opposition Based Colonial Competitive Algorithm (OCCA)

Abstract

Origin–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 links in the road network. Also we employ opposition based colonial competitive algorithm (OCCA), which originally inspired by imperialistic competition, to determine the desirable number and locations of counting points satisfying location rules. The model and algorithm is illustrated with numerical examples.

Cite This Paper

Hamid Reza Lashgarian Azad, "An Application of Opposition Based Colonial Competitive Algorithm to Solve Network Count Location Problem", International Journal of Intelligent Systems and Applications(IJISA), vol.6, no.1, pp.29-35, 2014. DOI:10.5815/ijisa.2014.01.04

Reference

[1]J. N. Ostler. An institutional and economic analysis of the transportation-land use system. Master thesis, Massachusetts Institute of Technology, 1989.

[2]J. Walker, The acceptability of road pricing, RAC Foundation, 2011.

[3]K. Ashok. Estimation and Prediction of Time-Dependent Origin-Destination Flows. PhD thesis, Massachusetts Institute of Technology, 1996.

[4]H. Yang, J. Zhou, Optimal Traffic Counting locations for Origin-destination matrix estimation, Transportation Research, 32B, 2, (1998) 109 - 126.

[5]Ehlert, A., Bell, M.G.H., Grosso, S., The optimisation of traffic count locations in road networks, Transportation Research Part B, Vol. 40 , pp. 460 – 479, 2006.

[6]Fei, X., Eisenman S.M., Mahmassani H.S., 2007. Sensor coverage and location for real-time prediction in large-scale networks. Proceedings of the 86th TRB Annual meeting, January, Washington D.C.

[7]D. B. Fogel, The advantages of evolutionary computation, World science press, 1997, p.1-11.

[8]Atashpaz-Gargari, E., Lucas, C., 2007. “Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition”. IEEE Congress on Evolutionary Computation, pp.4661 – 4667.

[9]H. R. Tizhoosh, Opposition-based learning: a new scheme for machine intelligence, Proceedings of the international conference on computational intelligence for modeling, control and automation, Vienna, Austria, vol. I, pp. 695-701, 2005.

[10]Rahnamayan, S. (2007) ‘Opposition-based differential evolution’, PhD thesis, Department of Systems Design Engineering, University of Waterloo, Waterloo, Ontario, Canada.

[11]Azad, H.R.L., Boushehri, N.S. and Mollaverdi, N. (2012) ‘Investigating the application of opposition concept to colonial competitive algorithm’, Int. J. Bio-Inspired Computation, Vol. 4, No. 5.

International Journal of Intelligent Systems and Applications (IJISA)