Skip to main content

A Nature Inspired Approach for the Uncapacitated Plant Cycle Location Problem

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

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

Abstract

This paper proposes a heuristic approach based on the algorithm referred to as the Honey Bees Mating Optimization algorithm to solve the Uncapacitated Plant-Cycle Location Problem. With the purpose of corroborating the effectiveness of the developed algorithm, we create a set of random instances and use the mathematical formulation of the problem to solve it exactly with Cplex. The computational results show that for the small size instances that Cplex is able to solve, the proposed heuristic reaches the exact solution in all cases.

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. Abbass, H.A.: A Monogenous MBO Approach to Satisfiability. In: Proceeding if the Internacional Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2001, Las Vegas, USA (2001)

    Google Scholar 

  2. Abbass, H.A.: Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach. In: The Congress on Evolutionary Computation (CEC 2001), Seoul, Korea, pp. 207–214 (2001)

    Google Scholar 

  3. Afshar, A., Haddad, O.B., Marino, M.A., Adams, B.J.: Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation. Journal of the Franklin Institute 344, 452–462 (2007)

    Article  Google Scholar 

  4. Fathian, M., Amiri, B., Maroosi, A.: Application of honey bee mating optimization algorithm on clustering. Applied Mathematics and Computation 190(2), 1502–1513 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Haddad, O.B., Afshar, A., Marino, M.A.: Honey-bees mating optimization (HBMO) algorithm: A new heuristic approach for water resources optimizaion. Water resources Management 20, 661–680 (2006)

    Article  Google Scholar 

  6. Labbé, M., Rodríguez Martín, I., Salazar González, J.J.: A branch-and-cut algorithm for the plant-cycle location problem. Journal of the Operational Research Society 55, 513–520 (2004)

    Article  MATH  Google Scholar 

  7. Marinakis, Y., Marinaki, M., Dounias, G.: Honey Bees Mating Optimization Algorithm for the Vehicle Routing Problem. In: Nature inspired cooperative strategies for optimization (NICSO 2007). Studies in Computational Intelligence, vol. 129, pp. 139–148 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Melián-Batista, B., Moreno-Vega, J.M., Vaswani, N., Yumar, R. (2009). A Nature Inspired Approach for the Uncapacitated Plant Cycle Location Problem. In: Krasnogor, N., Melián-Batista, M.B., Pérez, J.A.M., Moreno-Vega, J.M., Pelta, D.A. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Studies in Computational Intelligence, vol 236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03211-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03211-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03210-3

  • Online ISBN: 978-3-642-03211-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics