Hybrid Chaotic Discrete Bat Algorithm with Variable Neighborhood Search for Vehicle Routing Problem in Complex Supply Chain Article Swipe
Yuanhang Qi
,
Yanguang Cai
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.3390/app112110101
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.3390/app112110101
Driven by the supply chain, suppliers, manufacturers and warehouses are working more closely together for improving service quality. However, tremendous cost may incur in the supply chain if transportation is not planned properly and efficiently, which frustrates enterprises in the intense market. In this paper, we present a model of vehicle routing problem in complex supply chain (VRPCSC) and propose an intelligent algorithm called hybrid chaotic discrete bat algorithm with variable neighborhood search for minimizing the purchase cost of materials, processing cost, and delivery cost along the path from suppliers, to manufacturers and warehouses in the vehicle routing problem. Based on the principles of bat algorithm, a discrete chaotic initialization strategy (DCIS) and a variable neighborhood search (VNS) are adopted to enhance the convergence capacity. Finally, two sets of experiments are conducted, which show that the proposed algorithm can solve the VRPCSC effectively.
Related Topics
Concepts
Initialization
Variable neighborhood search
Vehicle routing problem
Supply chain
Computer science
Chaotic
Variable (mathematics)
Mathematical optimization
Convergence (economics)
Routing (electronic design automation)
Operations research
Algorithm
Metaheuristic
Mathematics
Business
Artificial intelligence
Computer network
Economics
Programming language
Marketing
Economic growth
Mathematical analysis
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/app112110101
- https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535
- OA Status
- gold
- Cited By
- 9
- References
- 29
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3208675611
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3208675611Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/app112110101Digital Object Identifier
- Title
-
Hybrid Chaotic Discrete Bat Algorithm with Variable Neighborhood Search for Vehicle Routing Problem in Complex Supply ChainWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-10-28Full publication date if available
- Authors
-
Yuanhang Qi, Yanguang CaiList of authors in order
- Landing page
-
https://doi.org/10.3390/app112110101Publisher landing page
- PDF URL
-
https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535Direct OA link when available
- Concepts
-
Initialization, Variable neighborhood search, Vehicle routing problem, Supply chain, Computer science, Chaotic, Variable (mathematics), Mathematical optimization, Convergence (economics), Routing (electronic design automation), Operations research, Algorithm, Metaheuristic, Mathematics, Business, Artificial intelligence, Computer network, Economics, Programming language, Marketing, Economic growth, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
9Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1, 2024: 4, 2023: 2, 2022: 2Per-year citation counts (last 5 years)
- References (count)
-
29Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3208675611 |
|---|---|
| doi | https://doi.org/10.3390/app112110101 |
| ids.doi | https://doi.org/10.3390/app112110101 |
| ids.mag | 3208675611 |
| ids.openalex | https://openalex.org/W3208675611 |
| fwci | 1.1288286 |
| type | article |
| title | Hybrid Chaotic Discrete Bat Algorithm with Variable Neighborhood Search for Vehicle Routing Problem in Complex Supply Chain |
| biblio.issue | 21 |
| biblio.volume | 11 |
| biblio.last_page | 10101 |
| biblio.first_page | 10101 |
| topics[0].id | https://openalex.org/T10100 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9991999864578247 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Metaheuristic Optimization Algorithms Research |
| topics[1].id | https://openalex.org/T10567 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9987000226974487 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Vehicle Routing Optimization Methods |
| topics[2].id | https://openalex.org/T12176 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9934999942779541 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Optimization and Packing Problems |
| is_xpac | False |
| apc_list.value | 2300 |
| apc_list.currency | CHF |
| apc_list.value_usd | 2490 |
| apc_paid.value | 2300 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 2490 |
| concepts[0].id | https://openalex.org/C114466953 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7306835651397705 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q6034165 |
| concepts[0].display_name | Initialization |
| concepts[1].id | https://openalex.org/C2776435737 |
| concepts[1].level | 3 |
| concepts[1].score | 0.709119439125061 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q7915703 |
| concepts[1].display_name | Variable neighborhood search |
| concepts[2].id | https://openalex.org/C123784306 |
| concepts[2].level | 3 |
| concepts[2].score | 0.6930924654006958 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q944041 |
| concepts[2].display_name | Vehicle routing problem |
| concepts[3].id | https://openalex.org/C108713360 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6431624889373779 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1824206 |
| concepts[3].display_name | Supply chain |
| concepts[4].id | https://openalex.org/C41008148 |
| concepts[4].level | 0 |
| concepts[4].score | 0.6264582872390747 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[4].display_name | Computer science |
| concepts[5].id | https://openalex.org/C2777052490 |
| concepts[5].level | 2 |
| concepts[5].score | 0.6008461117744446 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q5072826 |
| concepts[5].display_name | Chaotic |
| concepts[6].id | https://openalex.org/C182365436 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5536789894104004 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q50701 |
| concepts[6].display_name | Variable (mathematics) |
| concepts[7].id | https://openalex.org/C126255220 |
| concepts[7].level | 1 |
| concepts[7].score | 0.5246869921684265 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[7].display_name | Mathematical optimization |
| concepts[8].id | https://openalex.org/C2777303404 |
| concepts[8].level | 2 |
| concepts[8].score | 0.48981186747550964 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q759757 |
| concepts[8].display_name | Convergence (economics) |
| concepts[9].id | https://openalex.org/C74172769 |
| concepts[9].level | 2 |
| concepts[9].score | 0.43652868270874023 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[9].display_name | Routing (electronic design automation) |
| concepts[10].id | https://openalex.org/C42475967 |
| concepts[10].level | 1 |
| concepts[10].score | 0.39526456594467163 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q194292 |
| concepts[10].display_name | Operations research |
| concepts[11].id | https://openalex.org/C11413529 |
| concepts[11].level | 1 |
| concepts[11].score | 0.3151676058769226 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[11].display_name | Algorithm |
| concepts[12].id | https://openalex.org/C109718341 |
| concepts[12].level | 2 |
| concepts[12].score | 0.22837725281715393 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q1385229 |
| concepts[12].display_name | Metaheuristic |
| concepts[13].id | https://openalex.org/C33923547 |
| concepts[13].level | 0 |
| concepts[13].score | 0.15227878093719482 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[13].display_name | Mathematics |
| concepts[14].id | https://openalex.org/C144133560 |
| concepts[14].level | 0 |
| concepts[14].score | 0.14240628480911255 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q4830453 |
| concepts[14].display_name | Business |
| concepts[15].id | https://openalex.org/C154945302 |
| concepts[15].level | 1 |
| concepts[15].score | 0.1353532075881958 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[15].display_name | Artificial intelligence |
| concepts[16].id | https://openalex.org/C31258907 |
| concepts[16].level | 1 |
| concepts[16].score | 0.09954765439033508 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[16].display_name | Computer network |
| concepts[17].id | https://openalex.org/C162324750 |
| concepts[17].level | 0 |
| concepts[17].score | 0.08726939558982849 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[17].display_name | Economics |
| concepts[18].id | https://openalex.org/C199360897 |
| concepts[18].level | 1 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[18].display_name | Programming language |
| concepts[19].id | https://openalex.org/C162853370 |
| concepts[19].level | 1 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q39809 |
| concepts[19].display_name | Marketing |
| concepts[20].id | https://openalex.org/C50522688 |
| concepts[20].level | 1 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q189833 |
| concepts[20].display_name | Economic growth |
| concepts[21].id | https://openalex.org/C134306372 |
| concepts[21].level | 1 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[21].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/initialization |
| keywords[0].score | 0.7306835651397705 |
| keywords[0].display_name | Initialization |
| keywords[1].id | https://openalex.org/keywords/variable-neighborhood-search |
| keywords[1].score | 0.709119439125061 |
| keywords[1].display_name | Variable neighborhood search |
| keywords[2].id | https://openalex.org/keywords/vehicle-routing-problem |
| keywords[2].score | 0.6930924654006958 |
| keywords[2].display_name | Vehicle routing problem |
| keywords[3].id | https://openalex.org/keywords/supply-chain |
| keywords[3].score | 0.6431624889373779 |
| keywords[3].display_name | Supply chain |
| keywords[4].id | https://openalex.org/keywords/computer-science |
| keywords[4].score | 0.6264582872390747 |
| keywords[4].display_name | Computer science |
| keywords[5].id | https://openalex.org/keywords/chaotic |
| keywords[5].score | 0.6008461117744446 |
| keywords[5].display_name | Chaotic |
| keywords[6].id | https://openalex.org/keywords/variable |
| keywords[6].score | 0.5536789894104004 |
| keywords[6].display_name | Variable (mathematics) |
| keywords[7].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[7].score | 0.5246869921684265 |
| keywords[7].display_name | Mathematical optimization |
| keywords[8].id | https://openalex.org/keywords/convergence |
| keywords[8].score | 0.48981186747550964 |
| keywords[8].display_name | Convergence (economics) |
| keywords[9].id | https://openalex.org/keywords/routing |
| keywords[9].score | 0.43652868270874023 |
| keywords[9].display_name | Routing (electronic design automation) |
| keywords[10].id | https://openalex.org/keywords/operations-research |
| keywords[10].score | 0.39526456594467163 |
| keywords[10].display_name | Operations research |
| keywords[11].id | https://openalex.org/keywords/algorithm |
| keywords[11].score | 0.3151676058769226 |
| keywords[11].display_name | Algorithm |
| keywords[12].id | https://openalex.org/keywords/metaheuristic |
| keywords[12].score | 0.22837725281715393 |
| keywords[12].display_name | Metaheuristic |
| keywords[13].id | https://openalex.org/keywords/mathematics |
| keywords[13].score | 0.15227878093719482 |
| keywords[13].display_name | Mathematics |
| keywords[14].id | https://openalex.org/keywords/business |
| keywords[14].score | 0.14240628480911255 |
| keywords[14].display_name | Business |
| keywords[15].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[15].score | 0.1353532075881958 |
| keywords[15].display_name | Artificial intelligence |
| keywords[16].id | https://openalex.org/keywords/computer-network |
| keywords[16].score | 0.09954765439033508 |
| keywords[16].display_name | Computer network |
| keywords[17].id | https://openalex.org/keywords/economics |
| keywords[17].score | 0.08726939558982849 |
| keywords[17].display_name | Economics |
| language | en |
| locations[0].id | doi:10.3390/app112110101 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210205812 |
| locations[0].source.issn | 2076-3417 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2076-3417 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Applied Sciences |
| locations[0].source.host_organization | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Applied Sciences |
| locations[0].landing_page_url | https://doi.org/10.3390/app112110101 |
| locations[1].id | pmh:oai:doaj.org/article:219cf1aa51a44d85a215a27dd5388a7d |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | cc-by-sa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Applied Sciences, Vol 11, Iss 21, p 10101 (2021) |
| locations[1].landing_page_url | https://doaj.org/article/219cf1aa51a44d85a215a27dd5388a7d |
| locations[2].id | pmh:oai:mdpi.com:/2076-3417/11/21/10101/ |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400947 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | True |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | MDPI (MDPI AG) |
| locations[2].source.host_organization | https://openalex.org/I4210097602 |
| locations[2].source.host_organization_name | Multidisciplinary Digital Publishing Institute (Switzerland) |
| locations[2].source.host_organization_lineage | https://openalex.org/I4210097602 |
| locations[2].license | cc-by |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | Text |
| locations[2].license_id | https://openalex.org/licenses/cc-by |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | Applied Sciences; Volume 11; Issue 21; Pages: 10101 |
| locations[2].landing_page_url | https://dx.doi.org/10.3390/app112110101 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5044909340 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4336-8625 |
| authorships[0].author.display_name | Yuanhang Qi |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I150229711 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Computer Science, University of Electronic Science and Technology of China, Zhongshan Institute, Zhongshan 528402, China |
| authorships[0].affiliations[1].institution_ids | https://openalex.org/I139024713 |
| authorships[0].affiliations[1].raw_affiliation_string | School of Automation, Guangdong University of Technology, Guangzhou 510006, China |
| authorships[0].institutions[0].id | https://openalex.org/I139024713 |
| authorships[0].institutions[0].ror | https://ror.org/04azbjn80 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I139024713 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Guangdong University of Technology |
| authorships[0].institutions[1].id | https://openalex.org/I150229711 |
| authorships[0].institutions[1].ror | https://ror.org/04qr3zq92 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I150229711 |
| authorships[0].institutions[1].country_code | CN |
| authorships[0].institutions[1].display_name | University of Electronic Science and Technology of China |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Yuanhang Qi |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Automation, Guangdong University of Technology, Guangzhou 510006, China, School of Computer Science, University of Electronic Science and Technology of China, Zhongshan Institute, Zhongshan 528402, China |
| authorships[1].author.id | https://openalex.org/A5113047382 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Yanguang Cai |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I139024713 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Automation, Guangdong University of Technology, Guangzhou 510006, China |
| authorships[1].institutions[0].id | https://openalex.org/I139024713 |
| authorships[1].institutions[0].ror | https://ror.org/04azbjn80 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I139024713 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Guangdong University of Technology |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Yanguang Cai |
| authorships[1].is_corresponding | True |
| authorships[1].raw_affiliation_strings | School of Automation, Guangdong University of Technology, Guangzhou 510006, China |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Hybrid Chaotic Discrete Bat Algorithm with Variable Neighborhood Search for Vehicle Routing Problem in Complex Supply Chain |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10100 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9991999864578247 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Metaheuristic Optimization Algorithms Research |
| related_works | https://openalex.org/W2969450897, https://openalex.org/W2372463611, https://openalex.org/W2474040433, https://openalex.org/W2084151425, https://openalex.org/W4294904133, https://openalex.org/W2606053784, https://openalex.org/W3200697270, https://openalex.org/W4317824999, https://openalex.org/W2610428406, https://openalex.org/W2056203753 |
| cited_by_count | 9 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 4 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 2 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 2 |
| locations_count | 3 |
| best_oa_location.id | doi:10.3390/app112110101 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210205812 |
| best_oa_location.source.issn | 2076-3417 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2076-3417 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Applied Sciences |
| best_oa_location.source.host_organization | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Applied Sciences |
| best_oa_location.landing_page_url | https://doi.org/10.3390/app112110101 |
| primary_location.id | doi:10.3390/app112110101 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210205812 |
| primary_location.source.issn | 2076-3417 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2076-3417 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Applied Sciences |
| primary_location.source.host_organization | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.mdpi.com/2076-3417/11/21/10101/pdf?version=1635495535 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Applied Sciences |
| primary_location.landing_page_url | https://doi.org/10.3390/app112110101 |
| publication_date | 2021-10-28 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W2990489463, https://openalex.org/W2907889268, https://openalex.org/W2041986753, https://openalex.org/W1969850235, https://openalex.org/W2902851216, https://openalex.org/W1984127679, https://openalex.org/W2130237456, https://openalex.org/W2066344237, https://openalex.org/W2048463302, https://openalex.org/W2041348841, https://openalex.org/W2017930948, https://openalex.org/W2282631125, https://openalex.org/W2105575625, https://openalex.org/W2425454907, https://openalex.org/W758506392, https://openalex.org/W2888546274, https://openalex.org/W2965788712, https://openalex.org/W2553067200, https://openalex.org/W2910355473, https://openalex.org/W2101812529, https://openalex.org/W2213244149, https://openalex.org/W2740826849, https://openalex.org/W4236807964, https://openalex.org/W7052782385, https://openalex.org/W2802765707, https://openalex.org/W2325312983, https://openalex.org/W2123066915, https://openalex.org/W2963103847, https://openalex.org/W2389577507 |
| referenced_works_count | 29 |
| abstract_inverted_index.a | 47, 106, 113 |
| abstract_inverted_index.In | 42 |
| abstract_inverted_index.an | 60 |
| abstract_inverted_index.by | 1 |
| abstract_inverted_index.if | 27 |
| abstract_inverted_index.in | 23, 38, 53, 94 |
| abstract_inverted_index.is | 29 |
| abstract_inverted_index.of | 49, 78, 103, 128 |
| abstract_inverted_index.on | 100 |
| abstract_inverted_index.to | 90, 120 |
| abstract_inverted_index.we | 45 |
| abstract_inverted_index.and | 7, 33, 58, 82, 92, 112 |
| abstract_inverted_index.are | 9, 118, 130 |
| abstract_inverted_index.bat | 67, 104 |
| abstract_inverted_index.can | 138 |
| abstract_inverted_index.for | 14, 73 |
| abstract_inverted_index.may | 21 |
| abstract_inverted_index.not | 30 |
| abstract_inverted_index.the | 2, 24, 39, 75, 86, 95, 101, 122, 135, 140 |
| abstract_inverted_index.two | 126 |
| abstract_inverted_index.cost | 20, 77, 84 |
| abstract_inverted_index.from | 88 |
| abstract_inverted_index.more | 11 |
| abstract_inverted_index.path | 87 |
| abstract_inverted_index.sets | 127 |
| abstract_inverted_index.show | 133 |
| abstract_inverted_index.that | 134 |
| abstract_inverted_index.this | 43 |
| abstract_inverted_index.with | 69 |
| abstract_inverted_index.(VNS) | 117 |
| abstract_inverted_index.Based | 99 |
| abstract_inverted_index.along | 85 |
| abstract_inverted_index.chain | 26, 56 |
| abstract_inverted_index.cost, | 81 |
| abstract_inverted_index.incur | 22 |
| abstract_inverted_index.model | 48 |
| abstract_inverted_index.solve | 139 |
| abstract_inverted_index.which | 35, 132 |
| abstract_inverted_index.(DCIS) | 111 |
| abstract_inverted_index.Driven | 0 |
| abstract_inverted_index.VRPCSC | 141 |
| abstract_inverted_index.called | 63 |
| abstract_inverted_index.chain, | 4 |
| abstract_inverted_index.hybrid | 64 |
| abstract_inverted_index.paper, | 44 |
| abstract_inverted_index.search | 72, 116 |
| abstract_inverted_index.supply | 3, 25, 55 |
| abstract_inverted_index.adopted | 119 |
| abstract_inverted_index.chaotic | 65, 108 |
| abstract_inverted_index.closely | 12 |
| abstract_inverted_index.complex | 54 |
| abstract_inverted_index.enhance | 121 |
| abstract_inverted_index.intense | 40 |
| abstract_inverted_index.market. | 41 |
| abstract_inverted_index.planned | 31 |
| abstract_inverted_index.present | 46 |
| abstract_inverted_index.problem | 52 |
| abstract_inverted_index.propose | 59 |
| abstract_inverted_index.routing | 51, 97 |
| abstract_inverted_index.service | 16 |
| abstract_inverted_index.vehicle | 50, 96 |
| abstract_inverted_index.working | 10 |
| abstract_inverted_index.(VRPCSC) | 57 |
| abstract_inverted_index.Finally, | 125 |
| abstract_inverted_index.However, | 18 |
| abstract_inverted_index.delivery | 83 |
| abstract_inverted_index.discrete | 66, 107 |
| abstract_inverted_index.problem. | 98 |
| abstract_inverted_index.properly | 32 |
| abstract_inverted_index.proposed | 136 |
| abstract_inverted_index.purchase | 76 |
| abstract_inverted_index.quality. | 17 |
| abstract_inverted_index.strategy | 110 |
| abstract_inverted_index.together | 13 |
| abstract_inverted_index.variable | 70, 114 |
| abstract_inverted_index.algorithm | 62, 68, 137 |
| abstract_inverted_index.capacity. | 124 |
| abstract_inverted_index.improving | 15 |
| abstract_inverted_index.algorithm, | 105 |
| abstract_inverted_index.conducted, | 131 |
| abstract_inverted_index.frustrates | 36 |
| abstract_inverted_index.materials, | 79 |
| abstract_inverted_index.minimizing | 74 |
| abstract_inverted_index.principles | 102 |
| abstract_inverted_index.processing | 80 |
| abstract_inverted_index.suppliers, | 5, 89 |
| abstract_inverted_index.tremendous | 19 |
| abstract_inverted_index.warehouses | 8, 93 |
| abstract_inverted_index.convergence | 123 |
| abstract_inverted_index.enterprises | 37 |
| abstract_inverted_index.experiments | 129 |
| abstract_inverted_index.intelligent | 61 |
| abstract_inverted_index.effectively. | 142 |
| abstract_inverted_index.efficiently, | 34 |
| abstract_inverted_index.neighborhood | 71, 115 |
| abstract_inverted_index.manufacturers | 6, 91 |
| abstract_inverted_index.initialization | 109 |
| abstract_inverted_index.transportation | 28 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 91 |
| corresponding_author_ids | https://openalex.org/A5113047382 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| corresponding_institution_ids | https://openalex.org/I139024713 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/9 |
| sustainable_development_goals[0].score | 0.49000000953674316 |
| sustainable_development_goals[0].display_name | Industry, innovation and infrastructure |
| citation_normalized_percentile.value | 0.82842815 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |