Determining departure times in dynamic and stochastic maritime routing and scheduling problems
Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on...
Ausführliche Beschreibung
Autor*in: |
Tirado, Gregorio [verfasserIn] Hvattum, Lars Magnus [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2016 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: International journal of flexible manufacturing systems - [S.l.] : Proquest, 1988, 29(2016), 3-4 vom: 20. Apr., Seite 553-571 |
---|---|
Übergeordnetes Werk: |
volume:29 ; year:2016 ; number:3-4 ; day:20 ; month:04 ; pages:553-571 |
Links: |
---|
DOI / URN: |
10.1007/s10696-016-9242-x |
---|
Katalog-ID: |
SPR012534714 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | SPR012534714 | ||
003 | DE-627 | ||
005 | 20220110234348.0 | ||
007 | cr uuu---uuuuu | ||
008 | 201005s2016 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1007/s10696-016-9242-x |2 doi | |
035 | |a (DE-627)SPR012534714 | ||
035 | |a (SPR)s10696-016-9242-x-e | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 650 |q ASE |
084 | |a 52.70 |2 bkl | ||
100 | 1 | |a Tirado, Gregorio |e verfasserin |4 aut | |
245 | 1 | 0 | |a Determining departure times in dynamic and stochastic maritime routing and scheduling problems |
264 | 1 | |c 2016 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. | ||
650 | 4 | |a Tabu search |7 (dpeaa)DE-He213 | |
650 | 4 | |a Uncertainty |7 (dpeaa)DE-He213 | |
650 | 4 | |a Scenario |7 (dpeaa)DE-He213 | |
650 | 4 | |a Maritime transportation |7 (dpeaa)DE-He213 | |
700 | 1 | |a Hvattum, Lars Magnus |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t International journal of flexible manufacturing systems |d [S.l.] : Proquest, 1988 |g 29(2016), 3-4 vom: 20. Apr., Seite 553-571 |w (DE-627)27118101X |w (DE-600)1479530-9 |x 1572-9370 |7 nnns |
773 | 1 | 8 | |g volume:29 |g year:2016 |g number:3-4 |g day:20 |g month:04 |g pages:553-571 |
856 | 4 | 0 | |u https://dx.doi.org/10.1007/s10696-016-9242-x |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_SPRINGER | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_120 | ||
912 | |a GBV_ILN_138 | ||
912 | |a GBV_ILN_152 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_171 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_250 | ||
912 | |a GBV_ILN_281 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_4046 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4126 | ||
936 | b | k | |a 52.70 |q ASE |
951 | |a AR | ||
952 | |d 29 |j 2016 |e 3-4 |b 20 |c 04 |h 553-571 |
author_variant |
g t gt l m h lm lmh |
---|---|
matchkey_str |
article:15729370:2016----::eemnndprueieidnmcnsohsimrtmrui |
hierarchy_sort_str |
2016 |
bklnumber |
52.70 |
publishDate |
2016 |
allfields |
10.1007/s10696-016-9242-x doi (DE-627)SPR012534714 (SPR)s10696-016-9242-x-e DE-627 ger DE-627 rakwb eng 650 ASE 52.70 bkl Tirado, Gregorio verfasserin aut Determining departure times in dynamic and stochastic maritime routing and scheduling problems 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. Tabu search (dpeaa)DE-He213 Uncertainty (dpeaa)DE-He213 Scenario (dpeaa)DE-He213 Maritime transportation (dpeaa)DE-He213 Hvattum, Lars Magnus verfasserin aut Enthalten in International journal of flexible manufacturing systems [S.l.] : Proquest, 1988 29(2016), 3-4 vom: 20. Apr., Seite 553-571 (DE-627)27118101X (DE-600)1479530-9 1572-9370 nnns volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 https://dx.doi.org/10.1007/s10696-016-9242-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2009 GBV_ILN_2027 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 52.70 ASE AR 29 2016 3-4 20 04 553-571 |
spelling |
10.1007/s10696-016-9242-x doi (DE-627)SPR012534714 (SPR)s10696-016-9242-x-e DE-627 ger DE-627 rakwb eng 650 ASE 52.70 bkl Tirado, Gregorio verfasserin aut Determining departure times in dynamic and stochastic maritime routing and scheduling problems 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. Tabu search (dpeaa)DE-He213 Uncertainty (dpeaa)DE-He213 Scenario (dpeaa)DE-He213 Maritime transportation (dpeaa)DE-He213 Hvattum, Lars Magnus verfasserin aut Enthalten in International journal of flexible manufacturing systems [S.l.] : Proquest, 1988 29(2016), 3-4 vom: 20. Apr., Seite 553-571 (DE-627)27118101X (DE-600)1479530-9 1572-9370 nnns volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 https://dx.doi.org/10.1007/s10696-016-9242-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2009 GBV_ILN_2027 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 52.70 ASE AR 29 2016 3-4 20 04 553-571 |
allfields_unstemmed |
10.1007/s10696-016-9242-x doi (DE-627)SPR012534714 (SPR)s10696-016-9242-x-e DE-627 ger DE-627 rakwb eng 650 ASE 52.70 bkl Tirado, Gregorio verfasserin aut Determining departure times in dynamic and stochastic maritime routing and scheduling problems 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. Tabu search (dpeaa)DE-He213 Uncertainty (dpeaa)DE-He213 Scenario (dpeaa)DE-He213 Maritime transportation (dpeaa)DE-He213 Hvattum, Lars Magnus verfasserin aut Enthalten in International journal of flexible manufacturing systems [S.l.] : Proquest, 1988 29(2016), 3-4 vom: 20. Apr., Seite 553-571 (DE-627)27118101X (DE-600)1479530-9 1572-9370 nnns volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 https://dx.doi.org/10.1007/s10696-016-9242-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2009 GBV_ILN_2027 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 52.70 ASE AR 29 2016 3-4 20 04 553-571 |
allfieldsGer |
10.1007/s10696-016-9242-x doi (DE-627)SPR012534714 (SPR)s10696-016-9242-x-e DE-627 ger DE-627 rakwb eng 650 ASE 52.70 bkl Tirado, Gregorio verfasserin aut Determining departure times in dynamic and stochastic maritime routing and scheduling problems 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. Tabu search (dpeaa)DE-He213 Uncertainty (dpeaa)DE-He213 Scenario (dpeaa)DE-He213 Maritime transportation (dpeaa)DE-He213 Hvattum, Lars Magnus verfasserin aut Enthalten in International journal of flexible manufacturing systems [S.l.] : Proquest, 1988 29(2016), 3-4 vom: 20. Apr., Seite 553-571 (DE-627)27118101X (DE-600)1479530-9 1572-9370 nnns volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 https://dx.doi.org/10.1007/s10696-016-9242-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2009 GBV_ILN_2027 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 52.70 ASE AR 29 2016 3-4 20 04 553-571 |
allfieldsSound |
10.1007/s10696-016-9242-x doi (DE-627)SPR012534714 (SPR)s10696-016-9242-x-e DE-627 ger DE-627 rakwb eng 650 ASE 52.70 bkl Tirado, Gregorio verfasserin aut Determining departure times in dynamic and stochastic maritime routing and scheduling problems 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. Tabu search (dpeaa)DE-He213 Uncertainty (dpeaa)DE-He213 Scenario (dpeaa)DE-He213 Maritime transportation (dpeaa)DE-He213 Hvattum, Lars Magnus verfasserin aut Enthalten in International journal of flexible manufacturing systems [S.l.] : Proquest, 1988 29(2016), 3-4 vom: 20. Apr., Seite 553-571 (DE-627)27118101X (DE-600)1479530-9 1572-9370 nnns volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 https://dx.doi.org/10.1007/s10696-016-9242-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2009 GBV_ILN_2027 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 52.70 ASE AR 29 2016 3-4 20 04 553-571 |
language |
English |
source |
Enthalten in International journal of flexible manufacturing systems 29(2016), 3-4 vom: 20. Apr., Seite 553-571 volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 |
sourceStr |
Enthalten in International journal of flexible manufacturing systems 29(2016), 3-4 vom: 20. Apr., Seite 553-571 volume:29 year:2016 number:3-4 day:20 month:04 pages:553-571 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Tabu search Uncertainty Scenario Maritime transportation |
dewey-raw |
650 |
isfreeaccess_bool |
false |
container_title |
International journal of flexible manufacturing systems |
authorswithroles_txt_mv |
Tirado, Gregorio @@aut@@ Hvattum, Lars Magnus @@aut@@ |
publishDateDaySort_date |
2016-04-20T00:00:00Z |
hierarchy_top_id |
27118101X |
dewey-sort |
3650 |
id |
SPR012534714 |
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">SPR012534714</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220110234348.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10696-016-9242-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR012534714</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10696-016-9242-x-e</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">650</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">52.70</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tirado, Gregorio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Determining departure times in dynamic and stochastic maritime routing and scheduling problems</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tabu search</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Uncertainty</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scenario</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maritime transportation</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hvattum, Lars Magnus</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of flexible manufacturing systems</subfield><subfield code="d">[S.l.] : Proquest, 1988</subfield><subfield code="g">29(2016), 3-4 vom: 20. Apr., Seite 553-571</subfield><subfield code="w">(DE-627)27118101X</subfield><subfield code="w">(DE-600)1479530-9</subfield><subfield code="x">1572-9370</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:29</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:3-4</subfield><subfield code="g">day:20</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:553-571</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10696-016-9242-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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">52.70</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">29</subfield><subfield code="j">2016</subfield><subfield code="e">3-4</subfield><subfield code="b">20</subfield><subfield code="c">04</subfield><subfield code="h">553-571</subfield></datafield></record></collection>
|
author |
Tirado, Gregorio |
spellingShingle |
Tirado, Gregorio ddc 650 bkl 52.70 misc Tabu search misc Uncertainty misc Scenario misc Maritime transportation Determining departure times in dynamic and stochastic maritime routing and scheduling problems |
authorStr |
Tirado, Gregorio |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)27118101X |
format |
electronic Article |
dewey-ones |
650 - Management & auxiliary services |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
springer |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1572-9370 |
topic_title |
650 ASE 52.70 bkl Determining departure times in dynamic and stochastic maritime routing and scheduling problems Tabu search (dpeaa)DE-He213 Uncertainty (dpeaa)DE-He213 Scenario (dpeaa)DE-He213 Maritime transportation (dpeaa)DE-He213 |
topic |
ddc 650 bkl 52.70 misc Tabu search misc Uncertainty misc Scenario misc Maritime transportation |
topic_unstemmed |
ddc 650 bkl 52.70 misc Tabu search misc Uncertainty misc Scenario misc Maritime transportation |
topic_browse |
ddc 650 bkl 52.70 misc Tabu search misc Uncertainty misc Scenario misc Maritime transportation |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
International journal of flexible manufacturing systems |
hierarchy_parent_id |
27118101X |
dewey-tens |
650 - Management & public relations |
hierarchy_top_title |
International journal of flexible manufacturing systems |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)27118101X (DE-600)1479530-9 |
title |
Determining departure times in dynamic and stochastic maritime routing and scheduling problems |
ctrlnum |
(DE-627)SPR012534714 (SPR)s10696-016-9242-x-e |
title_full |
Determining departure times in dynamic and stochastic maritime routing and scheduling problems |
author_sort |
Tirado, Gregorio |
journal |
International journal of flexible manufacturing systems |
journalStr |
International journal of flexible manufacturing systems |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology |
recordtype |
marc |
publishDateSort |
2016 |
contenttype_str_mv |
txt |
container_start_page |
553 |
author_browse |
Tirado, Gregorio Hvattum, Lars Magnus |
container_volume |
29 |
class |
650 ASE 52.70 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Tirado, Gregorio |
doi_str_mv |
10.1007/s10696-016-9242-x |
dewey-full |
650 |
author2-role |
verfasserin |
title_sort |
determining departure times in dynamic and stochastic maritime routing and scheduling problems |
title_auth |
Determining departure times in dynamic and stochastic maritime routing and scheduling problems |
abstract |
Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. |
abstractGer |
Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. |
abstract_unstemmed |
Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2009 GBV_ILN_2027 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4126 |
container_issue |
3-4 |
title_short |
Determining departure times in dynamic and stochastic maritime routing and scheduling problems |
url |
https://dx.doi.org/10.1007/s10696-016-9242-x |
remote_bool |
true |
author2 |
Hvattum, Lars Magnus |
author2Str |
Hvattum, Lars Magnus |
ppnlink |
27118101X |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s10696-016-9242-x |
up_date |
2024-07-03T13:35:12.751Z |
_version_ |
1803565098865786880 |
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">SPR012534714</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220110234348.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10696-016-9242-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR012534714</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10696-016-9242-x-e</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">650</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">52.70</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tirado, Gregorio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Determining departure times in dynamic and stochastic maritime routing and scheduling problems</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tabu search</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Uncertainty</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scenario</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maritime transportation</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hvattum, Lars Magnus</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of flexible manufacturing systems</subfield><subfield code="d">[S.l.] : Proquest, 1988</subfield><subfield code="g">29(2016), 3-4 vom: 20. Apr., Seite 553-571</subfield><subfield code="w">(DE-627)27118101X</subfield><subfield code="w">(DE-600)1479530-9</subfield><subfield code="x">1572-9370</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:29</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:3-4</subfield><subfield code="g">day:20</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:553-571</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10696-016-9242-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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">52.70</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">29</subfield><subfield code="j">2016</subfield><subfield code="e">3-4</subfield><subfield code="b">20</subfield><subfield code="c">04</subfield><subfield code="h">553-571</subfield></datafield></record></collection>
|
score |
7.4012003 |