Combined ship routing and inventory management in the salmon farming industry
Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish...
Ausführliche Beschreibung
Autor*in: |
Agra, Agostinho [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2016 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer Science+Business Media New York 2016 |
---|
Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Springer US, 1984, 253(2016), 2 vom: 06. Jan., Seite 799-823 |
---|---|
Übergeordnetes Werk: |
volume:253 ; year:2016 ; number:2 ; day:06 ; month:01 ; pages:799-823 |
Links: |
---|
DOI / URN: |
10.1007/s10479-015-2088-x |
---|
Katalog-ID: |
OLC2111176907 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | OLC2111176907 | ||
003 | DE-627 | ||
005 | 20230502202851.0 | ||
007 | tu | ||
008 | 230502s2016 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s10479-015-2088-x |2 doi | |
035 | |a (DE-627)OLC2111176907 | ||
035 | |a (DE-He213)s10479-015-2088-x-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 3,2 |2 ssgn | ||
100 | 1 | |a Agra, Agostinho |e verfasserin |4 aut | |
245 | 1 | 0 | |a Combined ship routing and inventory management in the salmon farming industry |
264 | 1 | |c 2016 | |
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 New York 2016 | ||
520 | |a Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. | ||
650 | 4 | |a Maritime transportation | |
650 | 4 | |a Ship routing and scheduling | |
650 | 4 | |a Inventory routing | |
650 | 4 | |a Valid inequalities | |
650 | 4 | |a Matheuristics | |
700 | 1 | |a Christiansen, Marielle |0 (orcid)0000-0003-1862-6282 |4 aut | |
700 | 1 | |a Ivarsøy, Kristine S. |4 aut | |
700 | 1 | |a Solhaug, Ida Elise |4 aut | |
700 | 1 | |a Tomasgard, Asgeir |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Springer US, 1984 |g 253(2016), 2 vom: 06. Jan., Seite 799-823 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
773 | 1 | 8 | |g volume:253 |g year:2016 |g number:2 |g day:06 |g month:01 |g pages:799-823 |
856 | 4 | 1 | |u https://doi.org/10.1007/s10479-015-2088-x |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-WIW | ||
912 | |a SSG-OLC-MAT | ||
951 | |a AR | ||
952 | |d 253 |j 2016 |e 2 |b 06 |c 01 |h 799-823 |
author_variant |
a a aa m c mc k s i ks ksi i e s ie ies a t at |
---|---|
matchkey_str |
article:02545330:2016----::obndhpotnadnetrmngmnitea |
hierarchy_sort_str |
2016 |
publishDate |
2016 |
allfields |
10.1007/s10479-015-2088-x doi (DE-627)OLC2111176907 (DE-He213)s10479-015-2088-x-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Agra, Agostinho verfasserin aut Combined ship routing and inventory management in the salmon farming industry 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics Christiansen, Marielle (orcid)0000-0003-1862-6282 aut Ivarsøy, Kristine S. aut Solhaug, Ida Elise aut Tomasgard, Asgeir aut Enthalten in Annals of operations research Springer US, 1984 253(2016), 2 vom: 06. Jan., Seite 799-823 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 https://doi.org/10.1007/s10479-015-2088-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 253 2016 2 06 01 799-823 |
spelling |
10.1007/s10479-015-2088-x doi (DE-627)OLC2111176907 (DE-He213)s10479-015-2088-x-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Agra, Agostinho verfasserin aut Combined ship routing and inventory management in the salmon farming industry 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics Christiansen, Marielle (orcid)0000-0003-1862-6282 aut Ivarsøy, Kristine S. aut Solhaug, Ida Elise aut Tomasgard, Asgeir aut Enthalten in Annals of operations research Springer US, 1984 253(2016), 2 vom: 06. Jan., Seite 799-823 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 https://doi.org/10.1007/s10479-015-2088-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 253 2016 2 06 01 799-823 |
allfields_unstemmed |
10.1007/s10479-015-2088-x doi (DE-627)OLC2111176907 (DE-He213)s10479-015-2088-x-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Agra, Agostinho verfasserin aut Combined ship routing and inventory management in the salmon farming industry 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics Christiansen, Marielle (orcid)0000-0003-1862-6282 aut Ivarsøy, Kristine S. aut Solhaug, Ida Elise aut Tomasgard, Asgeir aut Enthalten in Annals of operations research Springer US, 1984 253(2016), 2 vom: 06. Jan., Seite 799-823 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 https://doi.org/10.1007/s10479-015-2088-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 253 2016 2 06 01 799-823 |
allfieldsGer |
10.1007/s10479-015-2088-x doi (DE-627)OLC2111176907 (DE-He213)s10479-015-2088-x-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Agra, Agostinho verfasserin aut Combined ship routing and inventory management in the salmon farming industry 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics Christiansen, Marielle (orcid)0000-0003-1862-6282 aut Ivarsøy, Kristine S. aut Solhaug, Ida Elise aut Tomasgard, Asgeir aut Enthalten in Annals of operations research Springer US, 1984 253(2016), 2 vom: 06. Jan., Seite 799-823 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 https://doi.org/10.1007/s10479-015-2088-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 253 2016 2 06 01 799-823 |
allfieldsSound |
10.1007/s10479-015-2088-x doi (DE-627)OLC2111176907 (DE-He213)s10479-015-2088-x-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Agra, Agostinho verfasserin aut Combined ship routing and inventory management in the salmon farming industry 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics Christiansen, Marielle (orcid)0000-0003-1862-6282 aut Ivarsøy, Kristine S. aut Solhaug, Ida Elise aut Tomasgard, Asgeir aut Enthalten in Annals of operations research Springer US, 1984 253(2016), 2 vom: 06. Jan., Seite 799-823 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 https://doi.org/10.1007/s10479-015-2088-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 253 2016 2 06 01 799-823 |
language |
English |
source |
Enthalten in Annals of operations research 253(2016), 2 vom: 06. Jan., Seite 799-823 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 |
sourceStr |
Enthalten in Annals of operations research 253(2016), 2 vom: 06. Jan., Seite 799-823 volume:253 year:2016 number:2 day:06 month:01 pages:799-823 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Annals of operations research |
authorswithroles_txt_mv |
Agra, Agostinho @@aut@@ Christiansen, Marielle @@aut@@ Ivarsøy, Kristine S. @@aut@@ Solhaug, Ida Elise @@aut@@ Tomasgard, Asgeir @@aut@@ |
publishDateDaySort_date |
2016-01-06T00:00:00Z |
hierarchy_top_id |
12964370X |
dewey-sort |
14 |
id |
OLC2111176907 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111176907</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202851.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-015-2088-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111176907</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-015-2088-x-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="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Agra, Agostinho</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combined ship routing and inventory management in the salmon farming industry</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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 New York 2016</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maritime transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ship routing and scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inventory routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Valid inequalities</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matheuristics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Christiansen, Marielle</subfield><subfield code="0">(orcid)0000-0003-1862-6282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ivarsøy, Kristine S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solhaug, Ida Elise</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tomasgard, Asgeir</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Springer US, 1984</subfield><subfield code="g">253(2016), 2 vom: 06. Jan., Seite 799-823</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:253</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">day:06</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:799-823</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-015-2088-x</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-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">253</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="b">06</subfield><subfield code="c">01</subfield><subfield code="h">799-823</subfield></datafield></record></collection>
|
author |
Agra, Agostinho |
spellingShingle |
Agra, Agostinho ddc 004 ssgn 3,2 misc Maritime transportation misc Ship routing and scheduling misc Inventory routing misc Valid inequalities misc Matheuristics Combined ship routing and inventory management in the salmon farming industry |
authorStr |
Agra, Agostinho |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0254-5330 |
topic_title |
004 VZ 3,2 ssgn Combined ship routing and inventory management in the salmon farming industry Maritime transportation Ship routing and scheduling Inventory routing Valid inequalities Matheuristics |
topic |
ddc 004 ssgn 3,2 misc Maritime transportation misc Ship routing and scheduling misc Inventory routing misc Valid inequalities misc Matheuristics |
topic_unstemmed |
ddc 004 ssgn 3,2 misc Maritime transportation misc Ship routing and scheduling misc Inventory routing misc Valid inequalities misc Matheuristics |
topic_browse |
ddc 004 ssgn 3,2 misc Maritime transportation misc Ship routing and scheduling misc Inventory routing misc Valid inequalities misc Matheuristics |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Annals of operations research |
hierarchy_parent_id |
12964370X |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Annals of operations research |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
title |
Combined ship routing and inventory management in the salmon farming industry |
ctrlnum |
(DE-627)OLC2111176907 (DE-He213)s10479-015-2088-x-p |
title_full |
Combined ship routing and inventory management in the salmon farming industry |
author_sort |
Agra, Agostinho |
journal |
Annals of operations research |
journalStr |
Annals of operations research |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2016 |
contenttype_str_mv |
txt |
container_start_page |
799 |
author_browse |
Agra, Agostinho Christiansen, Marielle Ivarsøy, Kristine S. Solhaug, Ida Elise Tomasgard, Asgeir |
container_volume |
253 |
class |
004 VZ 3,2 ssgn |
format_se |
Aufsätze |
author-letter |
Agra, Agostinho |
doi_str_mv |
10.1007/s10479-015-2088-x |
normlink |
(ORCID)0000-0003-1862-6282 |
normlink_prefix_str_mv |
(orcid)0000-0003-1862-6282 |
dewey-full |
004 |
title_sort |
combined ship routing and inventory management in the salmon farming industry |
title_auth |
Combined ship routing and inventory management in the salmon farming industry |
abstract |
Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. © Springer Science+Business Media New York 2016 |
abstractGer |
Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. © Springer Science+Business Media New York 2016 |
abstract_unstemmed |
Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer. © Springer Science+Business Media New York 2016 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT |
container_issue |
2 |
title_short |
Combined ship routing and inventory management in the salmon farming industry |
url |
https://doi.org/10.1007/s10479-015-2088-x |
remote_bool |
false |
author2 |
Christiansen, Marielle Ivarsøy, Kristine S. Solhaug, Ida Elise Tomasgard, Asgeir |
author2Str |
Christiansen, Marielle Ivarsøy, Kristine S. Solhaug, Ida Elise Tomasgard, Asgeir |
ppnlink |
12964370X |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s10479-015-2088-x |
up_date |
2024-07-04T08:56:30.555Z |
_version_ |
1803638161338793984 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111176907</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202851.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-015-2088-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111176907</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-015-2088-x-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="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Agra, Agostinho</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combined ship routing and inventory management in the salmon farming industry</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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 New York 2016</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We consider a maritime inventory routing problem for Norway’s largest salmon farmer both producing the feed at a production factory and being responsible for fish farms located along the Norwegian coast. The company has bought two new ships to transport the feed from the factory to the fish farms and is responsible for the routing and scheduling of the ships. In addition, the company has to ensure that the feed at the production factory as well as at the fish farms is within the inventory limits. A mathematical model of the problem is presented, and this model is reformulated to improve the efficiency of the branch-and-bound algorithm and tightened with valid inequalities. To derive good solutions quickly, several practical aspects of the problem are utilized and two matheuristics developed. Computational results are reported for instances based on the real problem of the salmon farmer.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maritime transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ship routing and scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inventory routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Valid inequalities</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matheuristics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Christiansen, Marielle</subfield><subfield code="0">(orcid)0000-0003-1862-6282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ivarsøy, Kristine S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solhaug, Ida Elise</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tomasgard, Asgeir</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Springer US, 1984</subfield><subfield code="g">253(2016), 2 vom: 06. Jan., Seite 799-823</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:253</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">day:06</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:799-823</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-015-2088-x</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-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">253</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="b">06</subfield><subfield code="c">01</subfield><subfield code="h">799-823</subfield></datafield></record></collection>
|
score |
7.401045 |