๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A hybrid heuristic for the uncapacitated hub location problem

โœ Scribed by Sue Abdinnour-Helm

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
991 KB
Volume
106
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

Given 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.

๐Ÿ“œ SIMILAR VOLUMES

An efficient heuristic procedure for the
An efficient heuristic procedure for the uncapacitated warehouse location problem
โœ Basheer M. Khumawala ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 681 KB

## Abstract This paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem. This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by the au

A linear program for the two-hub locatio
A linear program for the two-hub location problem
โœ Jinhyeon Sohn; Sungsoo Park ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

This paper considers the discrete two-hub location problem. We need to choose two hubs from a set of nodes. The remaining nodes are to be connected to one of the two hubs which act as switching points for intemodal flows. A configuration which minimizes the total flow cost needs to be found. We show

A parallel hybrid heuristic for the mult
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements
โœ Bernard Gendron; Jean-Yves Potvin; Patrick Soriano ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 156 KB

In this paper, a parallel hybrid heuristic is developed for the multicommodity capacitated location problem with balancing requirements. The hybrid involves variable neighborhood descent (VND) and slope scaling (SS). Both methods evolve in parallel within a master-slave architecture where the slave