Skip to main content

Optimal Velocity Requirements for Earth to Venus Mission Using Taboo Evolutionary Programming

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8297))

Included in the following conference series:

  • 2134 Accesses

Abstract

In the recent years stochastic optimization techniques have seen a remarkable development for many scientific and industrial problems. There has been growing interest in the successful use of these techniques for obtaining the global optimum of a given optimization problem. Many authors proposed different methods of optimization techniques and applied on a variety of problems. The difficulty in global optimization increases with the dimension of the problem and the presence of multiple local minima. Taboo evolutionary programming (TEP) is a novel evolutionary programming technique, which found extensive usage in the present decade. TEP is an effective global optimization technique which avoids entrapment in local minima and to continue the search to give the optimal solution independent of the initial conditions. The algorithm can be effectively implemented on any complex problem to find the optimum solution with many constraints. Successful use of TEP is published in terms of exploring efficiently the solution space by providing optimal solutions and good initial estimation.

In the present study TEP algorithm is used to find the optimum impulsive velocity requirements for a complex interplanetary trajectory from Earth to Venus mission. The optimization problem is complex due to the presence of the multiple local minima exists in a given synodic cycle. TEP algorithm is integrated with analytic technique called Lambert conic determination. Two types of missions namely flyby and orbiter are considered to explore the optimum trajectory opportunities from elliptical Earth parking orbit. To demonstrate the superiority of TEP, the results were compared with Genetic Algorithm (GA) also.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battin, R.H.: An introduction to the mathematics and methods of astrodynamics, AIAA education series (1987)

    Google Scholar 

  2. Cornelisse, J.W.: Trajectory Analysis for Interplanetary Mission. ESA Journal 2, 131–164 (1978)

    Google Scholar 

  3. Cvijovic, D., Klinowski, J.: Taboo search: an approach to the multiple minima problem. Science 267, 664–666 (1995)

    Article  MathSciNet  Google Scholar 

  4. Glover, F.: Tabu search- part I. ORSA Journal of Computing 1, 190–206 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Glover, F.: Tabu search-part II. ORSA Journal of Computing 2, 4–32 (1990)

    Article  MATH  Google Scholar 

  6. Ji, M., Tang, H., Guo, J.: A single-point mutation evolutionary programming, Inf. Process.Lett. 90, 293–299 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ji, M., Klinowski, J.: Taboo evolutionary programming: a new method of global optimization. Proc. R. Soc. A 462, 3613–3627 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ji, M., Klinowski, J.: Convergence of taboo searches in continuous global optimization. Proc. R. Soc. A 462, 2077–2084 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mutyalarao, M., Sabarinath, A., Raj, M.X.J.: Taboo Evolutionary Programming Approach to Optimal Transfer from Earth to Mars. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds.) SEMCCO 2011, Part II. LNCS, vol. 7077, pp. 122–131. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Rajesh, J., Jayaraman, V.K., Kulkarni, B.D.: Taboo search algorithm for continuous function optimization. Trans. IChemE 78, Part A (September 2000)

    Google Scholar 

  11. Standish, E.M., Newhall, X.X., Williams, J.G., Yeomans, D.K.: Orbital Ephemerides of the Sun, Moon and Planets. In: Seidelmann, P.K. (ed.) Explanatory Supplement to the Astronomical Almanac. University Science Books (1992)

    Google Scholar 

  12. Kemble, S.: Interplanetary Mission Analysis and Design. Springer, Heidelberg (2006)

    Google Scholar 

  13. Vallado, D.A.: Fundamentals of astrodynamics and applications, 2nd edn. Kluwer Academic Publishers, London (2001)

    Google Scholar 

  14. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3, 82–102 (1999)

    Article  Google Scholar 

  15. Mutyalarao, M., Raj, M.X.J.: Minimum energy Earth departure trajectories to Venus. In: Proceedings of the Fifty Seventh Congress of the Indian Society of Theoretical and Applied Mechanics (An International meet), pp. 109–114 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Mutyalarao, M., Sabarinath, A., Raj, M.X.J. (2013). Optimal Velocity Requirements for Earth to Venus Mission Using Taboo Evolutionary Programming. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2013. Lecture Notes in Computer Science, vol 8297. Springer, Cham. https://doi.org/10.1007/978-3-319-03753-0_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03753-0_67

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03752-3

  • Online ISBN: 978-3-319-03753-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics