Skip to main content

Studying the Influence of the Objective Balancing Parameter in the Performance of a Multi-Objective Ant Colony Optimization Algorithm

  • Chapter
Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 284))

  • 3440 Accesses

Abstract

Several multi-objective ant colony optimization (MOACO) algorithms use a parameter λ to balance the importance of each one of the objectives in the search. In this paper we have studied two different schemes of application for that parameter: keeping it constant, or changing its value during the algorithm running, in order to decide the configuration which yields the best set of solutions. We have done it considering our MOACO algorithm, named hCHAC, and two other algorithms from the literature, which have been adapted to solve the same problem. The experiments show that the use of a variable value for λ yields a wider Pareto set, but keeping a constant value for this parameter let to find better results for any objective.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Mini-Simulator hCHAC (2008), http://forja.rediris.es/frs/download.php/1355/mss_chac.zip

  2. Barán, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: IASTED International Multi-Conference on Applied Informatics. IASTED IMCAI, vol. 21, pp. 97–102 (2003)

    Google Scholar 

  3. Coello, C.A.C., Veldhuizen, D.A.V., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, Dordrecht (2002)

    MATH  Google Scholar 

  4. Dorigo, M., Stützle, T.: The ant colony optimization metaheuristic: Algorithms, applications, and advances. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 251–285. Kluwer, Dordrecht (2002)

    Google Scholar 

  5. García-Martínez, C., Cordón, O., Herrera, F.: An empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 61–72. Springer, Heidelberg (2004)

    Google Scholar 

  6. Iredi, S., Merkle, D., Middendorf, M.: Bi-criterion optimization with multi colony ant algorithms. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 359–372. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Mora, A., Merelo, J., Laredo, J., Castillo, P., Sánchez, P., Sevilla, J., Millán, C., Torrecillas, J.: hCHAC-4, an ACO algorithm for solving the four-criteria military path-finding problem. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds.) Proceedings of the International Workshop on Nature Inspired Cooperative Strategies for Optimization. NICSO 2007, pp. 73–84 (2007)

    Google Scholar 

  8. Mora, A., Merelo, J., Castillo, P., Laredo, J., Cotta, C.: Influence of parameters on the performance of a moaco algorithm for solving the bi-criteria military path-finding problem. In: WCCI 2008 Proceedings, pp. 3506–3512. IEEE Press, Los Alamitos (2008)

    Google Scholar 

  9. Mora, A.M., Merelo, J.J., Millán, C., Torrecillas, J., Laredo, J.L.J., Castillo, P.A.: Comparing aco algorithms for solving the bi-criteria military pathfinding problem. In: Almeida e Costa, F., Rocha, L.M., Costa, E., Harvey, I., Coutinho, A. (eds.) ECAL 2007. LNCS (LNAI), vol. 4648, pp. 665–674. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Mora, A.M., Merelo, J.J., Millán, C., Torrecillas, J., Laredo, J.L.J., Castillo, P.A.: Enhancing a MOACO for solving the bi-criteria pathfinding problem for a military unit in a realistic battlefield. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 712–721. Springer, Heidelberg (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mora, A.M., Merelo, J.J., Castillo, P.A., Laredo, J.L.J., García-Sánchez, P., Arenas, M.G. (2010). Studying the Influence of the Objective Balancing Parameter in the Performance of a Multi-Objective Ant Colony Optimization Algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol 284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12538-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12538-6_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12537-9

  • Online ISBN: 978-3-642-12538-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics