Document Type Doctoral Thesis Author Joubert, Johannes Wilhelm email@example.com URN etd-07202007-175138 Document Title An integrated and intelligent metaheuristic for constrained vehicle routing Degree PhD (Industrial Engineering) Department Industrial and Systems Engineering Supervisor
Advisor Name Title Prof S J Claasen Keywords
- vehicle routing
- fuzzy clustering
- time-dependent travel time
Date 2007-04-20 Availability unrestricted Abstract
South African metropolitan areas are experiencing rapid growth and require an increase in network infrastructure. Increased congestion negatively impacts both public and freight transport costs. The concept of City Logistics is concerned with the mobility of cities, and entails the process of optimizing urban logistics activities by concerning the social, environmental, economic, financial, and energy impacts of urban freight movement. In a costcompetitive environment, freight transporters often use sophisticated vehicle routing and scheduling applications to improve fleet utilization and reduce the cost of meeting customer demands.
In this thesis, the candidate builds on the observation that vehicle routing and scheduling algorithms are inherent problem specific, with no single algorithm providing a dominant solution to all problem environments. Commercial applications mostly deploy a single algorithm in a multitude of environments which would often be better serviced by various different algorithms.
This thesis algorithmically implements the ability of human decision makers to choose an appropriate solution algorithm when solving scheduling problems. The intent of the routing agent is to classify the problem as representative of a traditional problem set, based on its characteristics, and then to solve the problem with the most appropriate solution algorithm known for the traditional problem set. A not-so-artificially-intelligent-vehicle-routing-agent™ is proposed and developed in this thesis. To be considered intelligent, an agent is firstly required to be able to recognize its environment. Fuzzy c-means clustering is employed to analyze the geographic dispersion of the customers (nodes) from an unknown routing problem to determine to which traditional problem set it relates best. Cluster validation is used to classify the routing problem into a traditional problem set.
Once the routing environment is classified, the agent selects an appropriate metaheuristic to solve the complex variant of the Vehicle Routing Problem. Multiple soft time windows, a heterogeneous fleet, and multiple scheduling are addressed in the presence of time-dependent travel times. A new initial solution heuristic is proposed that exploits the inherent configuration of customer service times through a concept referred to as time window compatibility. A high-quality initial solution is subsequently improved by the Tabu Search metaheuristic through both an adaptive memory, and a self-selection structure.
As an alternative to Tabu Search, a Genetic Algorithm is developed in this thesis. Two new crossover mechanisms are proposed that outperform a number of existing crossover mechanisms. The first proposed mechanism successfully uses the concept of time window compatibility, while the second builds on an idea used from a different sweeping-arc heuristic.
A neural network is employed to assist the intelligent routing agent to choose, based on its knowledge base, between the two metaheuristic algorithms available to solve the unknown problem at hand. The routing agent then not only solves the complex variant of the problem, but adapts to the problem environment by evaluating its decisions, and updating, or reaffirming its knowledge base to ensure improved decisions are made in future.
© University of Pretoria
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access 00front.pdf 200.87 Kb 00:00:55 00:00:28 00:00:25 00:00:12 00:00:01 01chapter1.pdf 175.33 Kb 00:00:48 00:00:25 00:00:21 00:00:10 < 00:00:01 02chapter2.pdf 343.15 Kb 00:01:35 00:00:49 00:00:42 00:00:21 00:00:01 03chapter3.pdf 379.51 Kb 00:01:45 00:00:54 00:00:47 00:00:23 00:00:02 04chapter4.pdf 378.07 Kb 00:01:45 00:00:54 00:00:47 00:00:23 00:00:02 05chapter5.pdf 259.03 Kb 00:01:11 00:00:37 00:00:32 00:00:16 00:00:01 06chapter6.pdf 298.01 Kb 00:01:22 00:00:42 00:00:37 00:00:18 00:00:01 07chapter7.pdf 294.06 Kb 00:01:21 00:00:42 00:00:36 00:00:18 00:00:01 08chapter8.pdf 317.42 Kb 00:01:28 00:00:45 00:00:39 00:00:19 00:00:01 09chapter9.pdf 162.09 Kb 00:00:45 00:00:23 00:00:20 00:00:10 < 00:00:01 10Bibliography.pdf 172.67 Kb 00:00:47 00:00:24 00:00:21 00:00:10 < 00:00:01 11appendicesA-F.pdf 1.22 Mb 00:05:39 00:02:54 00:02:32 00:01:16 00:00:06