A capacitated hub location problem under hose demand uncertainty

Available
The embargo period has ended, and this item is now available.

Date

2017

Authors

Meraklı, M.
Yaman, H.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
5
views
39
downloads

Citation Stats

Series

Abstract

In this study, we consider a capacitated multiple allocation hub location problem with hose demand uncertainty. Since the routing cost is a function of demand and capacity constraints are imposed on hubs, demand uncertainty has an impact on both the total cost and the feasibility of the solutions. We present a mathematical formulation of the problem and devise two different Benders decomposition algorithms. We develop an algorithm to solve the dual subproblem using complementary slackness. In our computational experiments, we test the efficiency of our approaches and we analyze the effects of uncertainty. The results show that we obtain robust solutions with significant cost savings by incorporating uncertainty into our problem.

Source Title

Computers and Operations Research

Publisher

Elsevier

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English