Show simple item record

dc.contributor.authorEdelkamp, Stefan*
dc.contributor.authorGath, Max*
dc.contributor.authorCazenave, Tristan*
dc.contributor.authorTeytaud, Fabien*
dc.date.accessioned2017-08-31T09:52:13Z
dc.date.available2017-08-31T09:52:13Z
dc.date.issued2013
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16663
dc.language.isoenen
dc.subjectMonte Carlo methodsen
dc.subjectBenchmark testingen
dc.subjectCities and townsen
dc.subjectSearch problemsen
dc.subjectApproximation algorithmsen
dc.subjectTraveling salesman problemsen
dc.subjectVehiclesen
dc.subject.ddc519en
dc.subject.classificationjelC.C1.C15en
dc.titleAlgorithm and knowledge engineering for the TSPTW problemen
dc.typeCommunication / Conférence
dc.description.abstractenThe well-known traveling salesman problem (TSP) is concerned with determining the shortest route for a vehicle while visiting a set of cities exactly once. We consider knowledge and algorithm engineering in combinatorial optimization for improved solving of complex TSPs with Time Windows (TSPTW). To speed-up the exploration of the applied Nested Monte-Carlo Search with Policy Adaption, we perform beam search for an improved compromise of search breadth and depth as well as automated knowledge elicitation to seed the distribution for the exploration. To evaluate our approach, we use established TSPTW benchmarks with promising results. Furthermore, we indicate improvements for real-world logistics by its use in a multiagent system. Thereby, each agent computes individual TSPTW solutions and starts negotiation processes on this basis.en
dc.identifier.citationpages44-51en
dc.relation.ispartoftitle2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)en
dc.relation.ispartofeditorQu, Rong
dc.relation.ispartofeditorWang, Ling
dc.relation.ispartofeditorPan, Quanke
dc.relation.ispartofpublnameIEEEen
dc.relation.ispartofpublcityPiscataway, NJen
dc.relation.ispartofdate2013
dc.relation.ispartofpages82en
dc.identifier.urlsitehttps://hal.inria.fr/hal-01406484en
dc.subject.ddclabelProbabilités et mathématiques appliquéesen
dc.relation.ispartofisbn978-1-4673-5909-2en
dc.relation.conftitle2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)en
dc.relation.confdate2013-04
dc.relation.confcitySingaporeen
dc.relation.confcountrySingaporeen
dc.relation.forthcomingnonen
dc.identifier.doi10.1109/SCIS.2013.6613251en
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewednonen
dc.relation.Isversionofjnlpeerreviewednonen
dc.date.updated2017-08-31T09:39:45Z
hal.person.labIds63470*
hal.person.labIds63470*
hal.person.labIds989*
hal.person.labIds157346*
hal.faultCode{"duplicate-entry":{"hal-01406484":{"doi":"1.0"}}}


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record