On the public citation graph
Dynamic Clustering for Multi- Depot Capacitated Vehicle Routing with Time Windows: A Cw Heuristic Approach
0 signed · 19 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s10732-014-9247-0openalex-extracted
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem
inferredcites →https://doi.org/10.1016/0305-0548(84)90007-8openalex-extracted
The fleet size and mix vehicle routing problem
inferredcites →https://doi.org/10.1016/j.apm.2012.09.027openalex-extracted
A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem
inferredcites →https://doi.org/10.1016/j.apm.2016.01.059openalex-extracted
Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
inferredcites →https://doi.org/10.1016/j.cie.2015.12.007openalex-extracted
The vehicle routing problem: State of the art classification and review
inferredcites →https://doi.org/10.1016/j.cor.2011.09.021openalex-extracted
A parallel iterated tabu search heuristic for vehicle routing problems
inferredcites →https://doi.org/10.1016/j.cor.2013.01.013openalex-extracted
A hybrid algorithm for a class of vehicle routing problems
inferredcites →https://doi.org/10.1016/j.ejor.2004.07.077openalex-extracted
A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
inferredcites →https://doi.org/10.1016/j.ejor.2013.12.044openalex-extracted
Implicit depot assignments and rotations in vehicle routing heuristics
inferredcites →https://doi.org/10.1016/j.jksues.2014.04.007openalex-extracted
A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet
inferredcites →https://doi.org/10.1016/j.tre.2013.03.010openalex-extracted
A hybrid population heuristic for the heterogeneous vehicle routing problems
inferredcites →https://doi.org/10.1016/j.tre.2013.05.005openalex-extracted
The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics
inferredcites →https://doi.org/10.1155/2013/874349openalex-extracted
A Heuristic Approach Based on Clarke‐Wright Algorithm for Open Vehicle Routing Problem
inferredcites →https://doi.org/10.1155/2021/2327504openalex-extracted
Multidepot Recycling Vehicle Routing Problem with Resource Sharing and Time Window Assignment
inferredcites →https://doi.org/10.1186/s41072-022-00108-7openalex-extracted
Industrial vehicle routing problem: a case study
inferredcites →https://doi.org/10.2306/scienceasia1513-1874.2012.38.307openalex-extracted
An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.24002/ijieem.v1i1.2292openalex-extracted
Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem
inferredcites →https://doi.org/10.3390/app112110295openalex-extracted
The Vehicle Routing Problem: State-of-the-Art Classification and Review
inferredcites →https://doi.org/10.7232/iems.2014.13.2.163openalex-extracted
A Hierarchical Hybrid Meta-Heuristic Approach to Coping with Large Practical Multi-Depot VRP
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.