Loading...
Please wait, while we are loading the content...
Similar Documents
Using genetic algorithms for the single allocation hub location problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Naeem, Mohammad |
| Copyright Year | 2010 |
| Abstract | Hub 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://dr.library.brocku.ca/bitstream/handle/10464/3036/Brock_Naeem_Mohammad_2010.pdf;jsessionid=BB8B0E10542439BEFA65F8E9467EA2CC?sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
