FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4284682302> ?p ?o ?g. }

• W4284682302 endingPage "103781" @default.
• W4284682302 startingPage "103781" @default.
• W4284682302 abstract "• Analyze the connection and difference between for the network-based and metanetwork-based approaches for the optimal en-route charging station location problem. • Introduce subpaths and station-subpath metanetworks for modeling en-route charging station location problems; • Establish the solution equivalence between the proposed node-link network-based model and station-subpath metanetwork-based model; • Prove analytically the network cost monotonicity property with charging station addition, budget limit increase and distance limit increase; • Justify numerically the metanetwork-based algorithm outperforming the network-based algorithm in the branch-and-bound framework; and. • Reveal the impacts of budget limit and distance limit on individual route-and-charge choice and network performance and accessibility. In many regions across the world, the distribution density of electricity-charging stations is yet sufficient for taming the range anxiety concern of electric vehicle drivers. In such driving circumstances, making detours to find alternative charging opportunities is often an operational remedy to accomplish long-distance trips. To reduce the frequency and extra mileage of detouring, public charging infrastructures should be coordinately sited and constructed in a regional network. With the goal of minimizing the possible detour mileage, this paper describes an optimal charging station location problem for intercity highway networks and develops two approaches for modeling and solving it. Specifically, two mixed linear integer programming models are constructed in different network modeling paradigms: The first one is formed and solved on the basis of the original node-link network topology , with newly introduced integer variables such as path and subpath activation indicators to quantify the utilization status of paths and subpaths, respectively. The classic branch-and-bound algorithm encapsulating a bi-criteria label-correcting algorithm is designed for solving this network-based model. The other one is formulated and solved relying on the station-subpath metanetwork topology , as the result of a two-phase process that decomposes an individual routing and charging decision into two parts. The two phases are conducted on the node-link network and station-subpath metanetwork levels, respectively, where the first phase is done by solving a network-based, distance-constrained minimum-cost path problem, while the second phase collapses to a metanetwork-based, simple minimum-cost path problem. The findings we obtained through conducting this research are twofold: First, analytical and computational studies clearly identify the effectiveness of the two modeling and solution approaches, while the metanetwork-based approach exhibits its appealing computing advantage for solving problems of large size; second, the application of the solution approaches for a real-world network instance reveals how budget limit and distance limit impact the charging station locations, individual routing and charging decisions, and network cost and accessibility levels." @default.
• W4284682302 created "2022-07-08" @default.
• W4284682302 creator A5001763467 @default.
• W4284682302 creator A5029865340 @default.
• W4284682302 creator A5047273081 @default.
• W4284682302 date "2022-09-01" @default.
• W4284682302 modified "2023-10-15" @default.
• W4284682302 title "Optimal en-route charging station locations for electric vehicles: A new modeling perspective and a comparative evaluation of network-based and metanetwork-based approaches" @default.
• W4284682302 cites W1181333096 @default.
• W4284682302 cites W1577151555 @default.
• W4284682302 cites W1917213560 @default.
• W4284682302 cites W1967169403 @default.
• W4284682302 cites W1977270385 @default.
• W4284682302 cites W1985592761 @default.
• W4284682302 cites W1997086230 @default.
• W4284682302 cites W2000525593 @default.
• W4284682302 cites W2010619023 @default.
• W4284682302 cites W2033735555 @default.
• W4284682302 cites W2038618872 @default.
• W4284682302 cites W2052212463 @default.
• W4284682302 cites W2054701121 @default.
• W4284682302 cites W2055093681 @default.
• W4284682302 cites W2056517083 @default.
• W4284682302 cites W2057679339 @default.
• W4284682302 cites W2068113337 @default.
• W4284682302 cites W2086988686 @default.
• W4284682302 cites W2092863752 @default.
• W4284682302 cites W2099466544 @default.
• W4284682302 cites W2105498340 @default.
• W4284682302 cites W2121035759 @default.
• W4284682302 cites W2130837404 @default.
• W4284682302 cites W2131056927 @default.
• W4284682302 cites W2169528473 @default.
• W4284682302 cites W2260811999 @default.
• W4284682302 cites W2356554371 @default.
• W4284682302 cites W2523304766 @default.
• W4284682302 cites W2596621143 @default.
• W4284682302 cites W2612264206 @default.
• W4284682302 cites W2624450453 @default.
• W4284682302 cites W2780245673 @default.
• W4284682302 cites W2796115156 @default.
• W4284682302 cites W2870634601 @default.
• W4284682302 cites W2896621933 @default.
• W4284682302 cites W2898826313 @default.
• W4284682302 cites W2949855124 @default.
• W4284682302 cites W2952378113 @default.
• W4284682302 cites W2967692496 @default.
• W4284682302 cites W3014232922 @default.
• W4284682302 cites W3036306052 @default.
• W4284682302 cites W3111139202 @default.
• W4284682302 cites W3198468073 @default.
• W4284682302 cites W3209995911 @default.
• W4284682302 cites W3213745360 @default.
• W4284682302 cites W339885383 @default.
• W4284682302 cites W4240374930 @default.
• W4284682302 cites W4244380456 @default.
• W4284682302 doi "https://doi.org/10.1016/j.trc.2022.103781" @default.
• W4284682302 hasPublicationYear "2022" @default.
• W4284682302 type Work @default.
• W4284682302 citedByCount "7" @default.
• W4284682302 countsByYear W42846823022022 @default.
• W4284682302 countsByYear W42846823022023 @default.
• W4284682302 crossrefType "journal-article" @default.
• W4284682302 hasAuthorship W4284682302A5001763467 @default.
• W4284682302 hasAuthorship W4284682302A5029865340 @default.
• W4284682302 hasAuthorship W4284682302A5047273081 @default.
• W4284682302 hasConcept C121332964 @default.
• W4284682302 hasConcept C12713177 @default.
• W4284682302 hasConcept C127413603 @default.
• W4284682302 hasConcept C154945302 @default.
• W4284682302 hasConcept C163258240 @default.
• W4284682302 hasConcept C22212356 @default.
• W4284682302 hasConcept C2776422217 @default.
• W4284682302 hasConcept C2779607880 @default.
• W4284682302 hasConcept C41008148 @default.
• W4284682302 hasConcept C42475967 @default.
• W4284682302 hasConcept C62520636 @default.
• W4284682302 hasConceptScore W4284682302C121332964 @default.
• W4284682302 hasConceptScore W4284682302C12713177 @default.
• W4284682302 hasConceptScore W4284682302C127413603 @default.
• W4284682302 hasConceptScore W4284682302C154945302 @default.
• W4284682302 hasConceptScore W4284682302C163258240 @default.
• W4284682302 hasConceptScore W4284682302C22212356 @default.
• W4284682302 hasConceptScore W4284682302C2776422217 @default.
• W4284682302 hasConceptScore W4284682302C2779607880 @default.
• W4284682302 hasConceptScore W4284682302C41008148 @default.
• W4284682302 hasConceptScore W4284682302C42475967 @default.
• W4284682302 hasConceptScore W4284682302C62520636 @default.
• W4284682302 hasFunder F4320321001 @default.
• W4284682302 hasFunder F4320321878 @default.
• W4284682302 hasFunder F4320335787 @default.
• W4284682302 hasLocation W42846823021 @default.
• W4284682302 hasOpenAccess W4284682302 @default.
• W4284682302 hasPrimaryLocation W42846823021 @default.
• W4284682302 hasRelatedWork W2084958424 @default.
• W4284682302 hasRelatedWork W2141580612 @default.
• W4284682302 hasRelatedWork W2156399915 @default.
• W4284682302 hasRelatedWork W2362149433 @default.

• next