Skip to main content
SpringerLink
Log in

Local Search for a Cargo Assembly Planning Problem

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2014)

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

Abstract

We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in the MiniZinc constraint programming language and design a large neighbourhood search scheme. We compare against (an extended version of) a greedy heuristic for the same problem.

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 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. Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Computers & Operations Research 35(3), 944–959 (2008)

    Article  MathSciNet  Google Scholar 

  2. HVCCC: Hunter valley coal chain — overview presentation (2013), http://www.hvccc.com.au/

  3. Lesh, N., Mitzenmacher, M.: BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. Information Processing Letters 97(4), 161–169 (2006)

    Article  MathSciNet  Google Scholar 

  4. Marriott, K., Stuckey, P.J.: A MiniZinc tutorial (2012), http://www.minizinc.org/

  5. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: Towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357–391 (2009)

    Article  MathSciNet  Google Scholar 

  7. Opturion Pty Ltd: Opturion CPX user’s guide: version 1.0.2 (2013), http://www.opturion.com

  8. Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 399–419. Springer, US (2010)

    Chapter  Google Scholar 

  9. Savelsbergh, M., Smith, O.: Cargo assembly planning. Tech. rep. University of Newcastle (2013) (accepted)

    Google Scholar 

  10. Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and programming with Gecode (2013), http://www.gecode.org

  11. Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving RCPSP/max by lazy clause generation. Journal of Scheduling 16(3), 273–289 (2013)

    Article  MathSciNet  Google Scholar 

  12. Schutt, A., Stuckey, P.J., Verden, A.R.: Optimal carpet cutting. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 69–84. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Systems, University of Melbourne, 3010, Australia

    Gleb Belov & Peter J. Stuckey

  2. School of Mathematical and Physical Sciences, University of Newcastle, Callaghan, 2308, Australia

    Natashia Boland & Martin W. P. Savelsbergh

Authors
  1. Gleb Belov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natashia Boland
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin W. P. Savelsbergh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter J. Stuckey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University College Cork, Ireland

    Helmut Simonis

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Belov, G., Boland, N., Savelsbergh, M.W.P., Stuckey, P.J. (2014). Local Search for a Cargo Assembly Planning Problem. In: Simonis, H. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2014. Lecture Notes in Computer Science, vol 8451. Springer, Cham. https://doi.org/10.1007/978-3-319-07046-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07046-9_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07045-2

  • Online ISBN: 978-3-319-07046-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation