Skip to main content
SpringerLink
Log in

Liner Shipping Fleet Repositioning Without Cargo

  • Chapter
Optimizing Liner Shipping Fleet Repositioning Plans

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 57))

Abstract

In this chapter, we present the work on solving liner shipping fleet repositioning problems without cargo demands in Kelareva et al. (2013), Tierney et al. (2012). These works focus on a simplification of the overall fleet repositioning problem, in which cargo demands are not taken into account, and the phase-out and phase-in times are optimized over a multiple week period.

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

Access this chapter

Log in via an institution
eBook
USD 16.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
Hardcover Book
USD 54.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

Notes

  1. 1.

    This is a simplification of the overall LSFRP that we handle in Chap. 6

  2. 2.

    We omit the larger FM3 and TP7 based instances because popf cannot solve them.

  3. 3.

    We sometimes let x denote a set rather than a vector.

  4. 4.

    We used Intel Core i7-2600K 3.4 GHz processors with a maximum of 4 GB of RAM per execution.

References

  1. Benton, J., Coles, A.I., Coles, A.J.: Temporal planning with preferences and time-dependent continuous costs. In: Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS-12), São Paulo (2012)

    Google Scholar 

  2. Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artif. Intell. 90(1–2), 281–300 (1997)

    Article  Google Scholar 

  3. Van Den Briel, M., Vossen, T., Kambhampati, S.: Reviving integer programming approaches for AI planning: a branch-and-cut framework. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), Monterey, pp. 310–319 (2005)

    Google Scholar 

  4. Coles, A.J., Coles, A.I., Clark, A., Gilmore, S.T.: Cost-sensitive concurrent planning under duration uncertainty for service level agreements. In: Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS-11), Freiburg, June 2011

    Google Scholar 

  5. Coles, A.J., Coles, A.I., Fox, M., Long, D.: Temporal planning in domains with linear processes. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), Pasadena, July 2009

    Google Scholar 

  6. Coles, A.J., Coles, A.I., Fox, M., Long, D.: Forward-chaining partial-order planning. In: Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS-10), Toronto, May 2010

    Google Scholar 

  7. Coles, A.J., Coles, A.I., Fox, M., Long, D.: COLIN: planning with continuous linear numeric change. J. Artif. Intell. Res. 44, 1–96 (2012)

    Google Scholar 

  8. Coles, A.I., Coles, A.J., Olaya, A.G., Jiménez, S., López, C.L., Sanner, S., Yoon, S.: A survey of the seventh international planning competition. AI Mag. 33(1), 83–88 (2012)

    Google Scholar 

  9. Coles, A.I., Fox, M., Halsey, K., Long, D., Smith, A.: Managing concurrency in temporal planning using planner-scheduler interaction. Artif. Intell. 173(1), 1–44 (2009)

    Article  Google Scholar 

  10. Coles, A.I., Fox, M., Long, D., Smith, A.: Planning with problems requiring temporal coordination. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), Chicago (2008)

    Google Scholar 

  11. Cushing, W., Kambhampati, S., Mausam, Weld, D.: When is temporal planning really temporal planning? In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad, pp. 1852–1859 (2007)

    Google Scholar 

  12. Do, M.B., Kambhampati, S.: Sapa: a multi-objective metric temporal planner. J. Artif. Intell. Res. 20(1), 155–194 (2003)

    Google Scholar 

  13. Edelkamp, S., Hoffmann, J.: PDDL2.2: the language for the classical part of the 4th international planning competition. Technical report No. 195, Institut für Informatik (2003)

    Google Scholar 

  14. Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP-09), Lisbon. Volume 5732 of Lecture Notes in Computer Science, pp. 352–366 (2009)

    Google Scholar 

  15. Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3–4), 189–208 (1971)

    Article  Google Scholar 

  16. Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61–124 (2003)

    Google Scholar 

  17. Frank, J., Gross, M.A.K., Kürklü, E.: Sofia’s choice: an ai approach to scheduling airborne astronomy observations. In: Proceedings of the 16th Conference on Innovative Applications of Artificial Intelligence (IAAI-04), San Jose, pp. 828–835. AAAI (2004)

    Google Scholar 

  18. Gerevini, A., Saetti, A.: Temporal planning with problems requiring concurrency through action graphs and local search. In: Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS-10), Toronto (2010)

    Google Scholar 

  19. Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. J. Artif. Intell. Res. 28, 239–290 (2003)

    Google Scholar 

  20. Ghallab, M., Laruelle, H.: Representation and control in IxTeT, a temporal planner. In: Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems (AIPS-94), Chicago, vol. 94, pp. 61–67 (1994)

    Google Scholar 

  21. Haslum, P., Bonet, B., Geffner, H.: New admissible heuristics for domain-independent planning. In: Proceedings of the 20th AAAI Conference on Artificial Intelligence (AAAI-05), Pittsburgh (2005)

    Google Scholar 

  22. Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), Vancouver (2007)

    Google Scholar 

  23. Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00), Breckenridge, pp. 140–149 (2000)

    Google Scholar 

  24. Helmert, M., Do, M., Refanidis, I.: The Sixth International Planning Competition, Deterministic Track (2008)

    Google Scholar 

  25. Helmert, M., Domshlak, C.: Landmarks, critical paths and abstractions: what’s the difference anyway? In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-09), Thessaloniki (2009)

    Google Scholar 

  26. Helmert, M., Haslum, P., Hoffmann, J.: Flexible abstraction heuristics for optimal sequential planning. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), Providence (2007)

    Google Scholar 

  27. Hoffmann, J.: The metric-FF planning system: translating “Ignoring Delete Lists” to numeric state variables. J. Artif. Intell. Res. 20, 291–341 (2003)

    Google Scholar 

  28. Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. J. Artif. Intell. Res. 14, 253–302 (2001)

    Google Scholar 

  29. Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC – instance-specific algorithm configuration. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of the 19th European Conference on Artificial Intelligence (ECAI-10), Lisbon. Volume 215 of Frontiers in Intelligence and Applications, pp. 751–756 (2010)

    Google Scholar 

  30. Karger, D., Stein, C., Wein, J.: Scheduling algorithms. In: Algorithms and Theory of Computation Handbook Atallah, Mikhail J. and Blanton, Marina () (1997)

    Google Scholar 

  31. Katz, M., Domshlak, C.: Implicit abstraction heuristics. J. Artif. Intell. Res. 39, 51–126 (2010)

    Google Scholar 

  32. Kautz, H., Walser, J.P.: State-space planning by integer optimization. In: Proceedings of the National Conference on Artificial Intelligence, Orlando, pp. 526–533 (1999)

    Google Scholar 

  33. Kelareva, E., Tierney, K., Kilby, P.: CP methods for scheduling and routing with time-dependent task costs. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Volume 7874 of Lecture Notes in Computer Science, pp. 111–127. Springer, Berlin/Heidelberg (2013)

    Chapter  Google Scholar 

  34. Kissmann, P., Edelkamp, S.: Solving fully-observable non-deterministic planning problems via translation into a general game. In: KI 2009: Advances in Artificial Intelligence, Paderborn, pp. 1–8. Springer (2009)

    Google Scholar 

  35. Li, H.X., Williams, B.C.: Generative planning for hybrid systems based on flow tubes. In: Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS-08), Sydney (2008)

    Google Scholar 

  36. McDermott, D., Ghallab, M., Howe, A., Knoblock, C., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL – the planning domain definition language. Technical report (1998)

    Google Scholar 

  37. Muscettola, N.: HSTS: integrating planning and scheduling. In: Zweben, M., Fox, M. (eds.) Intelligent Scheduling, pp. 169–212. Morgan Kaufmann (1993)

    Google Scholar 

  38. Nethercote, N., Marriott, K., Rafeh, R., Wallace, M., de la Banda, M.G.: Specification of Zinc and MiniZinc, Nov 2010

    Google Scholar 

  39. 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.) Principles and Practice of Constraint Programming (CP-07), Providence. Volume 4741 of Lecture Notes in Computer Science, pp. 529–543. Springer (2007)

    Google Scholar 

  40. Penberthy, J.S., Weld, D.: UCPOP: a sound, complete, partial order planner for ADL. In: Proceedings of the 3rd International Conference on Knowledge Representation and Reasoning, Cambridge (1992)

    Google Scholar 

  41. Penberthy, J.S., Weld, D.S.: Temporal planning with continuous change. In: Proceedings of the National Conference on Artificial Intelligence. Wiley (1995)

    Google Scholar 

  42. Sandewall, E., Rönnquist, R.: A representation of action structures. In: Proceedings of 5th National Conference on Artificial Intelligence, Philadelphia, pp. 89–97 (1986)

    Google Scholar 

  43. Shin, J., Davis, E.: Processes and continuous change in a SAT-based planner. Artif. Intell. 166(1–2), 194–253 (2005)

    Article  Google Scholar 

  44. Smith, S.: Is scheduling a solved problem? In: Kendall, G., Burke, E., Petrovic, S., Gendreau, M. (eds.) Multidisciplinary Scheduling: Theory and Applications, pp. 3–17. Springer, Dordrecht (2005)

    Chapter  Google Scholar 

  45. Smith, D.E., Frank, J., Jónsson, A.K.: Bridging the gap between planning and scheduling. Knowl. Eng. Rev. 15(1), 47–83 (2000)

    Article  Google Scholar 

  46. Tierney, K., Coles, A.J., Coles, A.I., Jensen, R.M.: A PDDL domain of the liner shipping fleet repositioning problem. Technical report TR-2012-152, IT University of Copenhagen (2012)

    Google Scholar 

  47. Tierney, K., Coles, A.J., Coles, A.I., Kroer, C., Britt, A.M., Jensen, R.M.: Automated planning for liner shipping fleet repositioning. In: McCluskey, L., Williams, B., Silva, J.R., Bonet, B. (eds.) Proceedings of the 22nd International Conference on Automated Planning and Scheduling, São Paulo, pp. 279–287 (2012)

    Google Scholar 

  48. Tierney, K., Jensen, R.M.: Temporal optimization planning for fleet repositioning. In: The 5th International Scheduling and Planning Applications woRKshop (SPARK-11), Freiburg (2011)

    Google Scholar 

  49. Vidal, V., Geffner, H.: Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artif. Intell. 170(3), 298–335 (2006)

    Article  Google Scholar 

  50. Wallace, M.: G12 – towards the separation of problem modelling and problem solving. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Pittsburgh. Volume 5547 of Lecture Notes in Computer Science, pp. 8–10. Springer (2009)

    Google Scholar 

  51. Williamson, M., Hanks, S.: Flaw selection strategies for value-directed planning. In: Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), Edinburgh, vol. 23, p. 244 (1996)

    Google Scholar 

  52. Younes, H.L.S., Simmons, R.: VHPOP: versatile heuristic partial order planner. J. Artif. Intell. Res. 20(1), 405–430 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Decision Support & Operations Research Lab, University of Paderborn, Paderborn, Germany

    Kevin Tierney

Authors
  1. Kevin Tierney
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Tierney, K. (2015). Liner Shipping Fleet Repositioning Without Cargo. In: Optimizing Liner Shipping Fleet Repositioning Plans. Operations Research/Computer Science Interfaces Series, vol 57. Springer, Cham. https://doi.org/10.1007/978-3-319-17665-9_5

Download citation

Publish with us

Policies and ethics

Search

Navigation