Skip to main content
SpringerLink
Log in

A Constraint Programming Based Method for Stockyard Management Problem

  • Conference paper
  • First Online:
Internet and Distributed Computing Systems (IDCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9864))

Included in the following conference series:

Abstract

The stockyard management problem in a cargo assembly terminal mainly focuses on finding an efficient allocation of limited resources such as stockyard space, stacking and reclaiming machines to stockpiles such that the waiting time of a vessel fleet at port can be minimized. This highly complex problem involves scheduling with resource constraints in a dynamic environment and is a typical \(\mathcal {NP}\)-hard problem in general. In this study, we present a constraint programming (CP) based approach to address the problem with utilizing the strength of CP in its flexibility in formulating various complex and nonlinear constraints for industrial applications. In addition, we explore the ability of the CP solver with trying different combinations of constraint propagation and constructive search strategies and report our best findings from an extensive computational study.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Boland, N., Savelsbergh, M.: Optimizing the hunter valley coal chain. In: Gurnani, H., Mehrotra, A., Ray, S. (eds.) Supply Chain Disruptions, pp. 275–302. Springer, New York (2012)

    Chapter  Google Scholar 

  2. Savelsbergh, M., Smith, O.: Cargo assembly planning. Eur. J. Transp. Log. 4(3), 1–34 (2014)

    MathSciNet  Google Scholar 

  3. Belov, G., Boland, N., Savelsbergh, M., Stuckey, P.: Local search for a cargo assembly planning problem. In: International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pp. 159–175 (2014)

    Google Scholar 

  4. Boland, N., Gulczynski, D., Savelsbergh, M.: A stockyard planning problem. EURO J. Transp. Log. 1(3), 197–236 (2012)

    Article  Google Scholar 

  5. Harmelen, F.: Handbook of Knowledge Representation, pp. 759–799. Elsevier, Amsterdam (2008)

    Google Scholar 

  6. Kilby, P., Shaw, P.: Vehicle routing, Chap. 23. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Foundations of Artificial Intelligence, pp. 801–836. Elsevier Science Inc., New York (2006)

    Chapter  Google Scholar 

  7. Berger, M., Schroder, M., Kfer, K.: A constraint programming approach for the two-dimensional rectangular packing problem with orthogonal orientations. Fraunhofer-Institut fr Techno-und Wirtschaftsmathematik, Fraunhofer (ITWM), pp. 427–432 (2008)

    Google Scholar 

  8. Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3), 944–959 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: FLAIRS Conference, pp. 555–560 (2008)

    Google Scholar 

  10. Laborie, P.: IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In: Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 148–162. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Acknowledgement

This research is supported by the national natural science foundation of China, no. 71501152.

Author information

Authors and Affiliations

  1. Wuhan University of Technology, Heping Road 1040, Wuhan, China

    Can Wen & Lanbo Zheng

Authors
  1. Can Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lanbo Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lanbo Zheng .

Editor information

Editors and Affiliations

  1. Wuhan University of Technology , Wuhan, China

    Wenfeng Li

  2. Central Queensland University , North Rockhampton, Queensland, Australia

    Shawkat Ali

  3. Delft University of Technology , Delft, The Netherlands

    Gabriel Lodewijks

  4. University of Calabria , Rende (CS), Italy

    Giancarlo Fortino

  5. University of Reading , Reading, United Kingdom

    Giuseppe Di Fatta

  6. Huazhong University of Science and Technology, Wuhan, China

    Zhouping Yin

  7. CSIRO ICT , Acton, Australia

    Mukaddim Pathan

  8. ICAR-CNR, Rende (CS), Italy

    Antonio Guerrieri

  9. Wuhan University of Technology , Wuhan, China

    Qiang Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Wen, C., Zheng, L. (2016). A Constraint Programming Based Method for Stockyard Management Problem. In: Li, W., et al. Internet and Distributed Computing Systems. IDCS 2016. Lecture Notes in Computer Science(), vol 9864. Springer, Cham. https://doi.org/10.1007/978-3-319-45940-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45940-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45939-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation