This book constitutes the thoroughly refereed post-proceedings of the International Workshop on Local Search for Planning and Scheduling, held at a satellite workshop of ECAI 2000 in Berlin, Germany in August 2000. The nine revised full papers presented together with an invited survey on meta-heuristics have gone through two rounds of reviewing and improvement. The papers are organized in topical sections on combinatorial optimization, planning with resources, and related approaches.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020167317
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783540428985
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Withtheincreasingdeploymentofplanningandschedulingsystems,developers oftenhavetodealwithverylargesearchspaces,real-timeperformancedemands, anddynamicenvironments. Completere nementmethodsdonotscalewell,- kinglocalsearchmethodstheonlypracticalalternative. Adynamicenvironment alsopromotestheapplicationoflocalsearch,thesearchheuristicsnotnormally beinga ectedbymodi cationsofthesearchspace. Furthermore,localsearchis wellsuitedforanytimerequirementsbecausetheoptimizationgoalisimproved iteratively. Suchadvantagesareo setbytheincompletenessofmostlocalsearch methods,whichmakesitimpossibletoprovetheinconsistencyoroptimalityof thesolutionsgenerated. Popularlocalsearchapproachesincludeevolutionary- gorithms,simulatedannealing,tabusearch,min-con icts,GSAT,andWalksat. The rstarticleinthisbook aninvitedcontributionbyStefanVoß givesan overviewofthesemethods. ThebookisbasedonthecontributionstotheWorkshoponLocalSearchfor Planning&Scheduling,heldonAugust21,2000atthe14thEuropeanCon- renceonArti cialIntelligence(ECAI2000)inBerlin,Germany. Theworkshop broughttogetherresearchersfromtheplanningandschedulingcommunitiesto explorethesetopicswithrespecttolocalsearchprocedures. Aftertheworkshop, asecondreviewprocessresultedinthecontributionstothepresentvolume . Voß soverviewisfollowedbytwoarticles,byHamiezandHaoandGerevini andSerina,onspeci c classical combinatorialsearchproblems. Thearticleby HamiezandHaoaddressestheproblemofsports-leaguescheduling,presenting results achieved by a tabu search method based on a neighborhood of value swaps. GereviniandSerina sarticleaddressesthetopicthatdominatestherest ofthebook:actionplanning. Itbuildsontheirpreviousworkonlocalsearch onplanninggraphs,presentinganewsearchguidanceheuristicwithdynam ic parametertuning. Thenextsetofarticlesdealwithplanningsystemsthatareabletoinc- porateresourcereasoning. The rstarticle,ofwhichIamtheauthor,makesit clearwhyconventionalplanningsystemscannotproperlyhandleplanningwith resourcesandgivesanoverviewoftheconstraint-basedExcaliburagent spl- ningsystem,whichdoesnothavetheserestrictions. Thenextthreearticlesare aboutNASAJPL sASPEN/CASPERsystem. The rstone byChien,Knight, andRabideau focusesonthereplanningcapabilitiesoflocalsearchmethods, presentingtwoempiricalstudiesinwhichacontinuousplanningprocessclearly outperformsarestartstrategy. Thenextarticle,byEngelhardtandChien,shows howlearningcanbeusedtospeedupthesearchforaplan. Thegoalisto nda setofsearchheuristicsthatguidethesearchaswellaspossible. Thelastarticle inthisblock byKnight,Rabideau,andChien proposesanddemonstrates, a technique for aggregating single search moves so that distant states can be reachedmoreeasily. VI Preface Thelastthreearticlesinthisbookaddresstopicsthatarenotdirectlyrelated tolocalsearch,butthedescribedmethodsmakeverylocaldecisionsduringthe search. RefanidisandVlahavasdescribeextensionstotheGRTplanner,e. g. ,a hill-climbingstrategyforactionselection. Theextensionsresultinmuchbetter performancethanwiththeoriginalGRTplanner. Thesecondarticle byO- india, Sebastia, and Marzal presents a planning algorithm that successively re nes a start graph by di erent phases, e. g. , a phase to guarantee comp- teness. Inthelastarticle,HiraishiandMizoguchipresentasearchmethodfor constructingaroutemap. Constraintswithrespecttomemoryandtimecanbe incorporatedintothesearchprocess. Iwishtoexpressmygratitudetothemembersoftheprogramcommittee, whoactedasreviewersfortheworkshopandthisvolume. Iwouldalsoliketo thank all those who helped to make this workshop a success including, of course,theparticipantsandtheauthorsofpapersinthisvolume. June2001 AlexanderNareyek WorkshopChair ProgramCommittee EmileH. L. Aarts PhilipsResearch Jos eLuisAmbite Univ. ofSouthernCalifornia BlaiBonet UniversityofCalifornia RonenI. Brafman Ben-GurionUniversity SteveChien NASAJPL AndrewDavenport IBMT. J. Watson AlfonsoGerevini Universit`adiBrescia HolgerH. Hoos Univ. ofBritishColumbia AlexanderNareyek GMDFIRST AngeloOddi IP-CNR Mar aC. Ri Univ. T ec. Fed. SantaMar 184 pp. Englisch. N° de réf. du vendeur 9783540428985
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 184. N° de réf. du vendeur 2614419396
Quantité disponible : 4 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783540428985_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783540428985
Quantité disponible : 10 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 1st edition. 169 pages. 9.25x6.25x0.25 inches. In Stock. N° de réf. du vendeur x-3540428984
Quantité disponible : 2 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 184 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 11254299
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. 184. N° de réf. du vendeur 1814419406
Quantité disponible : 4 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Paper.- Meta-heuristics: The State of the Art.- Combinatorial Optimization.- Solving the Sports League Scheduling Problem with Tabu Search.- Lagrange Multipliers for Local Search on Planning Graphs.- Planning with Resources.- Beyond the Plan-Length . N° de réf. du vendeur 4890131
Quantité disponible : Plus de 20 disponibles