Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by K.K. Lau Articles by M.J. Kumar Articles by N.R. Achuthan

1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)

Taipei, Taiwan

December 18-December 20

ISBN: 0-8186-8259-0

	ASCII Text	x
	K.K. Lau, M.J. Kumar, N.R. Achuthan, "Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 247, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997.

	BibTex	x
	@article{ 10.1109/ISPAN.1997.645104, author = {K.K. Lau and M.J. Kumar and N.R. Achuthan}, title = {Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1997}, issn = {1087-4089}, pages = {247}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645104}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs SN - 1087-4089 SP EP A1 - K.K. Lau, A1 - M.J. Kumar, A1 - N.R. Achuthan, PY - 1997 KW - 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 VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

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

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645104

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:

K.K. Lau, M.J. Kumar, N.R. Achuthan, "Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs," ispan, pp.247, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.