{"id":"https://openalex.org/W2910347949","doi":"https://doi.org/10.1109/ieem.2018.8607480","title":"A Matheuristic for a Real-world Variant of the Multiple Traveling Salesman Problem","display_name":"A Matheuristic for a Real-world Variant of the Multiple Traveling Salesman Problem","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2910347949","doi":"https://doi.org/10.1109/ieem.2018.8607480","mag":"2910347949"},"language":"en","primary_location":{"id":"doi:10.1109/ieem.2018.8607480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem.2018.8607480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072687277","display_name":"Philipp Baumann","orcid":"https://orcid.org/0000-0002-3286-4474"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Philipp Baumann","raw_affiliation_strings":["Department of Business Administration, University of Bern, Schuetzenmattstrasse 14 3012 Bern, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Business Administration, University of Bern, Schuetzenmattstrasse 14 3012 Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072687277"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":0.2522,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67496198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1426","last_page":"1430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7599730491638184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.701787531375885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6233327388763428},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6162804365158081},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5168405175209045},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4860011041164398},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4395500123500824},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.41800791025161743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17360728979110718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16607993841171265}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7599730491638184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.701787531375885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6233327388763428},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6162804365158081},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5168405175209045},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4860011041164398},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4395500123500824},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.41800791025161743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17360728979110718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16607993841171265},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ieem.2018.8607480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem.2018.8607480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},{"id":"pmh:oai:boris.unibe.ch:123482","is_oa":false,"landing_page_url":"https://boris.unibe.ch/123482/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baumann, Philipp (19 December 2018). A matheuristic for a real-world variant of the multiple traveling salesman problem. In: IEEM 2018: IEEE International Conference on Industrial Engineering and Engineering Management. Bangkok. 16.12-19.12.2018.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:boris.unibe.ch:123486","is_oa":false,"landing_page_url":"https://boris.unibe.ch/123486/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baumann, Philipp (19 December 2018). A matheuristic for a real-world variant of the multiple traveling salesman problem (Unpublished). In: IEEM International Conference on Industrial Engineering and Engineering Management 2018. Bangkok. 16.-19. Dezember 2018.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1106295328","https://openalex.org/W1504684182","https://openalex.org/W2050819731","https://openalex.org/W2131646163","https://openalex.org/W2147151422","https://openalex.org/W2262276395","https://openalex.org/W6630161371"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W2164188042","https://openalex.org/W2913191894","https://openalex.org/W3157689847","https://openalex.org/W4389782626","https://openalex.org/W4376138746"],"abstract_inverted_index":{"Significant":[0],"long-term":[1],"cost":[2],"savings":[3],"can":[4],"be":[5,70,108,154],"achieved":[6],"when":[7],"labor-intensive":[8],"daily":[9],"operations":[10],"are":[11,48,105],"executed":[12],"at":[13],"minimal":[14],"cost.":[15],"We":[16,50,73],"consider":[17],"here":[18],"a":[19,29,56,78,84,92],"real-world":[20],"planning":[21,35],"problem":[22,36,54,64,76],"that":[23,43,52,104,118],"was":[24],"reported":[25],"to":[26,65,95,101,107,125,135,153],"us":[27],"by":[28],"real":[30],"estate":[31],"valuation":[32],"company.":[33],"The":[34,89,142],"consists":[37],"of":[38,59],"scheduling":[39],"on-site":[40],"visits":[41,137],"such":[42],"the":[44,60,75,119],"total":[45],"operating":[46],"costs":[47],"minimized.":[49],"show":[51],"this":[53],"represents":[55],"new":[57,93],"variant":[58],"multiple":[61],"traveling":[62],"salesman":[63],"which":[66],"existing":[67],"approaches":[68],"cannot":[69],"applied":[71],"directly.":[72],"formulate":[74],"as":[77],"mixed-binary":[79,120],"linear":[80,121],"program":[81,122],"and":[82,99,151],"develop":[83],"matheuristic":[85,90,143],"for":[86,131],"large-scale":[87],"instances.":[88],"employs":[91],"strategy":[94],"construct":[96],"subproblems":[97],"effectively":[98],"techniques":[100],"exclude":[102],"variables":[103],"unlikely":[106],"non-zero":[109],"in":[110,138],"an":[111],"optimal":[112,127],"solution.":[113],"Our":[114],"computational":[115],"analysis":[116],"demonstrates":[117],"is":[123],"able":[124],"devise":[126],"or":[128],"near-optimal":[129],"solutions":[130],"instances":[132,150],"with":[133],"up":[134],"200":[136],"short":[139],"running":[140],"times.":[141],"performs":[144],"equally":[145],"well":[146],"on":[147],"small-and":[148],"medium-sized":[149],"proves":[152],"highly":[155],"scalable.":[156]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}