{"id":"https://openalex.org/W7161163894","doi":"https://doi.org/10.1016/j.asoc.2026.115439","title":"Sustainable profit-maximized vehicle routing under capacity and time constraints: A multi-objective metaheuristic framework","display_name":"Sustainable profit-maximized vehicle routing under capacity and time constraints: A multi-objective metaheuristic framework","publication_year":2026,"publication_date":"2026-05-14","ids":{"openalex":"https://openalex.org/W7161163894","doi":"https://doi.org/10.1016/j.asoc.2026.115439"},"language":"en","primary_location":{"id":"doi:10.1016/j.asoc.2026.115439","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.asoc.2026.115439","pdf_url":null,"source":{"id":"https://openalex.org/S140556538","display_name":"Applied Soft Computing","issn_l":"1568-4946","issn":["1568-4946","1872-9681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied 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":"https://openalex.org/A5074867378","display_name":"Harinandan Tunga","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harinandan Tunga","raw_affiliation_strings":["Department of Computer Science & Engineering, RCC Institute of Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, RCC Institute of Information Technology","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136185804","display_name":"Samarjit Kar","orcid":"https://orcid.org/0000-0002-5503-9338"},"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"]},{"id":"https://openalex.org/I167420956","display_name":"Vilnius Gediminas Technical University","ror":"https://ror.org/02x3e4q36","country_code":"LT","type":"education","lineage":["https://openalex.org/I167420956"]}],"countries":["IN","LT"],"is_corresponding":true,"raw_author_name":"Samarjit Kar","raw_affiliation_strings":["Department of Graphical Systems, Vilnius Gediminas Technical University, Lithuania","Department of Mathematics, National Institute of Technology, Durgapur, 713209, India"],"raw_orcid":"https://orcid.org/0000-0002-5503-9338","affiliations":[{"raw_affiliation_string":"Department of Graphical Systems, Vilnius Gediminas Technical University, Lithuania","institution_ids":["https://openalex.org/I167420956"]},{"raw_affiliation_string":"Department of Mathematics, National Institute of Technology, Durgapur, 713209, India","institution_ids":["https://openalex.org/I155837530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5136136568","display_name":"Monika Singh","orcid":"https://orcid.org/0009-0006-1222-496X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monika Singh","raw_affiliation_strings":["Department of Computer Science & Engineering, RCC Institute of Information Technology"],"raw_orcid":"https://orcid.org/0009-0006-1222-496X","affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, RCC Institute of Information Technology","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5136185804"],"corresponding_institution_ids":["https://openalex.org/I155837530","https://openalex.org/I167420956"],"apc_list":{"value":3350,"currency":"USD","value_usd":3350},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.56049534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"201","issue":null,"first_page":"115439","last_page":"115439"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9254999756813049,"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.9254999756813049,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.032099999487400055,"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"}},{"id":"https://openalex.org/T10539","display_name":"Sustainable Supply Chain Management","score":0.009700000286102295,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6464999914169312},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.608299970626831},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5663999915122986},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47029998898506165},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4489000141620636},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.421999990940094},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.41440001130104065},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.37700000405311584},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.33390000462532043}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7265999913215637},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6464999914169312},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.608299970626831},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5663999915122986},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45820000767707825},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.41440001130104065},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.37700000405311584},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.35929998755455017},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2955000102519989},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C552854447","wikidata":"https://www.wikidata.org/wiki/Q131201","display_name":"Sustainable development","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C2780936489","wikidata":"https://www.wikidata.org/wiki/Q310667","display_name":"Carbon footprint","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C157181609","wikidata":"https://www.wikidata.org/wiki/Q1364310","display_name":"Sustainable transport","level":3,"score":0.2635999917984009},{"id":"https://openalex.org/C2780040678","wikidata":"https://www.wikidata.org/wiki/Q169126","display_name":"Green logistics","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.asoc.2026.115439","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.asoc.2026.115439","pdf_url":null,"source":{"id":"https://openalex.org/S140556538","display_name":"Applied Soft Computing","issn_l":"1568-4946","issn":["1568-4946","1872-9681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W2020320008","https://openalex.org/W2022485595","https://openalex.org/W2023071828","https://openalex.org/W2057559819","https://openalex.org/W2126105956","https://openalex.org/W2152195021","https://openalex.org/W2165171393","https://openalex.org/W2226731518","https://openalex.org/W2765307330","https://openalex.org/W2964290823","https://openalex.org/W2989947400","https://openalex.org/W3017984166","https://openalex.org/W3049697803","https://openalex.org/W3134338469","https://openalex.org/W3201536888","https://openalex.org/W4317103534","https://openalex.org/W4385622316","https://openalex.org/W4385637180","https://openalex.org/W4387334993","https://openalex.org/W4387459238","https://openalex.org/W4394580618","https://openalex.org/W4394932809","https://openalex.org/W4396917002","https://openalex.org/W4396935731","https://openalex.org/W4410232244","https://openalex.org/W4412602790","https://openalex.org/W4414214170"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2026-05-15T00:00:00"}