Parallelization of a gossip algorithm for vehicle routing problems
Paper i proceeding, 2018

A large body of research on the vehicle routing problem and its variants focuses on developing efficient solution procedures. Yet, not so many research articles have addressed parallelism in their proposed algorithms. Parallelized optimization algorithms can yield better solution quality in less amount of time. The main contribution of this paper is parallelization of a distributed algorithm based on the gossip protocol for vehicle routing problems VRP. The proposed algorithm can be applied to different variants of VRPs. While the resulting speed-ups are promising, the required effort for implementation of the parallelism is minimal, which makes the algorithm even more appealing.

Författare

Sarmad Riazi

Chalmers, Elektroteknik, System- och reglerteknik, Automation

Kristofer Bengtsson

Chalmers, Elektroteknik, System- och reglerteknik, Automation

Bengt Lennartson

Chalmers, Elektroteknik, System- och reglerteknik

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

Vol. 2018-August 92-97 8560548

14th IEEE International Conference on Automation Science and Engineering, CASE 2018
Munich, Germany,

Ämneskategorier

Datorteknik

Beräkningsmatematik

Datavetenskap (datalogi)

DOI

10.1109/COASE.2018.8560548

Mer information

Senast uppdaterat

2019-04-08