Application of tabu search algorithm for vehicle routing problem

Pao Yue-kong Library Electronic Theses Database

Application of tabu search algorithm for vehicle routing problem

 

Author: Lai, Chung-hei
Title: Application of tabu search algorithm for vehicle routing problem
Degree: M.Sc.
Year: 2000
Subject: Transportation, Automotive
Operations research
Hong Kong Polytechnic University -- Dissertations
Department: Multi-disciplinary Studies
Dept. of Applied Mathematics
Pages: iii, 37, 72 leaaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1540663
URI: http://theses.lib.polyu.edu.hk/handle/200/5233
Abstract: This paper deals with the design of a heuristic algorithm to solve the vehicle routing problem (VRP in short) for Sheung Shui Slaughtering House (SSSH in short). The VRP was studied whether we could allocate minimum number of lorries to deliver meat into meat market in a reasonable time. The VRP was formulated. Several papers on solving VRP were studied. One of them was selected and implemented as a computer program. The program was bench-marked by executing with some famous problem data. Then, the real life data was used to execute the program. Results were recorded and compared with the existing practice. Finally, the conclusion could be drawn that VRP could be solved by Tabu Search.

Files in this item

Files Size Format
b15406635.pdf 3.059Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information