{"id":"https://openalex.org/W2005839169","doi":"https://doi.org/10.1109/scis.2013.6613251","title":"Algorithm and knowledge engineering for the TSPTW problem","display_name":"Algorithm and knowledge engineering for the TSPTW problem","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2005839169","doi":"https://doi.org/10.1109/scis.2013.6613251","mag":"2005839169"},"language":"en","primary_location":{"id":"doi:10.1109/scis.2013.6613251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scis.2013.6613251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01406484","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058729606","display_name":"Stefan Edelkamp","orcid":"https://orcid.org/0000-0001-8435-5025"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]},{"id":"https://openalex.org/I33256026","display_name":"German Research Centre for Artificial Intelligence","ror":"https://ror.org/01ayc5b57","country_code":"DE","type":"funder","lineage":["https://openalex.org/I33256026"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Edelkamp","raw_affiliation_strings":["Institute for Artificial Intelligence, University of Bremen, Germany","Inst. for Artificial Intell., Univ. of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Artificial Intelligence, University of Bremen, Germany","institution_ids":["https://openalex.org/I33256026","https://openalex.org/I180437899"]},{"raw_affiliation_string":"Inst. for Artificial Intell., Univ. of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083972381","display_name":"Max Gath","orcid":null},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]},{"id":"https://openalex.org/I33256026","display_name":"German Research Centre for Artificial Intelligence","ror":"https://ror.org/01ayc5b57","country_code":"DE","type":"funder","lineage":["https://openalex.org/I33256026"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Max Gath","raw_affiliation_strings":["Institute for Artificial Intelligence, University of Bremen, Germany","Inst. for Artificial Intell., Univ. of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Artificial Intelligence, University of Bremen, Germany","institution_ids":["https://openalex.org/I33256026","https://openalex.org/I180437899"]},{"raw_affiliation_string":"Inst. for Artificial Intell., Univ. of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006305238","display_name":"Tristan Cazenave","orcid":"https://orcid.org/0000-0003-4669-9374"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Tristan Cazenave","raw_affiliation_strings":["LAMSADE, Universite Paris Dauphine, France","Lamsade, Univ. Paris Dauphine, Paris, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universite Paris Dauphine, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"Lamsade, Univ. Paris Dauphine, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060954149","display_name":"Fabien Teytaud","orcid":"https://orcid.org/0000-0002-6670-732X"},"institutions":[{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]},{"id":"https://openalex.org/I59807433","display_name":"Universit\u00e9 Lille Nord de France","ror":"https://ror.org/03btvgn05","country_code":"FR","type":"education","lineage":["https://openalex.org/I59807433"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fabien Teytaud","raw_affiliation_strings":["ULCO, LISIC, University Lille Nord of France, Calais, France","LISIC, Univ. Lille Nord-de-France, Calais, France"],"affiliations":[{"raw_affiliation_string":"ULCO, LISIC, University Lille Nord of France, Calais, France","institution_ids":["https://openalex.org/I59807433"]},{"raw_affiliation_string":"LISIC, Univ. Lille Nord-de-France, Calais, France","institution_ids":["https://openalex.org/I2279609970"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058729606"],"corresponding_institution_ids":["https://openalex.org/I180437899","https://openalex.org/I33256026"],"apc_list":null,"apc_paid":null,"fwci":5.65828289,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.96196548,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"44","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.704072892665863},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7020967602729797},{"id":"https://openalex.org/keywords/compromise","display_name":"Compromise","score":0.6069478988647461},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6040230989456177},{"id":"https://openalex.org/keywords/negotiation","display_name":"Negotiation","score":0.5720659494400024},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5582820773124695},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4460354149341583},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4166313707828522},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.356240838766098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2875407338142395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17550525069236755}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.704072892665863},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7020967602729797},{"id":"https://openalex.org/C46355384","wikidata":"https://www.wikidata.org/wiki/Q726686","display_name":"Compromise","level":2,"score":0.6069478988647461},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6040230989456177},{"id":"https://openalex.org/C199776023","wikidata":"https://www.wikidata.org/wiki/Q202875","display_name":"Negotiation","level":2,"score":0.5720659494400024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5582820773124695},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4460354149341583},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4166313707828522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.356240838766098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2875407338142395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17550525069236755},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/scis.2013.6613251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scis.2013.6613251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01406484v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01406484","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Symposium on Computational Intelligence in Scheduling (CISched), Apr 2013, Singapour, Singapore. pp.44 - 51, ⟨10.1109/SCIS.2013.6613251⟩","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/16663","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/16663","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01406484v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01406484","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Symposium on Computational Intelligence in Scheduling (CISched), Apr 2013, Singapour, Singapore. pp.44 - 51, ⟨10.1109/SCIS.2013.6613251⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W89766480","https://openalex.org/W1208385249","https://openalex.org/W1499159997","https://openalex.org/W1525106674","https://openalex.org/W1568143599","https://openalex.org/W1588577747","https://openalex.org/W1625390266","https://openalex.org/W1824805769","https://openalex.org/W1989179971","https://openalex.org/W2017209461","https://openalex.org/W2076554191","https://openalex.org/W2086918511","https://openalex.org/W2093665022","https://openalex.org/W2096305430","https://openalex.org/W2109405343","https://openalex.org/W2120365438","https://openalex.org/W2122659384","https://openalex.org/W2135644739","https://openalex.org/W2141481566","https://openalex.org/W2142093154","https://openalex.org/W2163873159","https://openalex.org/W2168405694","https://openalex.org/W2224879568","https://openalex.org/W2335471126","https://openalex.org/W6603574455","https://openalex.org/W6629871925","https://openalex.org/W6635205333","https://openalex.org/W6636578284","https://openalex.org/W6678029071","https://openalex.org/W6681050371","https://openalex.org/W6688673858"],"related_works":["https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598","https://openalex.org/W2946024655","https://openalex.org/W2861856156","https://openalex.org/W2146364482","https://openalex.org/W2758988501","https://openalex.org/W4236147943"],"abstract_inverted_index":{"The":[0],"well-known":[1],"traveling":[2],"salesman":[3],"problem":[4],"(TSP)":[5],"is":[6],"concerned":[7],"with":[8,39,53,91],"determining":[9],"the":[10,45,48,77,80],"shortest":[11],"route":[12],"for":[13,33,60,79,98],"a":[14,18,105],"vehicle":[15],"while":[16],"visiting":[17],"set":[19],"of":[20,36,47,64],"cities":[21],"exactly":[22],"once.":[23],"We":[24],"consider":[25],"knowledge":[26,73],"and":[27,67,115],"algorithm":[28],"engineering":[29],"in":[30,104],"combinatorial":[31],"optimization":[32],"improved":[34,62],"solving":[35],"complex":[37],"TSPs":[38],"Time":[40],"Windows":[41],"(TSPTW).":[42],"To":[43,82],"speed-up":[44],"exploration":[46],"applied":[49],"Nested":[50],"Monte-Carlo":[51],"Search":[52],"Policy":[54],"Adaption,":[55],"we":[56,86,95],"perform":[57],"beam":[58],"search":[59,65],"an":[61],"compromise":[63],"breadth":[66],"depth":[68],"as":[69,71],"well":[70],"automated":[72],"elicitation":[74],"to":[75],"seed":[76],"distribution":[78],"exploration.":[81],"evaluate":[83],"our":[84],"approach,":[85],"use":[87,103],"established":[88],"TSPTW":[89,113],"benchmarks":[90],"promising":[92],"results.":[93],"Furthermore,":[94],"indicate":[96],"improvements":[97],"real-world":[99],"logistics":[100],"by":[101],"its":[102],"multiagent":[106],"system.":[107],"Thereby,":[108],"each":[109],"agent":[110],"computes":[111],"individual":[112],"solutions":[114],"starts":[116],"negotiation":[117],"processes":[118],"on":[119],"this":[120],"basis.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}