Name
Abstract | ||
|---|---|---|
The multiple allocation hub-and-spoke network design under hub congestion problem is addressed in this paper. A non-linear mixed integer programming formulation is proposed, modeling the congestion as a convex cost function. A generalized Benders decomposition algorithm has been deployed and has successfully solved standard data set instances up to 81 nodes. The proposed algorithm has also outperformed a commercial leading edge non-linear integer programming package. The main contribution of this work is to establish a compromise between the transportation cost savings induced by the economies of scale exploitation and the costs associated with the congestion effects. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cor.2008.10.004 | Computers & OR |
Keywords | DocType | Volume |
multiple allocation,convex cost function,commercial leading edge non-linear,non-linear mixed integer programming,hub congestion problem,decomposition algorithm,generalized Benders,congestion effect,transportation cost saving,hub-and-spoke network design,proposed algorithm,integer programming package | Journal | 36 |
Issue | ISSN | Citations |
12 | Computers and Operations Research | 3 |
PageRank | References | Authors |
0.38 | 21 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. S. de Camargo | 1 | 21 | 1.60 |
| G. Miranda Jr. | 2 | 3 | 0.38 |
| R. P. M. Ferreira | 3 | 29 | 4.01 |
| H. P. Luna | 4 | 55 | 7.39 |