On the public citation graph

Decentralized Message Passing Algorithm for Heterogeneous Multi-Depot Vehicle Routing Problems

0 signed · 33 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/s12351-020-00600-7openalex-extracted

Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification

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.cie.2015.12.007openalex-extracted

The vehicle routing problem: State of the art classification and review

inferredcites →https://doi.org/10.1016/j.cie.2021.107604openalex-extracted

Recent dynamic vehicle routing problems: A survey

inferredcites →https://doi.org/10.1016/j.cor.2005.08.002openalex-extracted

A column generation approach to the heterogeneous fleet vehicle routing problem

inferredcites →https://doi.org/10.1016/j.cor.2005.10.015openalex-extracted

A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

inferredcites →https://doi.org/10.1016/j.cor.2013.05.011openalex-extracted

The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation

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.eswa.2016.01.038openalex-extracted

A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery

inferredcites →https://doi.org/10.1016/j.eswa.2023.121631openalex-extracted

A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks

inferredcites →https://doi.org/10.1016/j.trb.2022.03.004openalex-extracted

Heterogeneous multi-depot collaborative vehicle routing problem

inferredcites →https://doi.org/10.1016/s0377-2217(96)00253-6openalex-extracted

A multi-level composite heuristic for the multi-depot vehicle fleet mix problem

inferredcites →https://doi.org/10.1016/s0377-2217(99)00284-2openalex-extracted

An effective implementation of the Lin–Kernighan traveling salesman heuristic

inferredcites →https://doi.org/10.1051/ro:1999101openalex-extracted

A heuristic column generation method for the heterogeneous fleet VRP

inferredcites →https://doi.org/10.1057/palgrave.jors.2601344openalex-extracted

Tabu search variants for the mix fleet vehicle routing problem

inferredcites →https://doi.org/10.1057/palgrave.jors.2601443openalex-extracted

A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem

inferredcites →https://doi.org/10.1080/03155986.1993.11732212openalex-extracted

An Efficient Transformation Of The Generalized Traveling Salesman Problem

inferredcites →https://doi.org/10.1103/physreve.76.041124openalex-extracted

Statistical mechanics of the hitting set problem

inferredcites →https://doi.org/10.1108/03684920710743466openalex-extracted

Pattern Recognition and Machine Learning

inferredcites →https://doi.org/10.1109/cse.2011.106openalex-extracted

A Parallel Genetic Algorithm with GPU Accelerated for Large-scale MDVRP in Emergency Logistics

inferredcites →https://doi.org/10.1109/ical.2010.5585318openalex-extracted

Facility locations revisited: An efficient belief propagation approach

inferredcites →https://doi.org/10.1109/ical.2011.6024686openalex-extracted

A decentralized heuristic for multi-depot split-delivery vehicle routing problem

inferredcites →https://doi.org/10.1109/tit.2007.915695openalex-extracted

Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality

inferredcites →https://doi.org/10.1109/tit.2009.2030448openalex-extracted

Message Passing for Maximum Weight Independent Set

inferredcites →https://doi.org/10.1111/j.2517-6161.1974.tb00999.xopenalex-extracted

Spatial Interaction and the Statistical Analysis of Lattice Systems

inferredcites →https://doi.org/10.1145/2245276.2245419openalex-extracted

Mechanism design for decentralized vehicle routing problem

inferredcites →https://doi.org/10.1287/mnsc.6.1.80openalex-extracted

The Truck Dispatching Problem

inferredcites →https://doi.org/10.1287/opre.1110.1025openalex-extracted

Belief Propagation for Min-Cost Network Flow: Convergence and Correctness

inferredcites →https://doi.org/10.1287/trsc.1030.0046openalex-extracted

Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

inferredcites →https://doi.org/10.1287/trsc.22.3.161openalex-extracted

Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems

inferredcites →https://doi.org/10.3138/infor.51.1.31openalex-extracted

Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles

inferredcites →https://doi.org/10.5267/j.ijiec.2017.11.005openalex-extracted

A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.orp.2025.100360openalex-snapshot

Recursive delivery multiple flying sidekicks traveling salesman problem: An enlightenment of the Covid-19 pandemic

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.