A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion

An efficient procedure that concurrently generates Outer-Approximation and Benders cuts is devised to tackle the single allocation hub location problem under congestion, an MINLP. The proposed method is able to optimally solve large instances (up to 200 nodes) in reasonable time. The combination of...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 39; no. 5; pp. 329 - 337
Main Authors:	de Camargo, Ricardo Saraiva, de Miranda, Gilberto, Ferreira, Ricardo P.M.
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.09.2011 Elsevier
Subjects:	Algorithms Allocations Applied sciences Benders Decomposition Bending machines Congestion Exact sciences and technology Hub-and-spoke networks Logistics Mathematical programming Mixed integer nonlinear programming Operational research and scientific management Operational research. Management science Operations research Optimization Outer-approximation algorithms Position (location) Hub-and-spoke networks Mixed integer nonlinear programming Outer-approximation algorithms Benders Decomposition Partition method Network hub Resource allocation Algorithmics Linear programming Mixed integer programming Non linear programming Approximation algorithm Location problem Traffic congestion Logistics Novelty
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!