Abstract
The objective of the target visitation problem is to determine a path for an unmanned aerial vehicle that begins at a point of origin and needs to visit several targets before returning to its starting point. An optimal visitation sequence is one which minimizes the total distance traveled and maximizes the utility of the visitation order. This utility measure is defined for each pair of targets and represents the relative value of visiting a particular target before another. In this chapter, we present the results of a preliminary study investigating the effectiveness of a genetic algorithm for the target visitation problem. The encoding scheme is based on random keys. Numerical results are presented for a set of randomly generated test problems and compared with the optimal solutions as computed by a commercial integer programming package.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6(2), 154–160 (1994)
Butenko, S.I., Murphey, R.A., Pardalos, P.M. (eds.): Cooperative Control: Models, Applications, and Algorithms. Springer, Heidelberg (2003)
Butenko, S.I., Murphey, R.A., Pardalos, P.M. (eds.): Recent Developments in Cooperative Control and Optimization. Springer, Heidelberg (2004)
Chiarini, B.H., Chaovalitwongse, W., Pardalos, P.M.: A new algorithm for the triangulation of input-output tables in eEconomics. In: Pardalos, P., Migdalas, A., Baourakis, G. (eds.) Supply Chain and Finance, World Scientific, Singapore (2004)
Commander, C.W., Pardalos, P.M., Ryabchenko, V., Uryasev, S.: The wireless network jamming problem. In: Journal of Combinatorial Optimization (2007), doi:10.1007/s10878-007-9071-7
ILOG CPLEX: http://www.ilog.com/products/cplex , accessed October 2006
Darwin, C.: The Origin of Species, 6th edn. Murray (1872)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Dordrecht (1989)
Gonçalves, J.F., Mendes, J.J.M., Resende, M.G.C.: A hybrid genetic algorithm for the job scho scheduling problem. European Journal of Operations Research 167, 77–95 (2005)
Grundel, D.A., Jeffcoat, D.E.: Formulation and solution of the target visitation problem. In: Proceedings of the AIAA 1st Intelligent Systems Technical Conference (2004)
Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research. McGraw-Hill, New York (2001)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Nonconvex Optimization and its Applications, vol. 3. Kluwer Academic Publishers, Dordrecht (1995)
King, J.: Three problems in search of a measure. American Mathematical Monthly 101, 609–628 (1994)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem. Wiley, Chichester (1985)
Murphey, R.A., Pardalos, P.M. (eds.): Cooperative Control and Optimization. Springer, Heidelberg (2002)
Oliveira, C.A.S., Pardalos, P.M., Querido, T.M.: A combinatorial algorithm for message scheduling on controller area networks. Int. Journal of Operations Res. 1(1/2), 160–171 (2005)
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219–249. Kluwer Academic Publishers, Dordrecht (2003)
Spears, W.M., DeJong, K.A.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230–236 (1991)
Wolsey, L.: Integer Programming. Wiley, Chichester (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arulselvan, A., Commander, C.W., Pardalos, P.M. (2007). A Random Keys Based Genetic Algorithm for the Target Visitation Problem. In: Pardalos, P.M., Murphey, R., Grundel, D., Hirsch, M.J. (eds) Advances in Cooperative Control and Optimization. Lecture Notes in Control and Information Sciences, vol 369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74356-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-74356-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74354-5
Online ISBN: 978-3-540-74356-9
eBook Packages: EngineeringEngineering (R0)