Skip to main content

Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem

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

Abstract

Estimation of Distribution Algorithms (EDA) are a type of optimization techniques that belong to evolutionary computation. Its operation is based on the use of a probabilistic model, which tries to reach promising regions through statistical information concerning to the individuals that belong to the population. In this work, several solution approaches based on the EDA field are presented in order to solve the Quay Crane Scheduling Problem (QCSP). QCSP consists of obtaining a schedule that minimizes the service time of a container vessel given a set of tasks (loading and unloading operations to/from) by means of the available quay cranes at a container terminal. The experimental results confirm that such algorithms are suitable for solving the QCSP and perform a wide exploration of the solution space using reduced computational times.

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. Bierwirth, C., Meisel, F.: A fast heuristic for quay crane scheduling with interference constraints. Journal of Scheduling 12(4), 345–360 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kim, K.H., Park, Y.-M.: A crane scheduling method for port container terminals. European Journal of Operational Research 156(3), 752–768 (2004)

    Article  MATH  Google Scholar 

  3. Larrñaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston (2002)

    Google Scholar 

  4. Moccia, L., Cordeau, J.-F., Gaudioso, M., Laporte, G.: A branch and cut algorithm for the quay crane scheduling problem in a containera terminal. Naval Research Logistics 53(1), 45–59 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Sammarra, M., Cordeau, J.-F., Laporte, G., Flavia Monaco, M.: A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling 10(4-5), 327–336 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Izquierdo, C.E., Velarde, J.L.G., Batista, B.M., Moreno-Vega, J.M. (2011). Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem. In: Pelta, D.A., Krasnogor, N., Dumitrescu, D., Chira, C., Lung, R. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2011). Studies in Computational Intelligence, vol 387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24094-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24094-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24093-5

  • Online ISBN: 978-3-642-24094-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics