The Community for Technology Leaders
Parallel Architectures, Algorithms, and Networks, International Symposium on (1997)
Taipei, Taiwan
Dec. 18, 1997 to Dec. 20, 1997
ISSN: 1087-4089
ISBN: 0-8186-8259-0
pp: 247
K.K. Lau , Dept. of Comput. Sci., Curtin Univ. of Technol., Perth, WA, Australia
M.J. Kumar , Dept. of Comput. Sci., Curtin Univ. of Technol., Perth, WA, Australia
N.R. Achuthan , Dept. of Comput. Sci., Curtin Univ. of Technol., Perth, WA, Australia
ABSTRACT
This paper proposes a parallel branch and bound algorithm designed for solving the Vehicle Routing Problem (VRP) on NOWs (Networks of Workstations). Our objective is to minimize the execution time by considering parallel implementation to find an exact solution to the VRP in real time. Our experimental studies reveal that the proposed parallel branch and bound algorithm can achieve super-linear speedup for large problem sizes. Dynamic load balancing techniques for solving the VRP on NOWs are also discussed.
INDEX TERMS
operations research; branch and bound algorithm; vehicle routing problem; Networks of Workstations; parallel branch and bound; super-linear speedup; load balancing; VRP; real time; operational research; optimisation
CITATION

N. Achuthan, K. Lau and M. Kumar, "Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Taipei, Taiwan, 1997, pp. 247.
doi:10.1109/ISPAN.1997.645104
95 ms
(Ver 3.3 (11022016))