{"id":"https://openalex.org/W2052142239","doi":"https://doi.org/10.1109/coase.2014.6899457","title":"A column generation approach for the multi-vehicle covering tour problem","display_name":"A column generation approach for the multi-vehicle covering tour problem","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2052142239","doi":"https://doi.org/10.1109/coase.2014.6899457","mag":"2052142239"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2014.6899457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2014.6899457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103235429","display_name":"Keisuke Murakami","orcid":"https://orcid.org/0000-0001-5297-055X"},"institutions":[{"id":"https://openalex.org/I131231118","display_name":"Aoyama Gakuin University","ror":"https://ror.org/002rw7y37","country_code":"JP","type":"education","lineage":["https://openalex.org/I131231118"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Keisuke Murakami","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Aoyama Gakuin University, Sagamihara, Kanagawa, Japan","Department of Industrial and Systems Engineering, Aoyama Gakuin University, Sagamihara, Kanagawa, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Aoyama Gakuin University, Sagamihara, Kanagawa, Japan","institution_ids":["https://openalex.org/I131231118"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Aoyama Gakuin University, Sagamihara, Kanagawa, Japan#TAB#","institution_ids":["https://openalex.org/I131231118"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103235429"],"corresponding_institution_ids":["https://openalex.org/I131231118"],"apc_list":null,"apc_paid":null,"fwci":4.0785,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94181416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1063","last_page":"1068"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9934999942779541,"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.9878000020980835,"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/vertex","display_name":"Vertex (graph theory)","score":0.6937858462333679},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6208306550979614},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.6008731126785278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5858850479125977},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5273340940475464},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4931442141532898},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42470207810401917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3538070619106293},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33308279514312744},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08504000306129456},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.060666024684906006}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6937858462333679},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6208306550979614},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.6008731126785278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5858850479125977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5273340940475464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4931442141532898},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42470207810401917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3538070619106293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33308279514312744},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08504000306129456},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.060666024684906006},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2014.6899457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2014.6899457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W135931579","https://openalex.org/W768332614","https://openalex.org/W1573881838","https://openalex.org/W1966175066","https://openalex.org/W1978511881","https://openalex.org/W1986867012","https://openalex.org/W1999161039","https://openalex.org/W2000882837","https://openalex.org/W2008889665","https://openalex.org/W2054630393","https://openalex.org/W2068424856","https://openalex.org/W2099011086","https://openalex.org/W2108753073","https://openalex.org/W2118356869","https://openalex.org/W2125613881","https://openalex.org/W2134531991","https://openalex.org/W2231561679","https://openalex.org/W6605433004","https://openalex.org/W6622416226","https://openalex.org/W6634175853"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2181722423","https://openalex.org/W2347222412","https://openalex.org/W2085601491","https://openalex.org/W2375996887","https://openalex.org/W4322723290","https://openalex.org/W2368976073","https://openalex.org/W2980963558","https://openalex.org/W2948237757","https://openalex.org/W3111310291"],"abstract_inverted_index":{"The":[0],"multi-vehicle":[1],"covering":[2,81],"tour":[3],"problem":[4],"(m-CTP)":[5],"is":[6,19,30,66],"defined":[7],"on":[8,76],"a":[9,20,31,48,69],"graph":[10],"G":[11],"=":[12],"(V":[13],"\u222a":[14],"W,":[15],"E),":[16],"where":[17],"V":[18,46],"set":[21,32,70],"of":[22,33,50,55,63,71,78],"vertices":[23,34],"that":[24,35,106],"can":[25],"be":[26,37,41],"visited":[27],"and":[28],"W":[29,84],"must":[36],"covered":[38],"but":[39],"cannot":[40],"visited.":[42],"Each":[43],"vertex":[44],"in":[45],"covers":[47],"subset":[49,77],"W.":[51],"Given":[52],"the":[53,61,64,97,110],"costs":[54],"edges":[56],"(vi,":[57],"vj)":[58],"\u2208":[59],"E,":[60],"objective":[62],"m-CTP":[65,98],"to":[67,87],"obtain":[68],"total":[72],"minimum":[73],"cost":[74],"tours":[75],"V,":[79],"while":[80],"all":[82],"vl\u2208":[83],"by":[85],"up":[86],"m":[88],"vehicles.":[89],"In":[90],"this":[91],"paper,":[92],"we":[93],"propose":[94],"algorithms":[95,108],"for":[96],"using":[99],"column":[100],"generation":[101],"approach.":[102],"Computational":[103],"experiments":[104],"show":[105],"our":[107],"outperform":[109],"existing":[111],"algorithms.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}