| dc.contributor.author | Edelkamp, Stefan | * |
| dc.contributor.author | Gath, Max | * |
| dc.contributor.author | Cazenave, Tristan | * |
| dc.contributor.author | Teytaud, Fabien | * |
| dc.date.accessioned | 2017-08-31T09:52:13Z | |
| dc.date.available | 2017-08-31T09:52:13Z | |
| dc.date.issued | 2013 | |
| dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/16663 | |
| dc.language.iso | en | en |
| dc.subject | Monte Carlo methods | en |
| dc.subject | Benchmark testing | en |
| dc.subject | Cities and towns | en |
| dc.subject | Search problems | en |
| dc.subject | Approximation algorithms | en |
| dc.subject | Traveling salesman problems | en |
| dc.subject | Vehicles | en |
| dc.subject.ddc | 519 | en |
| dc.subject.classificationjel | C.C1.C15 | en |
| dc.title | Algorithm and knowledge engineering for the TSPTW problem | en |
| dc.type | Communication / Conférence | |
| dc.description.abstracten | The 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.citationpages | 44-51 | en |
| dc.relation.ispartoftitle | 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched) | en |
| dc.relation.ispartofeditor | Qu, Rong | |
| dc.relation.ispartofeditor | Wang, Ling | |
| dc.relation.ispartofeditor | Pan, Quanke | |
| dc.relation.ispartofpublname | IEEE | en |
| dc.relation.ispartofpublcity | Piscataway, NJ | en |
| dc.relation.ispartofdate | 2013 | |
| dc.relation.ispartofpages | 82 | en |
| dc.identifier.urlsite | https://hal.inria.fr/hal-01406484 | en |
| dc.subject.ddclabel | Probabilités et mathématiques appliquées | en |
| dc.relation.ispartofisbn | 978-1-4673-5909-2 | en |
| dc.relation.conftitle | 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched) | en |
| dc.relation.confdate | 2013-04 | |
| dc.relation.confcity | Singapore | en |
| dc.relation.confcountry | Singapore | en |
| dc.relation.forthcoming | non | en |
| dc.identifier.doi | 10.1109/SCIS.2013.6613251 | en |
| dc.description.ssrncandidate | non | en |
| dc.description.halcandidate | oui | en |
| dc.description.readership | recherche | en |
| dc.description.audience | International | en |
| dc.relation.Isversionofjnlpeerreviewed | non | en |
| dc.relation.Isversionofjnlpeerreviewed | non | en |
| dc.date.updated | 2017-08-31T09:39:45Z | |
| hal.person.labIds | 63470 | * |
| hal.person.labIds | 63470 | * |
| hal.person.labIds | 989 | * |
| hal.person.labIds | 157346 | * |
| hal.faultCode | {"duplicate-entry":{"hal-01406484":{"doi":"1.0"}}} | |
