Heuristic algorithms for routing problems.
General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution of goods, transportation of commodities and/or people etc.In this thesis we fo...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2001
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/1090 |