Capacitated Multiple Allocation Hub Covering Flow Problem
The aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs. Every network node has the potential to be a hub and demand from an origin to adestination must be sent thro...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kyrgyz Turkish Manas University
2021-06-01
|
| Series: | MANAS: Journal of Engineering |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/en/download/article-file/1342603 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832542897699815424 |
|---|---|
| author | Orhan Feyzioğlu Nazmi Sener |
| author_facet | Orhan Feyzioğlu Nazmi Sener |
| author_sort | Orhan Feyzioğlu |
| collection | DOAJ |
| description | The aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs. Every network node has the potential to be a hub and demand from an origin to adestination must be sent through at least one hub. The network is incomplete in the sense thatthe maximum allowed or coverage distance between any opened hub and demand origin/destination is predefined. It is assumed that there is a cost saving to route demand via hubs dueto consolidation. Another important issue is the consideration of capacity restrictions imposedon network links and opened hubs. The problem is developed as a mixed-integer linearoptimization problem. According to the results obtained from computational experiments, weshow that taking into account both flow related costs and capacities of network componentsconcurrently is very important to have a cost effective design. |
| format | Article |
| id | doaj-art-715481eedacc48589dfd2efd143f2028 |
| institution | Kabale University |
| issn | 1694-7398 |
| language | English |
| publishDate | 2021-06-01 |
| publisher | Kyrgyz Turkish Manas University |
| record_format | Article |
| series | MANAS: Journal of Engineering |
| spelling | doaj-art-715481eedacc48589dfd2efd143f20282025-02-03T12:07:27ZengKyrgyz Turkish Manas UniversityMANAS: Journal of Engineering1694-73982021-06-019172841437Capacitated Multiple Allocation Hub Covering Flow ProblemOrhan Feyzioğlu0https://orcid.org/0000-0002-8919-191XNazmi Sener1https://orcid.org/0000-0002-4027-5143GALATASARAY ÜNİVERSİTESİGALATASARAY UNIVERSITYThe aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs. Every network node has the potential to be a hub and demand from an origin to adestination must be sent through at least one hub. The network is incomplete in the sense thatthe maximum allowed or coverage distance between any opened hub and demand origin/destination is predefined. It is assumed that there is a cost saving to route demand via hubs dueto consolidation. Another important issue is the consideration of capacity restrictions imposedon network links and opened hubs. The problem is developed as a mixed-integer linearoptimization problem. According to the results obtained from computational experiments, weshow that taking into account both flow related costs and capacities of network componentsconcurrently is very important to have a cost effective design.https://dergipark.org.tr/en/download/article-file/1342603facility locationnetwork designhub-and-spokenetworkscapacitatedhub coveringmultipleallocation |
| spellingShingle | Orhan Feyzioğlu Nazmi Sener Capacitated Multiple Allocation Hub Covering Flow Problem MANAS: Journal of Engineering facility location network design hub-and-spokenetworks capacitatedhub covering multipleallocation |
| title | Capacitated Multiple Allocation Hub Covering Flow Problem |
| title_full | Capacitated Multiple Allocation Hub Covering Flow Problem |
| title_fullStr | Capacitated Multiple Allocation Hub Covering Flow Problem |
| title_full_unstemmed | Capacitated Multiple Allocation Hub Covering Flow Problem |
| title_short | Capacitated Multiple Allocation Hub Covering Flow Problem |
| title_sort | capacitated multiple allocation hub covering flow problem |
| topic | facility location network design hub-and-spokenetworks capacitatedhub covering multipleallocation |
| url | https://dergipark.org.tr/en/download/article-file/1342603 |
| work_keys_str_mv | AT orhanfeyzioglu capacitatedmultipleallocationhubcoveringflowproblem AT nazmisener capacitatedmultipleallocationhubcoveringflowproblem |