A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem
Authors:
- Predrag StanojevićPSPredrag Stanojević
- Miroslav MarićMMMiroslav Marić
- Zorica StanimirovićZSZorica Stanimirović
- 1 August 2015
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 33, 24-36
Abstract
No abstract availableKeywords
Funding Information
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja (47017, 174010)
This publication has 19 references indexed in Scilit:
- New simple and efficient heuristics for the uncapacitated single allocation hub location problemComputers & Operations Research, 2009
- Network hub location problems: The state of the artEuropean Journal of Operational Research, 2008
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisationComputational Optimization and Applications, 2007
- A hybrid heuristic for the uncapacitated single allocation hub location problemOmega, 2007
- Solving the uncapacitated hub location problem using genetic algorithmsComputers & Operations Research, 2005
- Projecting the flow variables for hub location problemsNetworks, 2004
- A hybrid heuristic for the uncapacitated hub location problemEuropean Journal of Operational Research, 1998
- Tight linear programming relaxations of uncapacitated p-hub median problemsEuropean Journal of Operational Research, 1996
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987