Show simple item record

dc.contributor.authorAbdinnour, Sue
dc.date.accessioned2013-07-05T19:29:21Z
dc.date.available2013-07-05T19:29:21Z
dc.date.issued1998-04-16
dc.identifier.citationSue Abdinnour-Helm, A hybrid heuristic for the uncapacitated hub location problem, European Journal of Operational Research, Volume 106, Issues 2–3, 16 April 1998, Pages 489-499, ISSN 0377-2217, http://dx.doi.org/10.1016/S0377-2217(97)00286-5en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://dx.doi.org/10.1016/S0377-2217(97)00286-5
dc.identifier.urihttp://hdl.handle.net/10057/5866
dc.descriptionClick on the DOI link to access this article (may not be free)en_US
dc.description.abstractGiven n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single hub. A new heuristic method is developed based on a hybrid of Genetic Algorithms (GAs) and Tabu Search (TS). The new heuristic yields much improved results when compared to applying GAs alone. In all but one of the cases tested, the results matched the best solutions found in the literature so far.en_US
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.relation.ispartofseriesEuropean Journal of Operational Research;
dc.relation.ispartofseries;v.106, No.2-3
dc.subjectLocationen_US
dc.subjectTabu searchen_US
dc.subjectGenetic algorithmsen_US
dc.subjectHeuristicsen_US
dc.titleA hybrid heuristic for the uncapacitated hub location problemen_US
dc.typeArticleen_US
dc.description.versionPeer reviewed
dc.rights.holderCopyright 1998 Elsevier


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record