{"id":"https://openalex.org/W7102573349","doi":"https://doi.org/10.1007/s00500-025-10925-0","title":"On multi-objective multi-coverage covering salesman problem","display_name":"On multi-objective multi-coverage covering salesman problem","publication_year":2025,"publication_date":"2025-10-31","ids":{"openalex":"https://openalex.org/W7102573349","doi":"https://doi.org/10.1007/s00500-025-10925-0"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-025-10925-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-025-10925-0","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-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":null,"display_name":"Amiya Biswas","orcid":"https://orcid.org/0000-0003-3469-5042"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Amiya Biswas","raw_affiliation_strings":["Department of Mathematics, Durgapur Government College, Durgapur, 713214, India"],"raw_orcid":"https://orcid.org/0000-0003-3469-5042","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Durgapur Government College, Durgapur, 713214, India","institution_ids":["https://openalex.org/I155837530"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Erfan Babaee Tirkolaee","orcid":null},"institutions":[{"id":"https://openalex.org/I123173325","display_name":"Mazandaran University of Science and Technology","ror":"https://ror.org/03s3hf581","country_code":"IR","type":"education","lineage":["https://openalex.org/I123173325"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Erfan Babaee Tirkolaee","raw_affiliation_strings":["Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran","institution_ids":["https://openalex.org/I123173325"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Lakshmi Narayan De","orcid":null},"institutions":[{"id":"https://openalex.org/I175399479","display_name":"Haldia Institute of Technology","ror":"https://ror.org/0211bs523","country_code":"IN","type":"education","lineage":["https://openalex.org/I175399479"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Lakshmi Narayan De","raw_affiliation_strings":["Department of Mathematics, Haldia Government College, Purba Medinipur, Haldia, 721657, WB, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Haldia Government College, Purba Medinipur, Haldia, 721657, WB, India","institution_ids":["https://openalex.org/I175399479"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Vincent F. Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Vincent F. Yu","raw_affiliation_strings":["Department of Industrial Management, National Taiwan University of Science and Technology, 43, Sect. 4, Keelung Road, Taipei, 10607, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Management, National Taiwan University of Science and Technology, 43, Sect. 4, Keelung Road, Taipei, 10607, Taiwan","institution_ids":["https://openalex.org/I154864474"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tandra Pal","orcid":null},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tandra Pal","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology Durgapur, Durgapur, 713209, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology Durgapur, Durgapur, 713209, India","institution_ids":["https://openalex.org/I155837530"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I155837530"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54237288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"23-24","first_page":"6005","last_page":"6022"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5019999742507935,"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.5019999742507935,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.17339999973773956,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.10930000245571136,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6948000192642212},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5752999782562256},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5730000138282776},{"id":"https://openalex.org/keywords/chromosome","display_name":"Chromosome","score":0.5228999853134155},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5170000195503235},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4925999939441681},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.483599990606308}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6948000192642212},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5845999717712402},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5752999782562256},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5730000138282776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.557699978351593},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.5228999853134155},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4925999939441681},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.483599990606308},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.3375000059604645},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31150001287460327},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.27239999175071716}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-025-10925-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-025-10925-0","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.7613182663917542}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W164042131","https://openalex.org/W1804879390","https://openalex.org/W1969470455","https://openalex.org/W2010334716","https://openalex.org/W2024060531","https://openalex.org/W2030714952","https://openalex.org/W2035390479","https://openalex.org/W2042986967","https://openalex.org/W2081105435","https://openalex.org/W2087858211","https://openalex.org/W2099011086","https://openalex.org/W2110824994","https://openalex.org/W2118573797","https://openalex.org/W2126105956","https://openalex.org/W2134531991","https://openalex.org/W2139059344","https://openalex.org/W2143381319","https://openalex.org/W2152195021","https://openalex.org/W2168723985","https://openalex.org/W2253899129","https://openalex.org/W2519109668","https://openalex.org/W2769020055","https://openalex.org/W2888310444","https://openalex.org/W2921200099","https://openalex.org/W2998299363","https://openalex.org/W3017464967","https://openalex.org/W3121748795","https://openalex.org/W3124319046","https://openalex.org/W3134024302","https://openalex.org/W3136451821","https://openalex.org/W3214155505","https://openalex.org/W4246598646","https://openalex.org/W4291238181"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-31T00:00:00"}