Design and analysis of vehicle routing algorithms for logistics applications

Pao Yue-kong Library Electronic Theses Database

Design and analysis of vehicle routing algorithms for logistics applications


Author: Tan, Wei-heng
Title: Design and analysis of vehicle routing algorithms for logistics applications
Degree: M.Sc.
Year: 2007
Subject: Hong Kong Polytechnic University -- Dissertations.
Business logistics -- Management.
Transportation problems (Programming)
Delivery of goods.
Department: Dept. of Computing
Pages: vii, 58 leaves : ill. ; 30 cm.
Language: English
InnoPac Record:
Abstract: The Vehicle Routing Problem (VRP) is a classic problem in supply chain and logistics management, it arises naturally as a central problem in the fields of transportation, distribution and logistics, in which the goal is to find the most efficient route (usually meaning the shortest distance) for delivering goods from one place to another. It ensures that the delivery vehicle is always as full as possible, and indeed wherever issues of resource usage must be considered, such as empty lading rate, time window, vehicle type, transport means etc. "Backhaul" is one common VRP-related problem. Backhaul refers to a situation where a vehicle both delivers and picks up goods at each point along a route. To date there has been little research in this area. And a proposed approach to the backhaul problem has been VRPB (VRP with Backhaul). That is an extension of the classical vehicle routing problems where all deliveries have to be made on each route before any pickups. The proposed of this paper is to develop an approach to seek to improve VRP with backhaul problem. This approach uses a new algorithm, VRPNF (VRP Near and Far), where NF according to delivery goods from near to far (or far to near), defined measures of distance which are determining factors in route determination in this algorithm. Because not have same assumptions background literature on it, this paper will compare and evaluate the proposed algorithms for computation through extensive computational experiments based on the extended benchmark problem.

Files in this item

Files Size Format
b21459769.pdf 5.553Mb 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


More Information