A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments
Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhi, Jianing [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2019 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Networks and spatial economics - Springer US, 2001, 18(2018), 4 vom: Dez., Seite 937-972 |
|---|---|
| Übergeordnetes Werk: |
volume:18 ; year:2018 ; number:4 ; month:12 ; pages:937-972 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11067-018-9436-8 |
|---|
| Katalog-ID: |
OLC2037167482 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2037167482 | ||
| 003 | DE-627 | ||
| 005 | 20230503215013.0 | ||
| 007 | tu | ||
| 008 | 200820s2018 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11067-018-9436-8 |2 doi | |
| 035 | |a (DE-627)OLC2037167482 | ||
| 035 | |a (DE-He213)s11067-018-9436-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 330 |q VZ |
| 084 | |a 74.03$jMethoden und Techniken der Geographie und Anthropogeographie |2 bkl | ||
| 084 | |a 74.08$jWirtschaftsgeographie |2 bkl | ||
| 084 | |a 85.03$jMethoden und Techniken der Betriebswirtschaft |2 bkl | ||
| 100 | 1 | |a Zhi, Jianing |e verfasserin |0 (orcid)0000-0002-9953-6424 |4 aut | |
| 245 | 1 | 0 | |a A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments |
| 264 | 1 | |c 2018 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC, part of Springer Nature 2019 | ||
| 520 | |a Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. | ||
| 650 | 4 | |a PDSD | |
| 650 | 4 | |a GRASP | |
| 650 | 4 | |a Simulated annealing | |
| 650 | 4 | |a Direct shipment | |
| 650 | 4 | |a Lateral transshipments | |
| 700 | 1 | |a Keskin, Burcu B. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Networks and spatial economics |d Springer US, 2001 |g 18(2018), 4 vom: Dez., Seite 937-972 |w (DE-627)348233310 |w (DE-600)2079789-8 |w (DE-576)9348233319 |x 1566-113X |7 nnns |
| 773 | 1 | 8 | |g volume:18 |g year:2018 |g number:4 |g month:12 |g pages:937-972 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11067-018-9436-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a GBV_ILN_26 | ||
| 936 | b | k | |a 74.03$jMethoden und Techniken der Geographie und Anthropogeographie |q VZ |0 106417797 |0 (DE-625)106417797 |
| 936 | b | k | |a 74.08$jWirtschaftsgeographie |q VZ |0 18157134X |0 (DE-625)18157134X |
| 936 | b | k | |a 85.03$jMethoden und Techniken der Betriebswirtschaft |q VZ |0 106417320 |0 (DE-625)106417320 |
| 951 | |a AR | ||
| 952 | |d 18 |j 2018 |e 4 |c 12 |h 937-972 | ||
| author_variant |
j z jz b b k bb bbk |
|---|---|
| matchkey_str |
article:1566113X:2018----::mlirdcpoutodsrbtossedsgpolmihiethpet |
| hierarchy_sort_str |
2018 |
| bklnumber |
74.03$jMethoden und Techniken der Geographie und Anthropogeographie 74.08$jWirtschaftsgeographie 85.03$jMethoden und Techniken der Betriebswirtschaft |
| publishDate |
2018 |
| allfields |
10.1007/s11067-018-9436-8 doi (DE-627)OLC2037167482 (DE-He213)s11067-018-9436-8-p DE-627 ger DE-627 rakwb eng 004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl Zhi, Jianing verfasserin (orcid)0000-0002-9953-6424 aut A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. PDSD GRASP Simulated annealing Direct shipment Lateral transshipments Keskin, Burcu B. aut Enthalten in Networks and spatial economics Springer US, 2001 18(2018), 4 vom: Dez., Seite 937-972 (DE-627)348233310 (DE-600)2079789-8 (DE-576)9348233319 1566-113X nnns volume:18 year:2018 number:4 month:12 pages:937-972 https://doi.org/10.1007/s11067-018-9436-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 74.03$jMethoden und Techniken der Geographie und Anthropogeographie VZ 106417797 (DE-625)106417797 74.08$jWirtschaftsgeographie VZ 18157134X (DE-625)18157134X 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 AR 18 2018 4 12 937-972 |
| spelling |
10.1007/s11067-018-9436-8 doi (DE-627)OLC2037167482 (DE-He213)s11067-018-9436-8-p DE-627 ger DE-627 rakwb eng 004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl Zhi, Jianing verfasserin (orcid)0000-0002-9953-6424 aut A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. PDSD GRASP Simulated annealing Direct shipment Lateral transshipments Keskin, Burcu B. aut Enthalten in Networks and spatial economics Springer US, 2001 18(2018), 4 vom: Dez., Seite 937-972 (DE-627)348233310 (DE-600)2079789-8 (DE-576)9348233319 1566-113X nnns volume:18 year:2018 number:4 month:12 pages:937-972 https://doi.org/10.1007/s11067-018-9436-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 74.03$jMethoden und Techniken der Geographie und Anthropogeographie VZ 106417797 (DE-625)106417797 74.08$jWirtschaftsgeographie VZ 18157134X (DE-625)18157134X 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 AR 18 2018 4 12 937-972 |
| allfields_unstemmed |
10.1007/s11067-018-9436-8 doi (DE-627)OLC2037167482 (DE-He213)s11067-018-9436-8-p DE-627 ger DE-627 rakwb eng 004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl Zhi, Jianing verfasserin (orcid)0000-0002-9953-6424 aut A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. PDSD GRASP Simulated annealing Direct shipment Lateral transshipments Keskin, Burcu B. aut Enthalten in Networks and spatial economics Springer US, 2001 18(2018), 4 vom: Dez., Seite 937-972 (DE-627)348233310 (DE-600)2079789-8 (DE-576)9348233319 1566-113X nnns volume:18 year:2018 number:4 month:12 pages:937-972 https://doi.org/10.1007/s11067-018-9436-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 74.03$jMethoden und Techniken der Geographie und Anthropogeographie VZ 106417797 (DE-625)106417797 74.08$jWirtschaftsgeographie VZ 18157134X (DE-625)18157134X 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 AR 18 2018 4 12 937-972 |
| allfieldsGer |
10.1007/s11067-018-9436-8 doi (DE-627)OLC2037167482 (DE-He213)s11067-018-9436-8-p DE-627 ger DE-627 rakwb eng 004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl Zhi, Jianing verfasserin (orcid)0000-0002-9953-6424 aut A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. PDSD GRASP Simulated annealing Direct shipment Lateral transshipments Keskin, Burcu B. aut Enthalten in Networks and spatial economics Springer US, 2001 18(2018), 4 vom: Dez., Seite 937-972 (DE-627)348233310 (DE-600)2079789-8 (DE-576)9348233319 1566-113X nnns volume:18 year:2018 number:4 month:12 pages:937-972 https://doi.org/10.1007/s11067-018-9436-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 74.03$jMethoden und Techniken der Geographie und Anthropogeographie VZ 106417797 (DE-625)106417797 74.08$jWirtschaftsgeographie VZ 18157134X (DE-625)18157134X 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 AR 18 2018 4 12 937-972 |
| allfieldsSound |
10.1007/s11067-018-9436-8 doi (DE-627)OLC2037167482 (DE-He213)s11067-018-9436-8-p DE-627 ger DE-627 rakwb eng 004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl Zhi, Jianing verfasserin (orcid)0000-0002-9953-6424 aut A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. PDSD GRASP Simulated annealing Direct shipment Lateral transshipments Keskin, Burcu B. aut Enthalten in Networks and spatial economics Springer US, 2001 18(2018), 4 vom: Dez., Seite 937-972 (DE-627)348233310 (DE-600)2079789-8 (DE-576)9348233319 1566-113X nnns volume:18 year:2018 number:4 month:12 pages:937-972 https://doi.org/10.1007/s11067-018-9436-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 74.03$jMethoden und Techniken der Geographie und Anthropogeographie VZ 106417797 (DE-625)106417797 74.08$jWirtschaftsgeographie VZ 18157134X (DE-625)18157134X 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 AR 18 2018 4 12 937-972 |
| language |
English |
| source |
Enthalten in Networks and spatial economics 18(2018), 4 vom: Dez., Seite 937-972 volume:18 year:2018 number:4 month:12 pages:937-972 |
| sourceStr |
Enthalten in Networks and spatial economics 18(2018), 4 vom: Dez., Seite 937-972 volume:18 year:2018 number:4 month:12 pages:937-972 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
PDSD GRASP Simulated annealing Direct shipment Lateral transshipments |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Networks and spatial economics |
| authorswithroles_txt_mv |
Zhi, Jianing @@aut@@ Keskin, Burcu B. @@aut@@ |
| publishDateDaySort_date |
2018-12-01T00:00:00Z |
| hierarchy_top_id |
348233310 |
| dewey-sort |
14 |
| id |
OLC2037167482 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2037167482</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503215013.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11067-018-9436-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2037167482</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11067-018-9436-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">74.03$jMethoden und Techniken der Geographie und Anthropogeographie</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">74.08$jWirtschaftsgeographie</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhi, Jianing</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-9953-6424</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PDSD</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GRASP</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulated annealing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Direct shipment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lateral transshipments</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Keskin, Burcu B.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Networks and spatial economics</subfield><subfield code="d">Springer US, 2001</subfield><subfield code="g">18(2018), 4 vom: Dez., Seite 937-972</subfield><subfield code="w">(DE-627)348233310</subfield><subfield code="w">(DE-600)2079789-8</subfield><subfield code="w">(DE-576)9348233319</subfield><subfield code="x">1566-113X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:18</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:4</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:937-972</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11067-018-9436-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">74.03$jMethoden und Techniken der Geographie und Anthropogeographie</subfield><subfield code="q">VZ</subfield><subfield code="0">106417797</subfield><subfield code="0">(DE-625)106417797</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">74.08$jWirtschaftsgeographie</subfield><subfield code="q">VZ</subfield><subfield code="0">18157134X</subfield><subfield code="0">(DE-625)18157134X</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="q">VZ</subfield><subfield code="0">106417320</subfield><subfield code="0">(DE-625)106417320</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">18</subfield><subfield code="j">2018</subfield><subfield code="e">4</subfield><subfield code="c">12</subfield><subfield code="h">937-972</subfield></datafield></record></collection>
|
| author |
Zhi, Jianing |
| spellingShingle |
Zhi, Jianing ddc 004 bkl 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft misc PDSD misc GRASP misc Simulated annealing misc Direct shipment misc Lateral transshipments A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments |
| authorStr |
Zhi, Jianing |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)348233310 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 330 - Economics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1566-113X |
| topic_title |
004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments PDSD GRASP Simulated annealing Direct shipment Lateral transshipments |
| topic |
ddc 004 bkl 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft misc PDSD misc GRASP misc Simulated annealing misc Direct shipment misc Lateral transshipments |
| topic_unstemmed |
ddc 004 bkl 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft misc PDSD misc GRASP misc Simulated annealing misc Direct shipment misc Lateral transshipments |
| topic_browse |
ddc 004 bkl 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft misc PDSD misc GRASP misc Simulated annealing misc Direct shipment misc Lateral transshipments |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Networks and spatial economics |
| hierarchy_parent_id |
348233310 |
| dewey-tens |
000 - Computer science, knowledge & systems 330 - Economics |
| hierarchy_top_title |
Networks and spatial economics |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)348233310 (DE-600)2079789-8 (DE-576)9348233319 |
| title |
A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments |
| ctrlnum |
(DE-627)OLC2037167482 (DE-He213)s11067-018-9436-8-p |
| title_full |
A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments |
| author_sort |
Zhi, Jianing |
| journal |
Networks and spatial economics |
| journalStr |
Networks and spatial economics |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 300 - Social sciences |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
txt |
| container_start_page |
937 |
| author_browse |
Zhi, Jianing Keskin, Burcu B. |
| container_volume |
18 |
| class |
004 330 VZ 74.03$jMethoden und Techniken der Geographie und Anthropogeographie bkl 74.08$jWirtschaftsgeographie bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl |
| format_se |
Aufsätze |
| author-letter |
Zhi, Jianing |
| doi_str_mv |
10.1007/s11067-018-9436-8 |
| normlink |
(ORCID)0000-0002-9953-6424 106417797 18157134X 106417320 |
| normlink_prefix_str_mv |
(orcid)0000-0002-9953-6424 106417797 (DE-625)106417797 18157134X (DE-625)18157134X 106417320 (DE-625)106417320 |
| dewey-full |
004 330 |
| title_sort |
a multi-product production/distribution system design problem with direct shipments and lateral transshipments |
| title_auth |
A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments |
| abstract |
Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| abstractGer |
Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| abstract_unstemmed |
Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 |
| container_issue |
4 |
| title_short |
A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments |
| url |
https://doi.org/10.1007/s11067-018-9436-8 |
| remote_bool |
false |
| author2 |
Keskin, Burcu B. |
| author2Str |
Keskin, Burcu B. |
| ppnlink |
348233310 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11067-018-9436-8 |
| up_date |
2024-07-03T14:07:22.681Z |
| _version_ |
1803567122539872256 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2037167482</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503215013.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11067-018-9436-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2037167482</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11067-018-9436-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">74.03$jMethoden und Techniken der Geographie und Anthropogeographie</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">74.08$jWirtschaftsgeographie</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhi, Jianing</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-9953-6424</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Multi-Product Production/Distribution System Design Problem with Direct Shipments and Lateral Transshipments</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we investigate a multi-product, three-stage production/distribution system design problem (PDSD) with direct shipment and lateral transshipment capabilities. Our overall goal is to find the most efficient network design to minimize the total fixed facility and transportation costs. Specifically, we locate p capacitated distribution centers in the second stage from a set of candidate locations. At the same time, our design allows for direct shipments between first (suppliers) and third stages (customers) and lateral transshipments among the distribution centers in the second stage. The PDSD problem is known to be NP-hard, and prior studies have explored several heuristic methods including scatter search, tabu search, and genetic algorithms to solve the problem. In this paper, we propose two solution algorithms based on simulated annealing and GRASP heuristics. We apply both long-term and short-term memory lists to maintain an efficient local search, combined with a custom greedy solver that can effectively evaluate the quality of a solution candidate. We conduct a series of computational experiments to validate the proposed algorithms. Compared with the optimal solution, the simulated annealing algorithm presents an average optimality gap of 0.07% and an average time of 25.56% of optimal solution time, while the GRASP algorithm achieves a solution gap of 0.11% with 17.85% of optimal running time. The experimental results also show that the simulated annealing and GRASP algorithms outperform the best-reported heuristic in the literature based on scatter search regarding both solution quality and duration, especially for large-scale problem instances with tighter capacities.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PDSD</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GRASP</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulated annealing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Direct shipment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lateral transshipments</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Keskin, Burcu B.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Networks and spatial economics</subfield><subfield code="d">Springer US, 2001</subfield><subfield code="g">18(2018), 4 vom: Dez., Seite 937-972</subfield><subfield code="w">(DE-627)348233310</subfield><subfield code="w">(DE-600)2079789-8</subfield><subfield code="w">(DE-576)9348233319</subfield><subfield code="x">1566-113X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:18</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:4</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:937-972</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11067-018-9436-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">74.03$jMethoden und Techniken der Geographie und Anthropogeographie</subfield><subfield code="q">VZ</subfield><subfield code="0">106417797</subfield><subfield code="0">(DE-625)106417797</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">74.08$jWirtschaftsgeographie</subfield><subfield code="q">VZ</subfield><subfield code="0">18157134X</subfield><subfield code="0">(DE-625)18157134X</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="q">VZ</subfield><subfield code="0">106417320</subfield><subfield code="0">(DE-625)106417320</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">18</subfield><subfield code="j">2018</subfield><subfield code="e">4</subfield><subfield code="c">12</subfield><subfield code="h">937-972</subfield></datafield></record></collection>
|
| score |
7.4008255 |