Forward supply Chain network design problem: Heuristic approaches
Determining positions and counting of actors, amount of product flow between and decreasing transportation costs are handled as a network design problem in supply chain management. Supply chain network design (SCND) problem belongs to the class of NP-hard problems. It has therefore appealed to a num...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Pamukkale University
2018-08-01
|
Series: | Pamukkale University Journal of Engineering Sciences |
Subjects: | |
Online Access: | https://dergipark.org.tr/tr/pub/pajes/issue/38891/454116 |
id |
doaj-8c30db1045414ad597231da73029e227 |
---|---|
record_format |
Article |
spelling |
doaj-8c30db1045414ad597231da73029e2272021-04-04T13:24:33ZengPamukkale UniversityPamukkale University Journal of Engineering Sciences1300-70092147-58812018-08-01244749763218Forward supply Chain network design problem: Heuristic approachesSüleyman MeteZeynel Abidin ÇilSaadettin Erhan KesenEren ÖzceylanÇağrı KoçDetermining positions and counting of actors, amount of product flow between and decreasing transportation costs are handled as a network design problem in supply chain management. Supply chain network design (SCND) problem belongs to the class of NP-hard problems. It has therefore appealed to a number of researchers’ close attention. However, existing literature lacks of common benchmark instances for forward SCND problems so as to make a fair comparison between developed and applied heuristic approaches. To this end, 450 new benchmark instances ranging from small to large size for forward SCND problems with two, three and four-echelon are generated and a mathematical model for each of the problems is formulated. Due to the complexity issues, we develop two heuristic solution approaches, genetic algorithm (GA) and hybrid heuristic algorithm (HHA), and we apply them to the large pool of benchmark instances. Comparative experiments show that both the GA and HHA can yield feasible solutions in much less computational time and, in particular, outperforms CPLEX regarding the solution quality as the number of echelon grows.https://dergipark.org.tr/tr/pub/pajes/issue/38891/454116supply chain network designmixed integer programminggenetic algorithmhybrid heuristic algorithmtedarik zinciri ağ tasarımıkarma tamsayılı programlamagenetik algoritmamelez sezgisel algoritma. |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Süleyman Mete Zeynel Abidin Çil Saadettin Erhan Kesen Eren Özceylan Çağrı Koç |
spellingShingle |
Süleyman Mete Zeynel Abidin Çil Saadettin Erhan Kesen Eren Özceylan Çağrı Koç Forward supply Chain network design problem: Heuristic approaches Pamukkale University Journal of Engineering Sciences supply chain network design mixed integer programming genetic algorithm hybrid heuristic algorithm tedarik zinciri ağ tasarımı karma tamsayılı programlama genetik algoritma melez sezgisel algoritma. |
author_facet |
Süleyman Mete Zeynel Abidin Çil Saadettin Erhan Kesen Eren Özceylan Çağrı Koç |
author_sort |
Süleyman Mete |
title |
Forward supply Chain network design problem: Heuristic approaches |
title_short |
Forward supply Chain network design problem: Heuristic approaches |
title_full |
Forward supply Chain network design problem: Heuristic approaches |
title_fullStr |
Forward supply Chain network design problem: Heuristic approaches |
title_full_unstemmed |
Forward supply Chain network design problem: Heuristic approaches |
title_sort |
forward supply chain network design problem: heuristic approaches |
publisher |
Pamukkale University |
series |
Pamukkale University Journal of Engineering Sciences |
issn |
1300-7009 2147-5881 |
publishDate |
2018-08-01 |
description |
Determining positions and counting of actors,
amount of product flow between and decreasing transportation costs are handled
as a network design problem in supply chain management. Supply chain network
design (SCND) problem belongs to the class of NP-hard problems. It has
therefore appealed to a number of researchers’ close attention. However,
existing literature lacks of common benchmark instances for forward SCND
problems so as to make a fair comparison between developed and applied
heuristic approaches. To this end, 450 new benchmark instances ranging from
small to large size for forward SCND problems with two, three and four-echelon
are generated and a mathematical model for each of the problems is formulated.
Due to the complexity issues, we develop two heuristic solution approaches,
genetic algorithm (GA) and hybrid heuristic algorithm (HHA), and we apply them
to the large pool of benchmark instances. Comparative experiments show that
both the GA and HHA can yield feasible solutions in much less computational
time and, in particular, outperforms CPLEX regarding the solution quality as
the number of echelon grows. |
topic |
supply chain network design mixed integer programming genetic algorithm hybrid heuristic algorithm tedarik zinciri ağ tasarımı karma tamsayılı programlama genetik algoritma melez sezgisel algoritma. |
url |
https://dergipark.org.tr/tr/pub/pajes/issue/38891/454116 |
work_keys_str_mv |
AT suleymanmete forwardsupplychainnetworkdesignproblemheuristicapproaches AT zeynelabidincil forwardsupplychainnetworkdesignproblemheuristicapproaches AT saadettinerhankesen forwardsupplychainnetworkdesignproblemheuristicapproaches AT erenozceylan forwardsupplychainnetworkdesignproblemheuristicapproaches AT cagrıkoc forwardsupplychainnetworkdesignproblemheuristicapproaches |
_version_ |
1721542161626824704 |