{"id":"https://openalex.org/W2616464340","doi":"https://doi.org/10.1016/j.trpro.2017.03.042","title":"New integer programming formulation for multiple traveling repairmen problem","display_name":"New integer programming formulation for multiple traveling repairmen problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2616464340","doi":"https://doi.org/10.1016/j.trpro.2017.03.042","mag":"2616464340"},"language":"en","primary_location":{"id":"doi:10.1016/j.trpro.2017.03.042","doi":"https://doi.org/10.1016/j.trpro.2017.03.042","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.trpro.2017.03.042","pdf_url":"https://www.sciencedirect.com/science/article/pii/S2352146517301771/pdf","source":{"id":"https://openalex.org/S2764743394","display_name":"Transportation research procedia","issn_l":"2352-1457","issn":["2352-1457","2352-1465"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Research Procedia","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sciencedirect.com/science/article/pii/S2352146517301771/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002488187","display_name":"G\u00f6zde \u00d6nder Uzun","orcid":"https://orcid.org/0000-0001-7527-0310","observed_orcids":["https://orcid.org/0000-0001-7527-0310"]},"institutions":[{"id":"https://openalex.org/I188740104","display_name":"Ba\u015fkent University","ror":"https://ror.org/02v9bqx10","country_code":"TR","type":"education","lineage":["https://openalex.org/I188740104"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Gozde Onder","raw_affiliation_strings":["Baskent University, Industrial Engineering Department, Baglica Campus, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Baskent University, Industrial Engineering Department, Baglica Campus, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083136624","display_name":"\u0130mdat Kara","orcid":"https://orcid.org/0000-0002-1756-2873","observed_orcids":["https://orcid.org/0000-0002-1756-2873"]},"institutions":[{"id":"https://openalex.org/I188740104","display_name":"Ba\u015fkent University","ror":"https://ror.org/02v9bqx10","country_code":"TR","type":"education","lineage":["https://openalex.org/I188740104"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Imdat Kara","raw_affiliation_strings":["Baskent University, Industrial Engineering Department, Baglica Campus, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Baskent University, Industrial Engineering Department, Baglica Campus, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081608856","display_name":"Tusan Derya","orcid":"https://orcid.org/0000-0002-2851-4463","observed_orcids":["https://orcid.org/0000-0002-2851-4463"]},"institutions":[{"id":"https://openalex.org/I188740104","display_name":"Ba\u015fkent University","ror":"https://ror.org/02v9bqx10","country_code":"TR","type":"education","lineage":["https://openalex.org/I188740104"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Tusan Derya","raw_affiliation_strings":["Baskent University, Industrial Engineering Department, Baglica Campus, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Baskent University, Industrial Engineering Department, Baglica Campus, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002488187"],"corresponding_institution_ids":["https://openalex.org/I188740104"],"apc_list":null,"apc_paid":null,"fwci":1.7298,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.85936302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"22","issue":null,"first_page":"355","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.00019999999494757503,"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/minimum-latency-problem","display_name":"minimum latency problem","score":0.7390000224113464},{"id":"https://openalex.org/keywords/mixed-integer-linear-programming-formulation","display_name":"mixed-integer linear programming formulation","score":0.9509999752044678},{"id":"https://openalex.org/keywords/hamiltonian-tour","display_name":"Hamiltonian tour","score":0.6650000214576721},{"id":"https://openalex.org/keywords/customer-waiting-time","display_name":"customer waiting time","score":0.8339999914169312},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.5920000076293945},{"id":"https://openalex.org/keywords/benchmark-instances","display_name":"benchmark instances","score":0.5339999794960022}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6948721408843994},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6351326704025269},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5710418820381165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.545342206954956},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5054583549499512},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.46028345823287964},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4592994749546051},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4343720078468323},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3703150153160095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31746596097946167},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.27662011981010437},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17159318923950195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13702082633972168},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.trpro.2017.03.042","doi":"https://doi.org/10.1016/j.trpro.2017.03.042","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.trpro.2017.03.042","pdf_url":"https://www.sciencedirect.com/science/article/pii/S2352146517301771/pdf","source":{"id":"https://openalex.org/S2764743394","display_name":"Transportation research procedia","issn_l":"2352-1457","issn":["2352-1457","2352-1465"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Research Procedia","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.trpro.2017.03.042","doi":"https://doi.org/10.1016/j.trpro.2017.03.042","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.trpro.2017.03.042","pdf_url":"https://www.sciencedirect.com/science/article/pii/S2352146517301771/pdf","source":{"id":"https://openalex.org/S2764743394","display_name":"Transportation research procedia","issn_l":"2352-1457","issn":["2352-1457","2352-1465"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Research Procedia","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5378999710083008}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2616464340.pdf","grobid_xml":"https://content.openalex.org/works/W2616464340.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W59787217","https://openalex.org/W560203592","https://openalex.org/W1492330513","https://openalex.org/W1512117524","https://openalex.org/W1572313895","https://openalex.org/W1760833224","https://openalex.org/W1966793805","https://openalex.org/W1991678853","https://openalex.org/W1995284651","https://openalex.org/W2002663664","https://openalex.org/W2005117954","https://openalex.org/W2036200993","https://openalex.org/W2056425817","https://openalex.org/W2066528983","https://openalex.org/W2068403188","https://openalex.org/W2072136110","https://openalex.org/W2087852198","https://openalex.org/W2088342306","https://openalex.org/W2093376706","https://openalex.org/W2115556222","https://openalex.org/W2116018028","https://openalex.org/W2148742122","https://openalex.org/W2153278891","https://openalex.org/W2157781665","https://openalex.org/W2297168717"],"related_works":["https://openalex.org/W4241042028","https://openalex.org/W2593628802","https://openalex.org/W2183883686","https://openalex.org/W2308004816","https://openalex.org/W4255444228","https://openalex.org/W3133546185","https://openalex.org/W2551068551","https://openalex.org/W3003869274","https://openalex.org/W4242872954","https://openalex.org/W4395104974"],"abstract_inverted_index":{"The":[0,54],"multiple":[1,99],"traveling":[2,11,100],"repairman":[3,12,101,105],"problem":[4,13,22,102],"(kTRP)":[5],"is":[6,15,37,56,78,149],"a":[7,35,59,63,90,115],"generalization":[8],"of":[9,34,46,72,82,124,157],"the":[10,19,24,40,44,47,68,83,98,108,112,122,125,141,153],"which":[14],"also":[16],"known":[17],"as":[18,39],"minimum":[20],"latency":[21,33],"and":[23,110],"deliveryman":[25],"problem.":[26],"In":[27,85,118],"these":[28],"problems,":[29],"waiting":[30,70],"time":[31,41,71],"or":[32,62],"customer":[36,77],"defined":[38],"passed":[42],"from":[43,107],"beginning":[45],"travel":[48],"until":[49],"this":[50,86],"customer's":[51],"service":[52],"completed.":[53],"objective":[55],"to":[57,120],"find":[58],"Hamiltonian":[60,64],"Tour":[61],"Path":[65],"that":[66,75,146],"minimizes":[67],"total":[69],"customers":[73],"so":[74],"each":[76,104],"visited":[79],"by":[80,135],"one":[81],"repairmen.":[84],"paper,":[87],"we":[88,131],"propose":[89],"new":[91],"mixed":[92],"integer":[93],"linear":[94],"programming":[95],"formulation":[96,127],"for":[97],"where":[103],"starts":[106],"depot":[109],"finishes":[111],"journey":[113],"at":[114],"given":[116],"node.":[117],"order":[119],"see":[121],"performance":[123],"proposed":[126,147],"against":[128],"existing":[129],"formulations,":[130],"conduct":[132],"computational":[133],"analysis":[134],"solving":[136],"benchmark":[137],"instances":[138],"appeared":[139],"in":[140,155],"literature.":[142],"Computational":[143],"results":[144],"show":[145],"model":[148],"extremely":[150],"effective":[151],"than":[152],"others":[154],"terms":[156],"CPU":[158],"times.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2017-05-26T00:00:00"}