Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Thesis (PhD)--University of Pretoria, 2010.
| Other Authors: | |
|---|---|
| Format: | Thesis |
| Published: |
University of Pretoria
2013
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613695671009280 |
|---|---|
| access_status_str | Open Access |
| author2 | Yadavalli, Venkata S. Sarma |
| author_browse | Yadavalli, Venkata S. Sarma |
| author_facet | Yadavalli, Venkata S. Sarma |
| collection | Thesis |
| dc_rights_str_mv | © 2010, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. |
| description | Thesis (PhD)--University of Pretoria, 2010. |
| format | Thesis |
| id | oai:repository.up.ac.za:2263/29598 |
| institution | University of Pretoria (South Africa) |
| last_indexed | 2026-06-10T12:40:14.504Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository |
| publishDate | 2013 |
| publishDateRange | 2013 |
| publishDateSort | 2013 |
| publisher | University of Pretoria |
| publisherStr | University of Pretoria |
| record_format | dspace |
| source_str | UPSpace — University of Pretoria Institutional Repository |
| spelling | oai:repository.up.ac.za:2263/29598 Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model Yadavalli, Venkata S. Sarma alwyn@e-logics.co.za Moolman, A.J. (Alwyn Jakobus) Multiple time windows Multiple constraints Tabu search Ant system Memetic algorithm Hyper-heuristics Meta-heuristics Vehicle routing problem Supply chain management Compatibility matrix Parallel UCTD Thesis (PhD)--University of Pretoria, 2010. The Vehicle Routing Problem has been around for more than 50 years and has been of major interest to the operations research community. The VRP pose a complex problem with major benefits for the industry. In every supply chain transportation occurs between customers and suppliers. In this thesis, we analyze the use of a multiple pheromone trial in using Ant Systems to solve the VRP. The goal is to find a reasonable solution for data environments of derivatives of the basic VRP. An adaptive object model approach is followed to allow for additional constraints and customizable cost functions. A parallel method is used to improve speed and traversing the solution space. The Ant System is applied to the local search operations as well as the data objects. The Tabu Search method is used in the local search part of the solution. The study succeeds in allowing for all of the key performance indicators, i.e. efficiency, effectiveness, alignment, agility and integration for an IT system, where the traditional research on a VRP algorithm only focuses on the first two. Industrial and Systems Engineering unrestricted 2013-09-07T16:03:30Z 2010-11-19 2013-09-07T16:03:30Z 2010-09-02 2010-11-19 2010-11-19 Thesis Moolman, AJ 2010, Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/29598 > D10/777/gm http://hdl.handle.net/2263/29598 http://upetd.up.ac.za/thesis/available/etd-11192010-165951/ © 2010, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf University of Pretoria |
| spellingShingle | Multiple time windows Multiple constraints Tabu search Ant system Memetic algorithm Hyper-heuristics Meta-heuristics Vehicle routing problem Supply chain management Compatibility matrix Parallel UCTD Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| title | Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| title_full | Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| title_fullStr | Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| title_full_unstemmed | Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| title_short | Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| title_sort | design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model |
| topic | Multiple time windows Multiple constraints Tabu search Ant system Memetic algorithm Hyper-heuristics Meta-heuristics Vehicle routing problem Supply chain management Compatibility matrix Parallel UCTD |
| url | http://hdl.handle.net/2263/29598 http://upetd.up.ac.za/thesis/available/etd-11192010-165951/ |