Multi-Cut Implementation of Hub-and-Spoke Problem with Congestion Consideration
Abstract
In this study, we examine a p-hub location problem where the objective function encompasses regular transportation costs, fixed expenses, and congestion costs associated with hubs. We demonstrate that the model for this problem is a convex mixed integer programming problem. To solve the problem, we introduce a multi-cut cutting-plane method and compare its performance to the existing single cut version method. Our findings show that the multi-cut method outperforms the single-cut method in terms of the time required to reach a solution. The results of numerical experiments conducted to support this comparison are also presented.
Full Text:
PDFDOI: https://doi.org/10.11114/aef.v12i2.7667
Refbacks
- There are currently no refbacks.
Paper Submission E-mail: aef@redfame.com
Applied Economics and Finance ISSN 2332-7294 (Print) ISSN 2332-7308 (Online)
Copyright © Redfame Publishing Inc.
To make sure that you can receive messages from us, please add the 'redfame.com' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders. If you have any questions, please contact: aef@redfame.com
-------------------------------------------------------------------------------------------------------------------------------------------------------------