ICAPS 2014 ! ! Proceedings+of+the+8th+ Scheduling+and+Planning+Applications+Workshop+ + Edited+By:+ Gabriella+Cortellessa,+Mark+Giuliano,+Riccardo+Rasconi+and+Neil+Yorke@Smith+ + Portsmouth,*New*Hampshire,*USA*5*June*22,*2014* * Organizing*Committee* Gabriella(Cortellessa! ISTC&CNR,!Italy! Mark(Giuliano( Space!Telescope!Science!Institute,!USA!! Riccardo(Rasconi! ISTC&CNR,!Italy! Neil(Yorke6Smith( American!University!of!Beirut,!Lebanon,!and!University!of!Cambridge,!UK! ! Program*Committee* Laura(Barbulescu,!Carnegie!Mellon!University,!USA!! Anthony(Barrett,!Jet!Propulsion!Laboratory,!USA!! Mark(Boddy,!Adventium,!USA!! Luis(Castillo,!University!of!Granada,!Spain!! Gabriella(Cortellessa,!ISTC&CNR,!Italy! Riccardo(De(Benedictis,!ISTC&CNR,!Italy!! Minh(Do,!SGT!Inc.,!NASA!Ames,!USA!! Simone(Fratini,!ESA&ESOC,!Germany!! Mark(Giuliano,!Space!Telescope!Science!Institute,!USA! Christophe(Guettier,!SAGEM,!France!! Patrik(Haslum,!NICTA,!Australia!! Nicola(Policella,!ESA&ESOC,!Germany!! Riccardo(Rasconi,!ISTC&CNR,!Italy! Bernd(Schattenberg,!University!of!Ulm,!Germany!! Tiago(Vaquero,!University!of!Toronto,!Canada!! Ramiro(Varela,!University!of!Oviedo,!Spain!! Gérard(Verfaillie,!ONERA,!France!! Neil(Yorke6Smith,!American!University!of!Beirut,!Lebanon!and!University!of!Cambridge,!UK! Terry(Zimmerman,!University!of!Washington!–!Bothell,!USA! ! ! ! ! ! ! ! ! ! ! ! ! ! Foreword! ! Application!domains!that!entail!planning!and!scheduling!(P&S)!problems!present!a!set!of!compelling!challenges! to!the!AI!planning!and!scheduling!community,!from!modeling!to!technological!to!institutional!issues.!New!real& world! domains! and! problems! are! becoming! more! and! more! freQuently! affordable! challenges! for! AI.! The! international!Scheduling!and!Planning!Applications!woRKshop!(SPARK)!was!established!to!foster!the!practical! application!of!advances!made!in!the!AI!P&S!community.!Building!on!antecedent!events,!SPARK'14!is!the!eighth! edition!of!a!workshop!series!designed!to!provide!a!stable,!long&term!forum!where!researchers!and!practitioners! can!discuss!the!applications!of!planning!and!scheduling!techniques!to!real&world!problems.!The!series!webpage! is!at!http://decsai.ugr.es/~lcv/SPARK/! ! We!are!once!more!very!pleased!to!continue!the!tradition!of!representing!more!applied!aspects!of!the!planning! and! scheduling! community! and! to! perhaps! present! a! pipeline! that! will! enable! increased! representation! of! applied!papers!in!the!main!ICAPS!conference.! ! We!thank!the!Program!Committee!for!their!commitment!in!reviewing.!We!thank!the!ICAPS'14!workshop!and! publication!chairs!for!their!support.! ! The!SPARK’14!Organizers! ! ! Table*of*Contents* ( ( Optimization(Approach(for(the(Management(of(Transshipment(Operations(in( Maritime(Container(Terminals......................................................................................................................1( Eduardo+Lalla@Ruiz,+Christopher+Expósito@Izquierdo,+Belén+Melian@Batista+ and+J.+Marcos+Moreno@Vega! ( Temporal(Planning(for(Business(Process(Optimisation.......................................................................3( Daniele+Magazzeni,+Fabio+Mercorio,+Balbir+Barn,+Tony+Clark,+Franco+Raimondi+ and+Vinay+Kulkarni! ( New(Algorithms(for(The(Top6K(Planning(Problem...............................................................................10( Anton+Riabov,+Shirin+Sohrabi+and+Octavian+Udrea! ( The(Application(of(Planning(to(Urban(Traffic(Control........................................................................17( Falilat+Jimoh,+Lukas+Chrpa+and+Lee+Mccluskey! ( Planning(for(Social(Interaction(with(Sensor(Uncertainty..................................................................19( Mary+Ellen+Foster+and+Ronald+Petrick! ( EXploring(High(Dimensional(Metric(Spaces:(A(Case(Study(Using(Hubble(Space( Telescope(Long(Range(Planning.................................................................................................................21( Mark+Giuliano! ( Intelligent(UAS(Sense6and6Avoid(Utilizing(Global(Constraints........................................................29( David+Smith,+Javier+Barreiro+and+Minh+Do! ( AI6MIX:(Using(Automated(Planning(to(Steer(Human(Workers(Towards(Better( Crowdsourced(Plans.......................................................................................................................................38( Lydia+Manikonda,+Tathagata+Chakraborti,+Sushovan+De,+Kartik+Talamadupula+ and+Subbarao+Kambhampati! ( A(machine(learning(surrogate(for(rotorcraft(noise(optimization...................................................44( Kristen+Brent+Venable,+Bob+Morris,+Matthew+Johnson,+Aliyeh+Mousavi+and+Nikunj+Oza! ( ICAPS 2014 Optimization Approach for the Management of Transshipment Operations in Maritime Container Terminals Eduardo Lalla-Ruiz, Christopher Exposito-Izquierdo,´ Belen´ Melian-Batista´ and J. Marcos Moreno-Vega {elalla, cexposit, mbmelian, jmmoreno}@ull.es Department of Computer Engineering University of La Laguna, Spain Abstract this context, two main logistics problems tightly related to each other arise at container terminals: In this paper we propose a functional integration of two well-known logistic problems arising at maritime con- • Berth Allocation Problem (BAP).Thisproblemisaimed tainer terminals. This integration approach is aimed at at allocating and scheduling incoming container vessels addressing the berthing operations at the seaside of a to berthing positions along the quay of a port (Cordeau et container terminal by considering the service time re- al. 2005). quired to serve incoming container vessels in terms of the work plan of the quay cranes. Due to its relevance • Quay Crane Scheduling Problem (QCSP). It is aimed at as practical application in real environments, our inter- determining the schedule of the loading and unloading est here is to provide an appropriate framework to op- tasks of a container vessel (Bierwirth and Meisel 2009). timize the usage of the technical equipment while im- The joint consideration of both aforementioned problems proving the service of the vessels. The computational might provide a highlighted approach for the management results suggest the suitable performance of our scheme in realistic maritime container terminals. of the seaside operations in maritime container terminals. Therefore, in this work, we address both logistic problems jointly and we will refer to as BAQCSP. Introduction In the BAQCSP, we are given a set of incoming vessels, Amaritimecontainerterminalisaninfrastructureaimedat V = {1, ..., v},andasetofberths,B = {1, ..., b}.Each connecting different transportation modes, usually container j ∈ B is divided into a set of segments, Pj = {1, ..., pj}, vessels, trucks, and trains. The main goal of a maritime con- and has a subset of allocated quay cranes, Qj = {1, ..., qj}. tainer terminal is to serve the container vessels arrived to the Each q ∈ Qj has a position p ∈ Pj within the berth j ∈ B. port. In this regard, serving a container vessel involves to Each container vessel i ∈ V must be assigned to an empty berth j ∈ B within the vessels and berth time windows, unload those containers that are going to be later retrieved ! ! from the terminal by another transportation mode and load [tvi, tvi] and [tbj , tbj],respectively.Thestowageplande- those containers to be carried by the vessel towards a dif- fines a set of tasks, Ωi = {1, ..., ni} (associated to the load- ferent port. The service of a container vessel can be there- ing or unloading operations of the containers groups within fore structured into the following operational decisions: (i) the vessel), for each i ∈ V .Eacht ∈ Ωi is located in a determining a suitable berthing position and berthing time, certain bay along the container vessel, lt,andhasapositive (ii)allocatinganappropriatesubsetofquaycranes,and(iii) handling time, pt.Itisworthmentioningthatitisassumed scheduling the transshipment operations, that is, loading and that each quay crane performs a task without any interrup- unloading of containers (Stahlbock and Voβ 2008). tion. This means that once a quay crane starts to (un)load the In this paper we propose an algorithmic integration ap- containers related to a given task, this goes on until all the proach aimed at modelling the service of container vessels containers included into the relevant group are (un)loaded. arrived to the port. This problem is of utmost importance for Moreover, in each j ∈ B each q ∈ Qj is only available after terminal managers due to its impact on the overall perfor- its earliest ready time, rq ≥ 0,isinitiallylocatedonaposi- q mance of the terminal. tion, l0,andcantravelbetweentwoadjacentpositionsofthe container vessel with a travel time, t>ˆ 0.Thehandlingtime Application Environment required to serve a vessel i ∈ V at berth j ∈ B,denotedas c ,dependsontherequiredtimeforperformingitsassoci- The berthing operations at a container terminal are aimed ij ated loading/unloading tasks by the quay cranes allocated at at serving the container vessels arrived toward the maritime that berth. The main goal of the BAQCSP is to determine the container terminal. They pursue to maximize the productiv- berthing position and berthing time of each vessel in order ity of the handling equipment used to serve the vessels. In to minimize service time for all vessels, defined as the time Copyright !c 2014, Association for the Advancement of Artificial elapsed between the arrival of the vessels and the completion Intelligence (www.aaai.org). All rights reserved. of their handling. 22/06/2014 Proceedings