Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
An overview of vehicle routing problems
The vehicle routing problem
Iterative combinatorial auctions: achieving economic and computational efficiency
Iterative combinatorial auctions: achieving economic and computational efficiency
A Cooperative Algorithm for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
SIAM Journal on Control and Optimization
| Hi-index | 0.00 |
In this paper, we present a strategyproof mechanism design to tackle the multi-depot vehicle routing problem in multi-agent setting. In a small-world network environment (any node is connected to every other node through a short path) wherein different self-interested agencies are controlling their own vehicle fleets, we use an innovative game theoretic approach to distribute products to customers without any central authority. The game is using a reverse Vickrey auction that takes place in several rounds until all customers are assigned. Payments are given to depots as incentive for fairness of serving cost offering. The procedure leads to overall near-optimal routing for serving all customers. We briefly describe the use of a heuristic approach to solve the game-based procedure in bounded time and memory. We also provide benchmarks for several known problem instances.