On the public citation graph

Solving Stochastic and Dynamic Capacitated Vehicle Routing Problem Utilization Advisory Board Reinforcement Learning

https://doi.org/10.2139/ssrn.5073354
0 signed · 22 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.1002/net.3230110209openalex-snapshot
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_1openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1016/j.cie.2023.109164openalex-snapshot
Solution approaches for the bi-objective Skiving Stock Problem
inferredcites →https://doi.org/10.1016/j.ejor.2011.07.037openalex-snapshot
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
inferredcites →https://doi.org/10.1016/j.ejtl.2023.100105openalex-snapshot
Deep reinforcement learning for stochastic last-mile delivery with crowdshipping
inferredcites →https://doi.org/10.1016/j.jocs.2019.04.003openalex-snapshot
Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: Modelling and solution
inferredcites →https://doi.org/10.1016/j.orl.2006.12.009openalex-snapshot
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
inferredcites →https://doi.org/10.1016/j.procs.2020.10.043openalex-snapshot
Ubiquitous Distributed Deep Reinforcement Learning at the Edge: Analyzing Byzantine Agents in Discrete Action Spaces
inferredcites →https://doi.org/10.1109/access.2021.3074535openalex-snapshot
Deep Deterministic Policy Gradient Based on Double Network Prioritized Experience Replay
inferredcites →https://doi.org/10.1109/ijcnn48605.2020.9207026openalex-snapshot
Deep Reinforcement Learning for Traveling Salesman Problem with Time Windows and Rejections
inferredcites →https://doi.org/10.1109/tnnls.2021.3068828openalex-snapshot
Learning Improvement Heuristics for Solving Routing Problems
inferredcites →https://doi.org/10.1111/j.1475-3995.2000.tb00200.xopenalex-snapshot
Classical and modern heuristics for the vehicle routing problem
inferredcites →https://doi.org/10.1155/2023/9918022openalex-snapshot
A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process
inferredcites →https://doi.org/10.1287/opre.1040.0111openalex-snapshot
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
inferredcites →https://doi.org/10.1287/opre.1120.1048openalex-snapshot
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
inferredcites →https://doi.org/10.1287/opre.2.4.393openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.42.5.846openalex-snapshot
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
inferredcites →https://doi.org/10.14257/ijsip.2016.9.10.31openalex-snapshot
An Improved Ant Colony Optimization for VRP with Time Windows
inferredcites →https://doi.org/10.15514/ispras-2019-31(3)-12openalex-snapshot
Constructive heuristics for Capacitated Vehicle Routing Problem: a comparative study
inferredcites →https://doi.org/10.17977/um018v5i22022p109-121openalex-snapshot
Hybrid Artificial Bee Colony and Improved SimulatedAnnealing for the Capacitated Vehicle Routing Problem
inferredcites →https://doi.org/10.2139/ssrn.4133323openalex-snapshot
Solution Approaches for the Bi-Objective Skiving Stock Problem
inferredcites →https://doi.org/10.48550/arxiv.2402.09765openalex-snapshot
Reinforcement Learning for Solving Stochastic Vehicle Routing Problem with Time Windows
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.