Automated Planning for Liner Shipping Fleet Repositioning
暂无分享,去创建一个
Andrew Coles | Rune Møller Jensen | Kevin Tierney | Amanda Jane Coles | Christian Kroer | Adam M. Britt
[1] Patrik Haslum,et al. Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.
[2] Patrik Haslum,et al. Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.
[3] Andrew Coles,et al. A PDDL Domain for the Liner Shipping Fleet Repositioning Problem , 2012 .
[4] Jeremy Frank,et al. SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations , 2004, AAAI.
[5] Subbarao Kambhampati,et al. Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.
[6] Daniel S. Weld,et al. UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.
[7] Maria Fox,et al. Modelling Mixed Discrete-Continuous Domains for Planning , 2006, J. Artif. Intell. Res..
[8] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[9] Stephen F. Smith,et al. Is Scheduling a Solved Problem , 2005 .
[10] Steve Hanks,et al. Flaw Selection Strategies for Value-Directed Planning , 1996, AIPS.
[11] Mark S. Fox,et al. Intelligent Scheduling , 1998 .
[12] Subbarao Kambhampati,et al. Sapa: A Multi-objective Metric Temporal Planner , 2003, J. Artif. Intell. Res..
[13] Erik Sandewall,et al. A Representation of Action Structures , 1986, AAAI.
[14] David R. Karger,et al. Scheduling Algorithms , 2004, Algorithms and Theory of Computation Handbook.
[15] B. J. Powell,et al. Fleet deployment optimization for liner shipping: an integer programming model , 1997 .
[16] Subbarao Kambhampati,et al. When is Temporal Planning Really Temporal? , 2007, IJCAI.
[17] Andrew Coles,et al. Forward-Chaining Partial-Order Planning , 2010, ICAPS.
[18] Kjetil Fagerholt,et al. Ship Routing and Scheduling: Status and Perspectives , 2004, Transp. Sci..
[19] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[20] Ji-Ae Shin,et al. Processes and continuous change in a SAT-based planner , 2005, Artif. Intell..
[21] Nicola Muscettola,et al. HSTS: Integrating Planning and Scheduling , 1993 .
[22] Carmel Domshlak,et al. Implicit Abstraction Heuristics , 2010, J. Artif. Intell. Res..
[23] Allan Clark,et al. Cost-Sensitive Concurrent Planning Under Duration Uncertainty for Service-Level Agreements , 2011, ICAPS.
[24] Ivan Serina,et al. Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search , 2010, ICAPS.
[25] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[26] David E. Smith,et al. Bridging the gap between planning and scheduling , 2000, The Knowledge Engineering Review.
[27] Kjetil Fagerholt,et al. A large neighbourhood search heuristic for ship routing and scheduling with split loads , 2010, Comput. Oper. Res..
[28] Benedetto Intrigila,et al. UPMurphi: A Tool for Universal Planning on PDDL+ Problems , 2009, ICAPS.
[29] Kjetil Fagerholt,et al. Chapter 4 Maritime Transportation , 2007, Transportation.
[30] Patrik Haslum,et al. New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.
[31] Henry A. Kautz,et al. State-space Planning by Integer Optimization , 1999, AAAI/IAAI.
[32] David Pisinger,et al. A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design , 2014, Transp. Sci..
[33] Brian C. Williams,et al. Generative Planning for Hybrid Systems Based on Flow Tubes , 2008, ICAPS.
[34] Andrew Coles,et al. Temporal Planning in Domains with Linear Processes , 2009, IJCAI.
[35] Håkan L. S. Younes,et al. VHPOP: Versatile Heuristic Partial Order Planner , 2003, J. Artif. Intell. Res..
[36] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..