Artículos relacionados a Local Search for Planning and Scheduling: ECAI 2000...
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence): 2148 - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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,presentinganewsearchguidanceheuristicwithdynamic 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 - in
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 52,39
EUR 3,43 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoResultados de la búsqueda para Local Search for Planning and Scheduling: ECAI 2000...
Imagen de archivo
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science, 2148)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020167317
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Local Search for Planning and Scheduling : Ecai 2000 Workshop, Berlin, Germany, August 21, 2000 : Revised Papers
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 916271-n
Cantidad disponible: 15 disponibles
Imagen de archivo
Local Search for Planning and Scheduling (Paperback)
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001
ISBN 10: 3540428984
ISBN 13: 9783540428985
Nuevo
Paperback
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. 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. This text constitutes the refereed post-proceedings of the International Workshop on Local Search for Planning and Scheduling, held at a satellite workshop of ECAI 2000. The papers are organized in topical sections on combinatorial optimization, planning with resources, and related approaches. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783540428985
Cantidad disponible: 1 disponibles
Imagen del vendedor
Local Search for Planning and Scheduling : Ecai 2000 Workshop, Berlin, Germany, August 21, 2000 : Revised Papers
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 916271
Cantidad disponible: 15 disponibles
Imagen de archivo
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science, 2148)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783540428985
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Local Search for Planning and Scheduling
Publicado por
Springer Berlin Heidelberg Nov 2001, 2001
ISBN 10: 3540428984
ISBN 13: 9783540428985
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540428985
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen de archivo
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Condición: New. 2001. Paperback. . . . . . Nº de ref. del artículo: V9783540428985
Gastos de envío:
EUR 10,50
De Irlanda a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 15 disponibles
Imagen de archivo
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science, 2148)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540428985_new
Gastos de envío:
EUR 13,80
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540428985
Gastos de envío:
EUR 17,85
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 10 disponibles
Imagen de archivo
Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. 2001. Paperback. . . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9783540428985
Cantidad disponible: 15 disponibles