Two-Dimensional Loading in Vehicle Routing Problem With Release and Due Dates Article Swipe
Jaikishan Soman
,
Rahul Patil
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.21203/rs.3.rs-750430/v1
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.21203/rs.3.rs-750430/v1
In this paper, we study a two-dimensional vehicle loading and routing problem, in which customer orders with deadlines become available for dispatch as per their release dates. The objective is to minimize the sum of transportation, inventory, and tardiness costs, while respecting various loading and routing constraints. This scenario allows us to study various tradeoffs that tend to arise due to temporal order aggregation across release dates. We thereby propose an integrated mathematical formulation to simultaneously model both the routing and loading requirements of the problem at hand. Specifically, as the problem is NP-hard, we propose a scatter search based heuristic approach to solve large-size instances. Further, its performance is enhanced using problem-specific procedures and strategic oscillation approaches. Additionally, the numerical experiments illustrate the influence of cost structures on both the optimal loading configurations along with the optimal routes. Importantly, our experiments also suggest that the proposed scatter search method can produce good quality solutions in less time.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.21203/rs.3.rs-750430/v1
- https://www.researchsquare.com/article/rs-750430/latest.pdf
- OA Status
- green
- References
- 47
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4200027869
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4200027869Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.21203/rs.3.rs-750430/v1Digital Object Identifier
- Title
-
Two-Dimensional Loading in Vehicle Routing Problem With Release and Due DatesWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-12-06Full publication date if available
- Authors
-
Jaikishan Soman, Rahul PatilList of authors in order
- Landing page
-
https://doi.org/10.21203/rs.3.rs-750430/v1Publisher landing page
- PDF URL
-
https://www.researchsquare.com/article/rs-750430/latest.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://www.researchsquare.com/article/rs-750430/latest.pdfDirect OA link when available
- Concepts
-
Routing (electronic design automation), Tardiness, Mathematical optimization, Heuristic, Vehicle routing problem, Computer science, Order (exchange), Mathematics, Job shop scheduling, Economics, Finance, Computer networkTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
47Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4200027869 |
|---|---|
| doi | https://doi.org/10.21203/rs.3.rs-750430/v1 |
| ids.doi | https://doi.org/10.21203/rs.3.rs-750430/v1 |
| ids.openalex | https://openalex.org/W4200027869 |
| fwci | 0.0 |
| type | preprint |
| title | Two-Dimensional Loading in Vehicle Routing Problem With Release and Due Dates |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10567 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9990000128746033 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Vehicle Routing Optimization Methods |
| topics[1].id | https://openalex.org/T10698 |
| topics[1].field.id | https://openalex.org/fields/33 |
| topics[1].field.display_name | Social Sciences |
| topics[1].score | 0.9911999702453613 |
| topics[1].domain.id | https://openalex.org/domains/2 |
| topics[1].domain.display_name | Social Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/3313 |
| topics[1].subfield.display_name | Transportation |
| topics[1].display_name | Transportation Planning and Optimization |
| topics[2].id | https://openalex.org/T12306 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.984000027179718 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2215 |
| topics[2].subfield.display_name | Building and Construction |
| topics[2].display_name | Urban and Freight Transport Logistics |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C74172769 |
| concepts[0].level | 2 |
| concepts[0].score | 0.741665244102478 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[0].display_name | Routing (electronic design automation) |
| concepts[1].id | https://openalex.org/C2778047078 |
| concepts[1].level | 4 |
| concepts[1].score | 0.7068188786506653 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q82299449 |
| concepts[1].display_name | Tardiness |
| concepts[2].id | https://openalex.org/C126255220 |
| concepts[2].level | 1 |
| concepts[2].score | 0.6429994106292725 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[2].display_name | Mathematical optimization |
| concepts[3].id | https://openalex.org/C173801870 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6265734434127808 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q201413 |
| concepts[3].display_name | Heuristic |
| concepts[4].id | https://openalex.org/C123784306 |
| concepts[4].level | 3 |
| concepts[4].score | 0.6116893887519836 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q944041 |
| concepts[4].display_name | Vehicle routing problem |
| concepts[5].id | https://openalex.org/C41008148 |
| concepts[5].level | 0 |
| concepts[5].score | 0.5976312756538391 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[5].display_name | Computer science |
| concepts[6].id | https://openalex.org/C182306322 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4963884949684143 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1779371 |
| concepts[6].display_name | Order (exchange) |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.16071370244026184 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C55416958 |
| concepts[8].level | 3 |
| concepts[8].score | 0.10556921362876892 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q6206757 |
| concepts[8].display_name | Job shop scheduling |
| concepts[9].id | https://openalex.org/C162324750 |
| concepts[9].level | 0 |
| concepts[9].score | 0.07325631380081177 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[9].display_name | Economics |
| concepts[10].id | https://openalex.org/C10138342 |
| concepts[10].level | 1 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q43015 |
| concepts[10].display_name | Finance |
| concepts[11].id | https://openalex.org/C31258907 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[11].display_name | Computer network |
| keywords[0].id | https://openalex.org/keywords/routing |
| keywords[0].score | 0.741665244102478 |
| keywords[0].display_name | Routing (electronic design automation) |
| keywords[1].id | https://openalex.org/keywords/tardiness |
| keywords[1].score | 0.7068188786506653 |
| keywords[1].display_name | Tardiness |
| keywords[2].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[2].score | 0.6429994106292725 |
| keywords[2].display_name | Mathematical optimization |
| keywords[3].id | https://openalex.org/keywords/heuristic |
| keywords[3].score | 0.6265734434127808 |
| keywords[3].display_name | Heuristic |
| keywords[4].id | https://openalex.org/keywords/vehicle-routing-problem |
| keywords[4].score | 0.6116893887519836 |
| keywords[4].display_name | Vehicle routing problem |
| keywords[5].id | https://openalex.org/keywords/computer-science |
| keywords[5].score | 0.5976312756538391 |
| keywords[5].display_name | Computer science |
| keywords[6].id | https://openalex.org/keywords/order |
| keywords[6].score | 0.4963884949684143 |
| keywords[6].display_name | Order (exchange) |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.16071370244026184 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/job-shop-scheduling |
| keywords[8].score | 0.10556921362876892 |
| keywords[8].display_name | Job shop scheduling |
| keywords[9].id | https://openalex.org/keywords/economics |
| keywords[9].score | 0.07325631380081177 |
| keywords[9].display_name | Economics |
| language | en |
| locations[0].id | doi:10.21203/rs.3.rs-750430/v1 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306402450 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Research Square (Research Square) |
| locations[0].source.host_organization | https://openalex.org/I4210096694 |
| locations[0].source.host_organization_name | Research Square (United States) |
| locations[0].source.host_organization_lineage | https://openalex.org/I4210096694 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.researchsquare.com/article/rs-750430/latest.pdf |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | posted-content |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.21203/rs.3.rs-750430/v1 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5074987568 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Jaikishan Soman |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Management, Indian Institute of Technology, Bombay, Mumbai -400076, India |
| authorships[0].institutions[0].id | https://openalex.org/I162827531 |
| authorships[0].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Jaikishan Soman |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Management, Indian Institute of Technology, Bombay, Mumbai -400076, India |
| authorships[1].author.id | https://openalex.org/A5085475889 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-0530-6933 |
| authorships[1].author.display_name | Rahul Patil |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I162827531 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Management, Indian Institute of Technology, Bombay, Mumbai -400076, India |
| authorships[1].institutions[0].id | https://openalex.org/I162827531 |
| authorships[1].institutions[0].ror | https://ror.org/02qyf5152 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I162827531 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Indian Institute of Technology Bombay |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Rahul J Patil |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Management, Indian Institute of Technology, Bombay, Mumbai -400076, India |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.researchsquare.com/article/rs-750430/latest.pdf |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Two-Dimensional Loading in Vehicle Routing Problem With Release and Due Dates |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10567 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9990000128746033 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Vehicle Routing Optimization Methods |
| related_works | https://openalex.org/W2011810134, https://openalex.org/W2050497389, https://openalex.org/W1568976062, https://openalex.org/W2960025371, https://openalex.org/W2367625138, https://openalex.org/W2019537266, https://openalex.org/W2017649536, https://openalex.org/W1990067406, https://openalex.org/W2135709899, https://openalex.org/W2006096198 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.21203/rs.3.rs-750430/v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402450 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Research Square (Research Square) |
| best_oa_location.source.host_organization | https://openalex.org/I4210096694 |
| best_oa_location.source.host_organization_name | Research Square (United States) |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I4210096694 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.researchsquare.com/article/rs-750430/latest.pdf |
| best_oa_location.version | acceptedVersion |
| best_oa_location.raw_type | posted-content |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.21203/rs.3.rs-750430/v1 |
| primary_location.id | doi:10.21203/rs.3.rs-750430/v1 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306402450 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Research Square (Research Square) |
| primary_location.source.host_organization | https://openalex.org/I4210096694 |
| primary_location.source.host_organization_name | Research Square (United States) |
| primary_location.source.host_organization_lineage | https://openalex.org/I4210096694 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.researchsquare.com/article/rs-750430/latest.pdf |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | posted-content |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.21203/rs.3.rs-750430/v1 |
| publication_date | 2021-12-06 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W2803306286, https://openalex.org/W6625746039, https://openalex.org/W1997368401, https://openalex.org/W2166813211, https://openalex.org/W2042674002, https://openalex.org/W2976056797, https://openalex.org/W2136963152, https://openalex.org/W2884149332, https://openalex.org/W2278542412, https://openalex.org/W2061212893, https://openalex.org/W2084221840, https://openalex.org/W2093269603, https://openalex.org/W1997916674, https://openalex.org/W2749062520, https://openalex.org/W4230258726, https://openalex.org/W2055387365, https://openalex.org/W2169921235, https://openalex.org/W2073472559, https://openalex.org/W2804957066, https://openalex.org/W2407395752, https://openalex.org/W1969633638, https://openalex.org/W2037562003, https://openalex.org/W2431691126, https://openalex.org/W2804385314, https://openalex.org/W2080178832, https://openalex.org/W2165448109, https://openalex.org/W2602152739, https://openalex.org/W3010138084, https://openalex.org/W1978338991, https://openalex.org/W852111780, https://openalex.org/W2095219480, https://openalex.org/W2081380056, https://openalex.org/W2002053519, https://openalex.org/W2756654598, https://openalex.org/W2013847728, https://openalex.org/W2751054021, https://openalex.org/W3006255088, https://openalex.org/W1513354512, https://openalex.org/W3081126571, https://openalex.org/W6738041626, https://openalex.org/W2745690522, https://openalex.org/W1996966568, https://openalex.org/W2088568353, https://openalex.org/W1499832579, https://openalex.org/W2626880465, https://openalex.org/W2616814606, https://openalex.org/W985279961 |
| referenced_works_count | 47 |
| abstract_inverted_index.a | 6, 97 |
| abstract_inverted_index.In | 1 |
| abstract_inverted_index.We | 68 |
| abstract_inverted_index.an | 71 |
| abstract_inverted_index.as | 23, 90 |
| abstract_inverted_index.at | 87 |
| abstract_inverted_index.in | 13, 156 |
| abstract_inverted_index.is | 30, 93, 110 |
| abstract_inverted_index.of | 35, 84, 126 |
| abstract_inverted_index.on | 129 |
| abstract_inverted_index.to | 31, 52, 58, 61, 75, 103 |
| abstract_inverted_index.us | 51 |
| abstract_inverted_index.we | 4, 95 |
| abstract_inverted_index.The | 28 |
| abstract_inverted_index.and | 10, 38, 45, 81, 115 |
| abstract_inverted_index.can | 151 |
| abstract_inverted_index.due | 60 |
| abstract_inverted_index.for | 21 |
| abstract_inverted_index.its | 108 |
| abstract_inverted_index.our | 141 |
| abstract_inverted_index.per | 24 |
| abstract_inverted_index.sum | 34 |
| abstract_inverted_index.the | 33, 79, 85, 91, 120, 124, 131, 137, 146 |
| abstract_inverted_index.This | 48 |
| abstract_inverted_index.also | 143 |
| abstract_inverted_index.both | 78, 130 |
| abstract_inverted_index.cost | 127 |
| abstract_inverted_index.good | 153 |
| abstract_inverted_index.less | 157 |
| abstract_inverted_index.tend | 57 |
| abstract_inverted_index.that | 56, 145 |
| abstract_inverted_index.this | 2 |
| abstract_inverted_index.with | 17, 136 |
| abstract_inverted_index.along | 135 |
| abstract_inverted_index.arise | 59 |
| abstract_inverted_index.based | 100 |
| abstract_inverted_index.hand. | 88 |
| abstract_inverted_index.model | 77 |
| abstract_inverted_index.order | 63 |
| abstract_inverted_index.solve | 104 |
| abstract_inverted_index.study | 5, 53 |
| abstract_inverted_index.their | 25 |
| abstract_inverted_index.time. | 158 |
| abstract_inverted_index.using | 112 |
| abstract_inverted_index.which | 14 |
| abstract_inverted_index.while | 41 |
| abstract_inverted_index.across | 65 |
| abstract_inverted_index.allows | 50 |
| abstract_inverted_index.become | 19 |
| abstract_inverted_index.costs, | 40 |
| abstract_inverted_index.dates. | 27, 67 |
| abstract_inverted_index.method | 150 |
| abstract_inverted_index.orders | 16 |
| abstract_inverted_index.paper, | 3 |
| abstract_inverted_index.search | 99, 149 |
| abstract_inverted_index.loading | 9, 44, 82, 133 |
| abstract_inverted_index.optimal | 132, 138 |
| abstract_inverted_index.problem | 86, 92 |
| abstract_inverted_index.produce | 152 |
| abstract_inverted_index.propose | 70, 96 |
| abstract_inverted_index.quality | 154 |
| abstract_inverted_index.release | 26, 66 |
| abstract_inverted_index.routes. | 139 |
| abstract_inverted_index.routing | 11, 46, 80 |
| abstract_inverted_index.scatter | 98, 148 |
| abstract_inverted_index.suggest | 144 |
| abstract_inverted_index.thereby | 69 |
| abstract_inverted_index.various | 43, 54 |
| abstract_inverted_index.vehicle | 8 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.Further, | 107 |
| abstract_inverted_index.NP-hard, | 94 |
| abstract_inverted_index.approach | 102 |
| abstract_inverted_index.customer | 15 |
| abstract_inverted_index.dispatch | 22 |
| abstract_inverted_index.enhanced | 111 |
| abstract_inverted_index.minimize | 32 |
| abstract_inverted_index.problem, | 12 |
| abstract_inverted_index.proposed | 147 |
| abstract_inverted_index.scenario | 49 |
| abstract_inverted_index.temporal | 62 |
| abstract_inverted_index.available | 20 |
| abstract_inverted_index.deadlines | 18 |
| abstract_inverted_index.heuristic | 101 |
| abstract_inverted_index.influence | 125 |
| abstract_inverted_index.numerical | 121 |
| abstract_inverted_index.objective | 29 |
| abstract_inverted_index.solutions | 155 |
| abstract_inverted_index.strategic | 116 |
| abstract_inverted_index.tardiness | 39 |
| abstract_inverted_index.tradeoffs | 55 |
| abstract_inverted_index.illustrate | 123 |
| abstract_inverted_index.instances. | 106 |
| abstract_inverted_index.integrated | 72 |
| abstract_inverted_index.inventory, | 37 |
| abstract_inverted_index.large-size | 105 |
| abstract_inverted_index.procedures | 114 |
| abstract_inverted_index.respecting | 42 |
| abstract_inverted_index.structures | 128 |
| abstract_inverted_index.aggregation | 64 |
| abstract_inverted_index.approaches. | 118 |
| abstract_inverted_index.experiments | 122, 142 |
| abstract_inverted_index.formulation | 74 |
| abstract_inverted_index.oscillation | 117 |
| abstract_inverted_index.performance | 109 |
| abstract_inverted_index.Importantly, | 140 |
| abstract_inverted_index.constraints. | 47 |
| abstract_inverted_index.mathematical | 73 |
| abstract_inverted_index.requirements | 83 |
| abstract_inverted_index.Additionally, | 119 |
| abstract_inverted_index.Specifically, | 89 |
| abstract_inverted_index.configurations | 134 |
| abstract_inverted_index.simultaneously | 76 |
| abstract_inverted_index.transportation, | 36 |
| abstract_inverted_index.two-dimensional | 7 |
| abstract_inverted_index.problem-specific | 113 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.23919758 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |