Show simple item record

dc.contributor.authorNaeem, Mohammad
dc.date.accessioned2010-10-25T19:43:24Z
dc.date.available2010-10-25T19:43:24Z
dc.date.issued2010-10-25
dc.identifier.urihttp://hdl.handle.net/10464/3036
dc.description.abstractHub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and crossover operators are explored. The GAs is tested on two well-known sets of real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be extended to other variants of location problems arising in network design planning in transportation systems.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectTransportation -- Planningen_US
dc.subjectTransportation -- Cost effectivenessen_US
dc.titleUsing genetic algorithms for the single allocation hub location problemen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record