A Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems
نویسندگان
چکیده
منابع مشابه
A Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems
In this paper we address the heterogeneous multi-vehicle routing problem by proposing a distributed algorithm based on gossip. We consider the case where a set of tasks arbitrarily distributed in a plane, each with a service cost, have to be served by a set of mobile robots, each with a given movement speed and task execution speed. Our goal is to minimize the maximum execution time of robots.
متن کاملGossip Algorithms for Heterogeneous Multi-Vehicle Routing Problems
In this paper we address a class of heterogeneous multi-vehicle task assignment and routing problem. We propose two distributed algorithms based on gossip communication: the first algorithm is based on a local exact optimization and the second is based on a local approximate greedy heuristic. We consider the case where a set of heterogeneous tasks arbitrarily distributed in a plane has to be se...
متن کاملA Gossip Based Heuristic Algorithm for Heterogeneous Multi-Vehicle Routing Problems
In this paper we propose a novel algorithm based on gossip to solve the Heterogeneous Multi-Vehicle Routing (HMVR) problem. A set of tasks is arbitrarily placed in a plane and a set of robots has to cooperate to minimize the maximum time required to visit and execute all tasks. Each task and each robot has different cost/speed. The proposed algorithm exploits only pairwise asynchronous communic...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2012
ISSN: 1474-6670
DOI: 10.3182/20120606-3-nl-3011.00071