Summary

Proceedings of the 2012 International Symposium on Nonlinear Theory and its Applications

2012

Session Number:C1L-A

Session:

Number:535

AD-Truck Routing Problem and Solution Methods

Takafumi MATSUURA,  Yuri HARUNAGA,  Kazumiti NUMATA,  

pp.535-538

Publication Date:

Online ISSN:2188-5079

DOI:10.15248/proc.1.535

PDF download (355.3KB)

On town streets, we see a truck which displays advertisement of new products or local events on its side. The truck is moving media of advertisement to appeal to walkers on streets and called “AD-truck”. The advertisement effects of the AD-track are generated at the intersections. Under the traffic rules: cars keep to the left and going straight is given priority over turning right, turning right takes a longer time than going straight at the intersections. Thus, the AD-trucks are recommended to turn right at the intersections as possible as many times for greater advertisement effect. In this paper, to determine an optimum tour of the AD-trucks, we define a new discrete optimization problem called “AD-Truck Routing Problem.” We formulate it as integer programming, and propose a local search method and a chaotic search method which drives the local search method by using chaotic dynamics.

[1] Hasegawa, M. et al. (1997): PRL, 79 (12), 2344-2347.

[2] Hasegawa, M. et al. (2002): Neural Networks, 15 (2), 271-283.

[3] Matsuura, T. and Ikeguchi, T. (2008): Proc. of NOLTA 2008, 77-80.

[4] Matsuura, T. and Ikeguchi, T. (2008): LNCS, 5164 587-596.

[5] Hasegawa, M. et al. (2002): EJOR, 39 (3), 543-556.

[6] Matsuura, T. et al. (2005): Proc. of MIC 2005, 677-682.

[7] Matsuura, T. and Ikeguchi, T. (2006): LNCS, 4224, 1103-1110.

[8] Matsuura, T. and Ikeguchi, T. (2009): Proc. of NOLTA 2009, 368-371.

[9] Matsuura, T. and Ikeguchi, T. (2010): NOLTA, 1(1), 207-220.

[10] Aihara, K. et al. (1990): Phys. Lett. A, 144, 333-340.

[11] Kirkpatrick, S. et al. (1983): Science, 220, 671-680.

[12] Gurobi Optimization, http://www.gurobi.com/