Automated planning for liner shipping fleet repositioning

ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling

Volumn , Issue , 2012, Pages 279-287

  Tierney, Kevin ^a   Coles, Amanda ^b   Coles, Andrew ^b   Kroer, Christian ^a   Britt, Adam M ^a   Jensen, Rune Møller ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED PLANNING; DATA SETS; INDUSTRIAL COLLABORATORS; LINER SHIPPING; MIXED-INTEGER PROGRAMS; OPTIMIZATION PLANNING;

AUTOMATION; DATA PROCESSING; INDUSTRY;

FLEET OPERATIONS;

EID: 84866439111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. Christiansen, M.; Fagerholt, K.; Nygreen, B.; and Ronen, D. 2007. Maritime transportation. Transportation 14:189-284.
2. Christiansen, M.; Fagerholt, K.; and Ronen, D. 2004. Ship routing and scheduling: Status and perspectives. Transportation Science 38(1):1-18.
3. Coles, A. J.; Coles, A. I.; Fox, M.; and Long, D. 2009. Temporal planning in domains with linear processes. In IJCAI-09.
4. Coles, A. J.; Coles, A. I.; Fox, M.; and Long, D. 2010. Forward-chaining partial-order planning. In ICAPS-10.
5. Coles, A. J.; Coles, A. I.; Clark, A.; and Gilmore, S. T. 2011. Cost-sensitive concurrent planning under duration uncertainty for service level agreements. In ICAPS-11.
6. Cushing, W.; Kambhampati, S.; Mausam; and Weld, D. 2007. When is temporal planning really temporal planning? In IJCAI-07, 1852-1859.
7. Do, M., and Kambhampati, S. 2003. Sapa: A multi-objective metric temporal planner. JAIR 20(1):155-194.
8. Edelkamp, S., and Hoffmann, J. 2003. PDDL2.2: The language for the classical part of the 4th international planning competition. Technical Report No. 195, Institut für Informatik.
9. Fikes, R., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial intelligence 2(3-4):189-208.
10. Fox, M., and Long, D. 2006. Modelling mixed discrete-continuous domains for planning. JAIR 27(1):235-297.
11. Frank, J.; Gross, M.; and Kurklu, E. 2004. SOFIA'S choice: an AI approach to scheduling airborne astronomy observations. In Proc. National Conference on Artificial Intelligence, 828-835.
12. Gerevini, A., and Saetti, A. 2010. Temporal planning with problems requiring concurrency through action graphs and local search. In ICAPS-10.
13. Gerevini, A.; Saetti, A.; and Serina, I. 2003,. Planning through stochastic local search and temporal action graphs. In JAIR, volume 28, 239-290.
14. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proceedings of AIPS, 140-149.
15. Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In AAAI-07.
16. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New Admissible Heuristics for Domain-Independent Planning. In AAAI-05.
17. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: Whats the difference anyway? In ICAPS-09.
18. Helmert, M.; Do, M.; and Refanidis, I. 2008. The sixth international planning competition, deterministic track.
19. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In ICAPS-07.
20. Karger, D.; Stein, C.; and Wein, J. 1997. Scheduling algorithms. CRC Handbook of Computer Science.
21. Katz, M., and Domshlak, C. 2010,. Implicit abstraction heuristics. In JAIR, volume 39, 51-126.
22. Kautz, H., and Walser, J. 1999. State-space planning by integer optimization. In Proc. National Conference on Artificial Intelligence, 526-533.
23. Korsvik, J.; Fagerholt, K.; and Laporte, G. 2011. A large neighbourhood search heuristic for ship routing and scheduling with split loads. Computers & Operations Research 38(2):474-483.
24. Li, H., and Williams, B. 2008. Generative planning for hybrid systems based on flow tubes. In ICAPS-08.
25. Løfstedt, B.; Alvarez, J.; Plum, C.; Pisinger, D.; and Sigurd, M. 2010. An integer programming model and benchmark suite for liner shipping network design. Technical Report 19, DTU Management.
26. Muscettola, N. 1993. HSTS: Integrating planning and scheduling. In Zweben, M., and Fox, M., eds., Intelligent Scheduling. Morgan Kaufmann. 169-212.
27. Penberthy, J., and Weld, D. 1992. UCPOP: A sound, complete, partial order planner for ADL. In Proc. 3rd Int. Conference on Knowledge Representation and Reasoning.
28. Penna, G. D.; Intrigila, B.; Magazzeni, D.; and Mercorio, F. 2009. UPMurphi: a Tool for Universal Planning on PDDL+ Problems. In ICAPS-09.
29. Powell, B., and Perakis, A. 1997. Fleet deployment optimization for liner shipping: An integer programming model. Maritime Policy and Management 24(2):183-192.
30. Sandewall, E., and Rönnquist, R. 1986. A Representation of Action Structures. In Proceedings of 5th (US) National Conference on Artificial Intelligence, 89-97.
31. Shin, J., and Davis, E. 2005. Processes and continuous change in a SAT-based planner. Artificial Intelligence 166(1-2):194-253.
32. Smith, D.; Frank, J.; and Jonsson, A. 2000. Bridging the gap between planning and scheduling. The Knowledge Engineering Review 15(1):47-83.
33. Smith, S. 2005. Is scheduling a solved problem? Multidisciplinary Scheduling: Theory and Applications 3-17.
34. Tierney, K.; Coles, A.; Coles, A.; and Jensen, R. M. 2012. A PDDL Domain of the Liner Shipping Fleet Repositioning Problem. Technical Report TR-2012-152, IT University of Copenhagen.
35. United Nations Conference on Trade and Development. 2011. Review of maritime transport.
36. Van Den Briel, M.; Vossen, T.; and Kambhampati, S. 2005. Reviving integer programming approaches for AI planning: A branch-and-cut framework. In ICAPS 2005, 310-319.
37. Williamson, M., and Hanks, S. 1996. Flaw selection strategies for value-directed planning. In AIPS-96, volume 23, 244.
38. Younes, H., and Simmons, R. 2003,. VHPOP: Versatile heuristic partial order planner. In JAIR, volume 20, 405-430.