{"id":"https://openalex.org/W2318575556","doi":"https://doi.org/10.2514/6.2012-2563","title":"A Binary Programming Solution to the Multiple-Depot, Multiple Traveling Salesman Problem with Constant Profits","display_name":"A Binary Programming Solution to the Multiple-Depot, Multiple Traveling Salesman Problem with Constant Profits","publication_year":2012,"publication_date":"2012-06-19","ids":{"openalex":"https://openalex.org/W2318575556","doi":"https://doi.org/10.2514/6.2012-2563","mag":"2318575556"},"language":"en","primary_location":{"id":"doi:10.2514/6.2012-2563","is_oa":false,"landing_page_url":"https://doi.org/10.2514/6.2012-2563","pdf_url":null,"source":{"id":"https://openalex.org/S4306513317","display_name":"Infotech@Aerospace 2012","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Infotech@Aerospace 2012","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/A5065118152","display_name":"Elad H. Kivelevitch","orcid":null},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Elad Kivelevitch","raw_affiliation_strings":["University of Cincinnati"],"affiliations":[{"raw_affiliation_string":"University of Cincinnati","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034113408","display_name":"Kelly Cohen","orcid":"https://orcid.org/0000-0002-8655-1465"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kelly Cohen","raw_affiliation_strings":["University of Cincinnati"],"affiliations":[{"raw_affiliation_string":"University of Cincinnati","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062946231","display_name":"Manish Kumar","orcid":"https://orcid.org/0000-0003-3247-8589"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manish Kumar","raw_affiliation_strings":["University of Cincinnati"],"affiliations":[{"raw_affiliation_string":"University of Cincinnati","institution_ids":["https://openalex.org/I63135867"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065118152"],"corresponding_institution_ids":["https://openalex.org/I63135867"],"apc_list":null,"apc_paid":null,"fwci":2.01751479,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8910835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9523754715919495},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7889338731765747},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.739536702632904},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.7205499410629272},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6982119083404541},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6427239775657654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5529098510742188},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4821698069572449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37189576029777527},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.04897269606590271}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9523754715919495},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7889338731765747},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.739536702632904},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.7205499410629272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6982119083404541},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6427239775657654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5529098510742188},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4821698069572449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37189576029777527},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.04897269606590271},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2514/6.2012-2563","is_oa":false,"landing_page_url":"https://doi.org/10.2514/6.2012-2563","pdf_url":null,"source":{"id":"https://openalex.org/S4306513317","display_name":"Infotech@Aerospace 2012","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Infotech@Aerospace 2012","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W140946988","https://openalex.org/W168271561","https://openalex.org/W307896644","https://openalex.org/W626292722","https://openalex.org/W1485260266","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1973451304","https://openalex.org/W1974427788","https://openalex.org/W1991149726","https://openalex.org/W1992868085","https://openalex.org/W1993746545","https://openalex.org/W2012597414","https://openalex.org/W2050819731","https://openalex.org/W2058937865","https://openalex.org/W2081474691","https://openalex.org/W2111872033","https://openalex.org/W2123241324","https://openalex.org/W2131451844","https://openalex.org/W2312757399","https://openalex.org/W2332274761","https://openalex.org/W2335257932","https://openalex.org/W2399100674","https://openalex.org/W2606896788","https://openalex.org/W4251567785"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W2265604726","https://openalex.org/W2171568915","https://openalex.org/W2033053473","https://openalex.org/W2362402143","https://openalex.org/W2151159917"],"abstract_inverted_index":{"We":[0,93],"present":[1,94],"a":[2,18,77,89],"solution":[3,73,103],"to":[4,54,69,104,117],"the":[5,21,28,35,45,58,65,82,98,101],"Multiple":[6,8],"Depots,":[7],"Traveling":[9],"Salesmen":[10],"Problem":[11],"(MTSP)":[12],"with":[13,107],"constant":[14],"prots,":[15],"which":[16],"is":[17,52,62,74],"generalization":[19],"of":[20,60,67,81,100,110],"single":[22],"traveling":[23],"salesman":[24],"problem":[25,83],"(TSP)":[26],"in":[27],"following":[29],"ways:":[30],"there":[31],"are":[32,47],"several":[33],"salesmen,":[34],"salesmen":[36],"originate":[37],"at":[38],"various":[39,108],"initial":[40],"locations":[41],"called":[42],"depots,":[43],"and":[44,84,113],"cities":[46],"visited":[48],"only":[49],"if":[50],"it":[51],"protable":[53],"visit":[55,61],"them,":[56],"i.e.,":[57],"benet":[59],"higher":[63],"than":[64],"cost":[66],"travel":[68],"that":[70,96],"city.":[71],"The":[72],"based":[75],"on":[76],"binary":[78],"programming":[79],"formulation":[80,87],"solving":[85],"this":[86],"using":[88],"generic":[90],"branch-and-bound":[91],"algorithm.":[92],"results":[95,116],"show":[97],"ability":[99],"proposed":[102],"solve":[105],"problems":[106],"levels":[109],"city":[111],"benets":[112],"compare":[114],"these":[115],"other":[118],"MTSP":[119],"variants.":[120]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}