Gossip algorithms for heterogeneous multi-vehicle routing problems
From MaRDI portal
Publication:2252974
DOI10.1016/j.nahs.2013.03.001zbMath1342.90035OpenAlexW2070585337MaRDI QIDQ2252974
Daniele Rosa, Mauro Franceschelli, Carla Seatzu, Bullo, Francesco
Publication date: 24 July 2014
Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.nahs.2013.03.001
Mixed integer programming (90C11) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Decentralized systems (93A14)
Related Items
Thirty years of heterogeneous vehicle routing ⋮ Path planning for robotic teams based on LTL specifications and Petri net models ⋮ Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks ⋮ Fast discrete consensus based on gossip for makespan minimization in networked systems ⋮ Dissipative consensus for two-time-scale semi-Markov jump multi-agent systems against false data injection attacks via a dynamic event-triggered scheme
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general heuristic for vehicle routing problems
- The traveling salesman problem: An overview of exact and approximate algorithms
- The vehicle routing problem: An overview of exact and approximate algorithms
- The traveling salesman problem and its variations
- Communication constraints in the average consensus problem
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Solution of a Min-Max Vehicle Routing Problem
- Gossip Coverage Control for Robotic Networks: Dynamical Systems on the Space of Partitions
- The shortest path and the shortest road through n points
- A guide to vehicle routing heuristics
- How Long Can a Euclidean Traveling Salesman Tour Be?
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
- Approximations for minimum and min-max vehicle routing problems