Solving the Electric Share‐A‐Ride Problem Using a Hybrid Variable Neighborhood Search Algorithm Article Swipe
Vincent F. Yu
,
S. Hoang
,
Pham Tuan Anh
,
Cheng-Ta Yeh
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1155/atr/6687585
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1155/atr/6687585
This paper extends the share‐a‐ride problem (SARP) by incorporating electric vehicles (EVs) to reduce greenhouse gas (GHG) emissions, thus addressing environmental concerns. We introduce this new extension as the electric share‐a‐ride problem (E‐SARP). We aim to generate E‐SARP routing plans where EVs serve all passenger and parcel requests while visiting charging stations (CSs) as necessary for recharging. The objective is to maximize total profit from fulfilling passenger and parcel requests. We develop a mixed‐integer programming (MIP) model and propose a hybrid algorithm based on the variable neighborhood search (VNS) framework, integrated with a simulated annealing (SA) acceptance criterion (HVNS). The MIP model provides optimal solutions for small E‐SARP instances using the CPLEX solver, while the HVNS algorithm is designed to solve larger E‐SARP instances. Numerical experiments are conducted to assess the performance of the proposed HVNS and to provide managerial insights, demonstrating that the use of EVs can effectively address environmental concerns without significantly compromising the profitability of the transportation network.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1155/atr/6687585
- https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585
- OA Status
- gold
- References
- 39
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4409267555
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4409267555Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1155/atr/6687585Digital Object Identifier
- Title
-
Solving the Electric Share‐A‐Ride Problem Using a Hybrid Variable Neighborhood Search AlgorithmWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-01-01Full publication date if available
- Authors
-
Vincent F. Yu, S. Hoang, Pham Tuan Anh, Cheng-Ta YehList of authors in order
- Landing page
-
https://doi.org/10.1155/atr/6687585Publisher landing page
- PDF URL
-
https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585Direct OA link when available
- Concepts
-
Variable neighborhood search, Variable (mathematics), Computer science, Mathematical optimization, Algorithm, Metaheuristic, Mathematics, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
39Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4409267555 |
|---|---|
| doi | https://doi.org/10.1155/atr/6687585 |
| ids.doi | https://doi.org/10.1155/atr/6687585 |
| ids.openalex | https://openalex.org/W4409267555 |
| fwci | 0.0 |
| type | article |
| title | Solving the Electric Share‐A‐Ride Problem Using a Hybrid Variable Neighborhood Search Algorithm |
| awards[0].id | https://openalex.org/G5514941034 |
| awards[0].funder_id | https://openalex.org/F4320324515 |
| awards[0].display_name | |
| awards[0].funder_award_id | NTUST-PERFECTRON-08533 |
| awards[0].funder_display_name | National Taiwan University of Science and Technology |
| awards[1].id | https://openalex.org/G7063394515 |
| awards[1].funder_id | https://openalex.org/F4320324515 |
| awards[1].display_name | |
| awards[1].funder_award_id | NTUST-ITS-112-02 |
| awards[1].funder_display_name | National Taiwan University of Science and Technology |
| awards[2].id | https://openalex.org/G3139384891 |
| awards[2].funder_id | https://openalex.org/F4320324515 |
| awards[2].display_name | |
| awards[2].funder_award_id | TaiwanTech-FJCU-112-01 |
| awards[2].funder_display_name | National Taiwan University of Science and Technology |
| biblio.issue | 1 |
| biblio.volume | 2025 |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T11942 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2203 |
| topics[0].subfield.display_name | Automotive Engineering |
| topics[0].display_name | Transportation and Mobility Innovations |
| 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.9984999895095825 |
| 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/T12306 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9973999857902527 |
| 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 |
| funders[0].id | https://openalex.org/F4320311687 |
| funders[0].ror | https://ror.org/03m01yf64 |
| funders[0].display_name | Ministry of Education |
| funders[1].id | https://openalex.org/F4320324515 |
| funders[1].ror | https://ror.org/00q09pe49 |
| funders[1].display_name | National Taiwan University of Science and Technology |
| is_xpac | False |
| apc_list.value | 2400 |
| apc_list.currency | USD |
| apc_list.value_usd | 2400 |
| apc_paid.value | 2400 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 2400 |
| concepts[0].id | https://openalex.org/C2776435737 |
| concepts[0].level | 3 |
| concepts[0].score | 0.6513674259185791 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q7915703 |
| concepts[0].display_name | Variable neighborhood search |
| concepts[1].id | https://openalex.org/C182365436 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5687189698219299 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q50701 |
| concepts[1].display_name | Variable (mathematics) |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.47194141149520874 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.4676705598831177 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.42577964067459106 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C109718341 |
| concepts[5].level | 2 |
| concepts[5].score | 0.24423375725746155 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1385229 |
| concepts[5].display_name | Metaheuristic |
| concepts[6].id | https://openalex.org/C33923547 |
| concepts[6].level | 0 |
| concepts[6].score | 0.22609123587608337 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[6].display_name | Mathematics |
| concepts[7].id | https://openalex.org/C134306372 |
| concepts[7].level | 1 |
| concepts[7].score | 0.0 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[7].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/variable-neighborhood-search |
| keywords[0].score | 0.6513674259185791 |
| keywords[0].display_name | Variable neighborhood search |
| keywords[1].id | https://openalex.org/keywords/variable |
| keywords[1].score | 0.5687189698219299 |
| keywords[1].display_name | Variable (mathematics) |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.47194141149520874 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.4676705598831177 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.42577964067459106 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/metaheuristic |
| keywords[5].score | 0.24423375725746155 |
| keywords[5].display_name | Metaheuristic |
| keywords[6].id | https://openalex.org/keywords/mathematics |
| keywords[6].score | 0.22609123587608337 |
| keywords[6].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.1155/atr/6687585 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S75054922 |
| locations[0].source.issn | 0197-6729, 2042-3195 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 0197-6729 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Journal of Advanced Transportation |
| locations[0].source.host_organization | https://openalex.org/P4310319869 |
| locations[0].source.host_organization_name | Hindawi Publishing Corporation |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319869 |
| locations[0].source.host_organization_lineage_names | Hindawi Publishing Corporation |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585 |
| 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 | Journal of Advanced Transportation |
| locations[0].landing_page_url | https://doi.org/10.1155/atr/6687585 |
| locations[1].id | pmh:oai:doaj.org/article:a9c74c5e9c904547ba5df008cc33a3fe |
| locations[1].is_oa | False |
| 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 | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Journal of Advanced Transportation, Vol 2025 (2025) |
| locations[1].landing_page_url | https://doaj.org/article/a9c74c5e9c904547ba5df008cc33a3fe |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5000780003 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-8975-0606 |
| authorships[0].author.display_name | Vincent F. Yu |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Vincent F. Yu |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5020216430 |
| authorships[1].author.orcid | https://orcid.org/0009-0005-2784-3491 |
| authorships[1].author.display_name | S. Hoang |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Sy Hoang Do |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5075596384 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Pham Tuan Anh |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Pham Tuan Anh |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5064349187 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-1916-6564 |
| authorships[3].author.display_name | Cheng-Ta Yeh |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Cheng-Ta Yeh |
| authorships[3].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Solving the Electric Share‐A‐Ride Problem Using a Hybrid Variable Neighborhood Search Algorithm |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11942 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2203 |
| primary_topic.subfield.display_name | Automotive Engineering |
| primary_topic.display_name | Transportation and Mobility Innovations |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2899084033, https://openalex.org/W2748952813, https://openalex.org/W2051487156, https://openalex.org/W2073681303, https://openalex.org/W2390279801, https://openalex.org/W4391913857, https://openalex.org/W2358668433, https://openalex.org/W4396701345, https://openalex.org/W4312548090 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1155/atr/6687585 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S75054922 |
| best_oa_location.source.issn | 0197-6729, 2042-3195 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 0197-6729 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Journal of Advanced Transportation |
| best_oa_location.source.host_organization | https://openalex.org/P4310319869 |
| best_oa_location.source.host_organization_name | Hindawi Publishing Corporation |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319869 |
| best_oa_location.source.host_organization_lineage_names | Hindawi Publishing Corporation |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585 |
| 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 | Journal of Advanced Transportation |
| best_oa_location.landing_page_url | https://doi.org/10.1155/atr/6687585 |
| primary_location.id | doi:10.1155/atr/6687585 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S75054922 |
| primary_location.source.issn | 0197-6729, 2042-3195 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 0197-6729 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Journal of Advanced Transportation |
| primary_location.source.host_organization | https://openalex.org/P4310319869 |
| primary_location.source.host_organization_name | Hindawi Publishing Corporation |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319869 |
| primary_location.source.host_organization_lineage_names | Hindawi Publishing Corporation |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://onlinelibrary.wiley.com/doi/pdfdirect/10.1155/atr/6687585 |
| 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 | Journal of Advanced Transportation |
| primary_location.landing_page_url | https://doi.org/10.1155/atr/6687585 |
| publication_date | 2025-01-01 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W2793402918, https://openalex.org/W3153704001, https://openalex.org/W4323358440, https://openalex.org/W2555940907, https://openalex.org/W2017383000, https://openalex.org/W1972731897, https://openalex.org/W2887488222, https://openalex.org/W2883440163, https://openalex.org/W2163599294, https://openalex.org/W2982632554, https://openalex.org/W4385812287, https://openalex.org/W1429802841, https://openalex.org/W2094764575, https://openalex.org/W2755898715, https://openalex.org/W2594043797, https://openalex.org/W2778252806, https://openalex.org/W2914792944, https://openalex.org/W2593704234, https://openalex.org/W3214441119, https://openalex.org/W2898596225, https://openalex.org/W3048259214, https://openalex.org/W3035109483, https://openalex.org/W1533441792, https://openalex.org/W2278628796, https://openalex.org/W2794430075, https://openalex.org/W4383163150, https://openalex.org/W3185809659, https://openalex.org/W4406136147, https://openalex.org/W3132226009, https://openalex.org/W4392204059, https://openalex.org/W2808762737, https://openalex.org/W4225134844, https://openalex.org/W2092325930, https://openalex.org/W3198542923, https://openalex.org/W2073292534, https://openalex.org/W1986254541, https://openalex.org/W2921638490, https://openalex.org/W3202424131, https://openalex.org/W1605811590 |
| referenced_works_count | 39 |
| abstract_inverted_index.a | 72, 79, 92 |
| abstract_inverted_index.We | 22, 33, 70 |
| abstract_inverted_index.as | 27, 53 |
| abstract_inverted_index.by | 7 |
| abstract_inverted_index.is | 59, 117 |
| abstract_inverted_index.of | 132, 145, 157 |
| abstract_inverted_index.on | 83 |
| abstract_inverted_index.to | 12, 35, 60, 119, 128, 137 |
| abstract_inverted_index.EVs | 41, 146 |
| abstract_inverted_index.MIP | 100 |
| abstract_inverted_index.The | 57, 99 |
| abstract_inverted_index.aim | 34 |
| abstract_inverted_index.all | 43 |
| abstract_inverted_index.and | 45, 67, 77, 136 |
| abstract_inverted_index.are | 126 |
| abstract_inverted_index.can | 147 |
| abstract_inverted_index.for | 55, 105 |
| abstract_inverted_index.gas | 15 |
| abstract_inverted_index.new | 25 |
| abstract_inverted_index.the | 3, 28, 84, 110, 114, 130, 133, 143, 155, 158 |
| abstract_inverted_index.use | 144 |
| abstract_inverted_index.(SA) | 95 |
| abstract_inverted_index.HVNS | 115, 135 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.from | 64 |
| abstract_inverted_index.that | 142 |
| abstract_inverted_index.this | 24 |
| abstract_inverted_index.thus | 18 |
| abstract_inverted_index.with | 91 |
| abstract_inverted_index.(CSs) | 52 |
| abstract_inverted_index.(EVs) | 11 |
| abstract_inverted_index.(GHG) | 16 |
| abstract_inverted_index.(MIP) | 75 |
| abstract_inverted_index.(VNS) | 88 |
| abstract_inverted_index.CPLEX | 111 |
| abstract_inverted_index.based | 82 |
| abstract_inverted_index.model | 76, 101 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.plans | 39 |
| abstract_inverted_index.serve | 42 |
| abstract_inverted_index.small | 106 |
| abstract_inverted_index.solve | 120 |
| abstract_inverted_index.total | 62 |
| abstract_inverted_index.using | 109 |
| abstract_inverted_index.where | 40 |
| abstract_inverted_index.while | 48, 113 |
| abstract_inverted_index.(SARP) | 6 |
| abstract_inverted_index.assess | 129 |
| abstract_inverted_index.hybrid | 80 |
| abstract_inverted_index.larger | 121 |
| abstract_inverted_index.parcel | 46, 68 |
| abstract_inverted_index.profit | 63 |
| abstract_inverted_index.reduce | 13 |
| abstract_inverted_index.search | 87 |
| abstract_inverted_index.(HVNS). | 98 |
| abstract_inverted_index.address | 149 |
| abstract_inverted_index.develop | 71 |
| abstract_inverted_index.extends | 2 |
| abstract_inverted_index.optimal | 103 |
| abstract_inverted_index.problem | 5, 31 |
| abstract_inverted_index.propose | 78 |
| abstract_inverted_index.provide | 138 |
| abstract_inverted_index.routing | 38 |
| abstract_inverted_index.solver, | 112 |
| abstract_inverted_index.without | 152 |
| abstract_inverted_index.E‐SARP | 37, 107, 122 |
| abstract_inverted_index.charging | 50 |
| abstract_inverted_index.concerns | 151 |
| abstract_inverted_index.designed | 118 |
| abstract_inverted_index.electric | 9, 29 |
| abstract_inverted_index.generate | 36 |
| abstract_inverted_index.maximize | 61 |
| abstract_inverted_index.network. | 160 |
| abstract_inverted_index.proposed | 134 |
| abstract_inverted_index.provides | 102 |
| abstract_inverted_index.requests | 47 |
| abstract_inverted_index.stations | 51 |
| abstract_inverted_index.variable | 85 |
| abstract_inverted_index.vehicles | 10 |
| abstract_inverted_index.visiting | 49 |
| abstract_inverted_index.Numerical | 124 |
| abstract_inverted_index.algorithm | 81, 116 |
| abstract_inverted_index.annealing | 94 |
| abstract_inverted_index.concerns. | 21 |
| abstract_inverted_index.conducted | 127 |
| abstract_inverted_index.criterion | 97 |
| abstract_inverted_index.extension | 26 |
| abstract_inverted_index.insights, | 140 |
| abstract_inverted_index.instances | 108 |
| abstract_inverted_index.introduce | 23 |
| abstract_inverted_index.necessary | 54 |
| abstract_inverted_index.objective | 58 |
| abstract_inverted_index.passenger | 44, 66 |
| abstract_inverted_index.requests. | 69 |
| abstract_inverted_index.simulated | 93 |
| abstract_inverted_index.solutions | 104 |
| abstract_inverted_index.acceptance | 96 |
| abstract_inverted_index.addressing | 19 |
| abstract_inverted_index.emissions, | 17 |
| abstract_inverted_index.framework, | 89 |
| abstract_inverted_index.fulfilling | 65 |
| abstract_inverted_index.greenhouse | 14 |
| abstract_inverted_index.instances. | 123 |
| abstract_inverted_index.integrated | 90 |
| abstract_inverted_index.managerial | 139 |
| abstract_inverted_index.(E‐SARP). | 32 |
| abstract_inverted_index.effectively | 148 |
| abstract_inverted_index.experiments | 125 |
| abstract_inverted_index.performance | 131 |
| abstract_inverted_index.programming | 74 |
| abstract_inverted_index.recharging. | 56 |
| abstract_inverted_index.compromising | 154 |
| abstract_inverted_index.neighborhood | 86 |
| abstract_inverted_index.demonstrating | 141 |
| abstract_inverted_index.environmental | 20, 150 |
| abstract_inverted_index.incorporating | 8 |
| abstract_inverted_index.profitability | 156 |
| abstract_inverted_index.significantly | 153 |
| abstract_inverted_index.transportation | 159 |
| abstract_inverted_index.mixed‐integer | 73 |
| abstract_inverted_index.share‐a‐ride | 4, 30 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.12249542 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |