On the public citation graph

An Nadmm_Vns for Electric Vehicle Routing Problem with Time Windows and Recharging Station

https://doi.org/10.2139/ssrn.4581247
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-07124-4_9openalex-extracted
Variable Neighborhood Descent
inferredcites →https://doi.org/10.1007/s13676-018-0136-9openalex-extracted
Electric vehicle routing problem with time windows, recharging stations and battery swapping stations
inferredcites →https://doi.org/10.1016/j.asoc.2022.109964openalex-extracted
Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectives
inferredcites →https://doi.org/10.1016/j.asoc.2023.110025openalex-extracted
A diversity-enhanced memetic algorithm for solving electric vehicle routing problems with time windows and mixed backhauls
inferredcites →https://doi.org/10.1016/j.cam.2021.113681openalex-extracted
An extended proximal ADMM algorithm for three-block nonconvex optimization problems
inferredcites →https://doi.org/10.1016/j.cie.2022.108509openalex-extracted
A Lagrangian relaxation approach based on a time-space-state network for railway crew scheduling
inferredcites →https://doi.org/10.1016/j.cor.2019.02.014openalex-extracted
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations
inferredcites →https://doi.org/10.1016/j.cor.2021.105269openalex-extracted
An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
inferredcites →https://doi.org/10.1016/j.cor.2022.105870openalex-extracted
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations
inferredcites →https://doi.org/10.1016/j.ejor.2016.01.038openalex-extracted
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
inferredcites →https://doi.org/10.1016/j.eswa.2021.114804openalex-extracted
Optimizing electric vehicle routing problems with mixed backhauls and recharging strategies in multi-dimensional representation network
inferredcites →https://doi.org/10.1016/j.eswa.2022.117292openalex-extracted
Formulation and exact algorithms for electric vehicle production routing problem
inferredcites →https://doi.org/10.1016/j.eswa.2023.119654openalex-extracted
Collaborative multidepot electric vehicle routing problem with time windows and shared charging stations
inferredcites →https://doi.org/10.1016/j.eswa.2023.119801openalex-extracted
Charging station location problem for maximizing the space-time-electricity accessibility: A Lagrangian relaxation-based decomposition scheme
inferredcites →https://doi.org/10.1016/j.ijpe.2018.07.016openalex-extracted
Electric vehicle routing problem with recharging stations for minimizing energy consumption
inferredcites →https://doi.org/10.1016/j.jclepro.2020.120590openalex-extracted
Collaborative two-echelon multicenter vehicle routing optimization based on state–space–time network representation
inferredcites →https://doi.org/10.1016/j.trb.2013.10.012openalex-extracted
Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem
inferredcites →https://doi.org/10.1016/j.trb.2016.03.009openalex-extracted
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
inferredcites →https://doi.org/10.1016/j.trb.2017.01.002openalex-extracted
Joint optimization of high-speed train timetables and speed profiles: A unified modeling approach using space-time-speed grid networks
inferredcites →https://doi.org/10.1016/j.trb.2017.02.004openalex-extracted
The electric vehicle routing problem with nonlinear charging function
inferredcites →https://doi.org/10.1016/j.trb.2019.08.006openalex-extracted
Optimization models for electric vehicle service operations: A literature review
inferredcites →https://doi.org/10.1016/j.trb.2019.09.009openalex-extracted
ADMM-based problem decomposition scheme for vehicle routing problem with time windows
inferredcites →https://doi.org/10.1016/j.trb.2019.09.015openalex-extracted
A cumulative service state representation for the pickup and delivery problem with transfers
inferredcites →https://doi.org/10.1016/j.trb.2020.12.007openalex-extracted
Electric vehicle routing problem with machine learning for energy prediction
inferredcites →https://doi.org/10.1016/j.trc.2021.103285openalex-extracted
Electric vehicle routing with charging/discharging under time-variant electricity prices
inferredcites →https://doi.org/10.1016/j.tre.2020.101891openalex-extracted
Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows
inferredcites →https://doi.org/10.1016/j.trpro.2022.02.017openalex-extracted
Decomposition of the vehicle routing problem with time windows on the time dimension
inferredcites →https://doi.org/10.1287/opre.2016.1535openalex-extracted
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
inferredcites →https://doi.org/10.1287/trsc.2013.0490openalex-extracted
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
inferredcites →https://doi.org/10.48550/arxiv.1507.02731openalex-extracted
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.