Robust load planning of trains in intermodal transportation
Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation cost...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Bruns, Florian [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2013 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag Berlin Heidelberg 2013 |
|---|
| Übergeordnetes Werk: |
Enthalten in: OR spectrum - Springer Berlin Heidelberg, 2002, 36(2013), 3 vom: 06. Sept., Seite 631-668 |
|---|---|
| Übergeordnetes Werk: |
volume:36 ; year:2013 ; number:3 ; day:06 ; month:09 ; pages:631-668 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00291-013-0341-8 |
|---|
| Katalog-ID: |
OLC2091993778 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2091993778 | ||
| 003 | DE-627 | ||
| 005 | 20230331090923.0 | ||
| 007 | tu | ||
| 008 | 230331s2013 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00291-013-0341-8 |2 doi | |
| 035 | |a (DE-627)OLC2091993778 | ||
| 035 | |a (DE-He213)s00291-013-0341-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 650 |q VZ |
| 082 | 0 | 4 | |a 650 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Bruns, Florian |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Robust load planning of trains in intermodal transportation |
| 264 | 1 | |c 2013 | |
| 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-Verlag Berlin Heidelberg 2013 | ||
| 520 | |a Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. | ||
| 650 | 4 | |a Load planning | |
| 650 | 4 | |a Intermodal transportation | |
| 650 | 4 | |a Robustness | |
| 650 | 4 | |a Strict robustness | |
| 650 | 4 | |a Adjustable robustness | |
| 700 | 1 | |a Goerigk, Marc |4 aut | |
| 700 | 1 | |a Knust, Sigrid |4 aut | |
| 700 | 1 | |a Schöbel, Anita |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t OR spectrum |d Springer Berlin Heidelberg, 2002 |g 36(2013), 3 vom: 06. Sept., Seite 631-668 |w (DE-627)343968762 |w (DE-600)2073885-7 |w (DE-576)097935891 |x 0171-6468 |7 nnns |
| 773 | 1 | 8 | |g volume:36 |g year:2013 |g number:3 |g day:06 |g month:09 |g pages:631-668 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00291-013-0341-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_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_130 | ||
| 912 | |a GBV_ILN_132 | ||
| 912 | |a GBV_ILN_185 | ||
| 912 | |a GBV_ILN_358 | ||
| 912 | |a GBV_ILN_673 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2020 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4029 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4247 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4333 | ||
| 951 | |a AR | ||
| 952 | |d 36 |j 2013 |e 3 |b 06 |c 09 |h 631-668 | ||
| author_variant |
f b fb m g mg s k sk a s as |
|---|---|
| matchkey_str |
article:01716468:2013----::outodlnigfrisnnemdl |
| hierarchy_sort_str |
2013 |
| publishDate |
2013 |
| allfields |
10.1007/s00291-013-0341-8 doi (DE-627)OLC2091993778 (DE-He213)s00291-013-0341-8-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Robust load planning of trains in intermodal transportation 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness Goerigk, Marc aut Knust, Sigrid aut Schöbel, Anita aut Enthalten in OR spectrum Springer Berlin Heidelberg, 2002 36(2013), 3 vom: 06. Sept., Seite 631-668 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:36 year:2013 number:3 day:06 month:09 pages:631-668 https://doi.org/10.1007/s00291-013-0341-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_20 GBV_ILN_22 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4247 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4333 AR 36 2013 3 06 09 631-668 |
| spelling |
10.1007/s00291-013-0341-8 doi (DE-627)OLC2091993778 (DE-He213)s00291-013-0341-8-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Robust load planning of trains in intermodal transportation 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness Goerigk, Marc aut Knust, Sigrid aut Schöbel, Anita aut Enthalten in OR spectrum Springer Berlin Heidelberg, 2002 36(2013), 3 vom: 06. Sept., Seite 631-668 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:36 year:2013 number:3 day:06 month:09 pages:631-668 https://doi.org/10.1007/s00291-013-0341-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_20 GBV_ILN_22 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4247 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4333 AR 36 2013 3 06 09 631-668 |
| allfields_unstemmed |
10.1007/s00291-013-0341-8 doi (DE-627)OLC2091993778 (DE-He213)s00291-013-0341-8-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Robust load planning of trains in intermodal transportation 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness Goerigk, Marc aut Knust, Sigrid aut Schöbel, Anita aut Enthalten in OR spectrum Springer Berlin Heidelberg, 2002 36(2013), 3 vom: 06. Sept., Seite 631-668 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:36 year:2013 number:3 day:06 month:09 pages:631-668 https://doi.org/10.1007/s00291-013-0341-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_20 GBV_ILN_22 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4247 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4333 AR 36 2013 3 06 09 631-668 |
| allfieldsGer |
10.1007/s00291-013-0341-8 doi (DE-627)OLC2091993778 (DE-He213)s00291-013-0341-8-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Robust load planning of trains in intermodal transportation 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness Goerigk, Marc aut Knust, Sigrid aut Schöbel, Anita aut Enthalten in OR spectrum Springer Berlin Heidelberg, 2002 36(2013), 3 vom: 06. Sept., Seite 631-668 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:36 year:2013 number:3 day:06 month:09 pages:631-668 https://doi.org/10.1007/s00291-013-0341-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_20 GBV_ILN_22 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4247 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4333 AR 36 2013 3 06 09 631-668 |
| allfieldsSound |
10.1007/s00291-013-0341-8 doi (DE-627)OLC2091993778 (DE-He213)s00291-013-0341-8-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Robust load planning of trains in intermodal transportation 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness Goerigk, Marc aut Knust, Sigrid aut Schöbel, Anita aut Enthalten in OR spectrum Springer Berlin Heidelberg, 2002 36(2013), 3 vom: 06. Sept., Seite 631-668 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:36 year:2013 number:3 day:06 month:09 pages:631-668 https://doi.org/10.1007/s00291-013-0341-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_20 GBV_ILN_22 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4247 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4333 AR 36 2013 3 06 09 631-668 |
| language |
English |
| source |
Enthalten in OR spectrum 36(2013), 3 vom: 06. Sept., Seite 631-668 volume:36 year:2013 number:3 day:06 month:09 pages:631-668 |
| sourceStr |
Enthalten in OR spectrum 36(2013), 3 vom: 06. Sept., Seite 631-668 volume:36 year:2013 number:3 day:06 month:09 pages:631-668 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness |
| dewey-raw |
650 |
| isfreeaccess_bool |
false |
| container_title |
OR spectrum |
| authorswithroles_txt_mv |
Bruns, Florian @@aut@@ Goerigk, Marc @@aut@@ Knust, Sigrid @@aut@@ Schöbel, Anita @@aut@@ |
| publishDateDaySort_date |
2013-09-06T00:00:00Z |
| hierarchy_top_id |
343968762 |
| dewey-sort |
3650 |
| id |
OLC2091993778 |
| 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">OLC2091993778</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331090923.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230331s2013 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00291-013-0341-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2091993778</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00291-013-0341-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">650</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</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">Bruns, Florian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust load planning of trains in intermodal transportation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</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-Verlag Berlin Heidelberg 2013</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Load planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intermodal transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robustness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Strict robustness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adjustable robustness</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goerigk, Marc</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Knust, Sigrid</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schöbel, Anita</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">OR spectrum</subfield><subfield code="d">Springer Berlin Heidelberg, 2002</subfield><subfield code="g">36(2013), 3 vom: 06. Sept., Seite 631-668</subfield><subfield code="w">(DE-627)343968762</subfield><subfield code="w">(DE-600)2073885-7</subfield><subfield code="w">(DE-576)097935891</subfield><subfield code="x">0171-6468</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:36</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:3</subfield><subfield code="g">day:06</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:631-668</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00291-013-0341-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_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_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</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_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_70</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_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_132</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_185</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_358</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_673</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">36</subfield><subfield code="j">2013</subfield><subfield code="e">3</subfield><subfield code="b">06</subfield><subfield code="c">09</subfield><subfield code="h">631-668</subfield></datafield></record></collection>
|
| author |
Bruns, Florian |
| spellingShingle |
Bruns, Florian ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Robustness misc Strict robustness misc Adjustable robustness Robust load planning of trains in intermodal transportation |
| authorStr |
Bruns, Florian |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)343968762 |
| format |
Article |
| dewey-ones |
650 - Management & auxiliary services |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0171-6468 |
| topic_title |
650 VZ 3,2 ssgn Robust load planning of trains in intermodal transportation Load planning Intermodal transportation Robustness Strict robustness Adjustable robustness |
| topic |
ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Robustness misc Strict robustness misc Adjustable robustness |
| topic_unstemmed |
ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Robustness misc Strict robustness misc Adjustable robustness |
| topic_browse |
ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Robustness misc Strict robustness misc Adjustable robustness |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
OR spectrum |
| hierarchy_parent_id |
343968762 |
| dewey-tens |
650 - Management & public relations |
| hierarchy_top_title |
OR spectrum |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 |
| title |
Robust load planning of trains in intermodal transportation |
| ctrlnum |
(DE-627)OLC2091993778 (DE-He213)s00291-013-0341-8-p |
| title_full |
Robust load planning of trains in intermodal transportation |
| author_sort |
Bruns, Florian |
| journal |
OR spectrum |
| journalStr |
OR spectrum |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2013 |
| contenttype_str_mv |
txt |
| container_start_page |
631 |
| author_browse |
Bruns, Florian Goerigk, Marc Knust, Sigrid Schöbel, Anita |
| container_volume |
36 |
| class |
650 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Bruns, Florian |
| doi_str_mv |
10.1007/s00291-013-0341-8 |
| dewey-full |
650 |
| title_sort |
robust load planning of trains in intermodal transportation |
| title_auth |
Robust load planning of trains in intermodal transportation |
| abstract |
Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. © Springer-Verlag Berlin Heidelberg 2013 |
| abstractGer |
Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. © Springer-Verlag Berlin Heidelberg 2013 |
| abstract_unstemmed |
Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. © Springer-Verlag Berlin Heidelberg 2013 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_20 GBV_ILN_22 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4247 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4333 |
| container_issue |
3 |
| title_short |
Robust load planning of trains in intermodal transportation |
| url |
https://doi.org/10.1007/s00291-013-0341-8 |
| remote_bool |
false |
| author2 |
Goerigk, Marc Knust, Sigrid Schöbel, Anita |
| author2Str |
Goerigk, Marc Knust, Sigrid Schöbel, Anita |
| ppnlink |
343968762 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00291-013-0341-8 |
| up_date |
2024-07-04T10:54:19.265Z |
| _version_ |
1803645573418450944 |
| 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">OLC2091993778</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331090923.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230331s2013 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00291-013-0341-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2091993778</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00291-013-0341-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">650</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</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">Bruns, Florian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust load planning of trains in intermodal transportation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</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-Verlag Berlin Heidelberg 2013</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Load planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intermodal transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robustness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Strict robustness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adjustable robustness</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goerigk, Marc</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Knust, Sigrid</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schöbel, Anita</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">OR spectrum</subfield><subfield code="d">Springer Berlin Heidelberg, 2002</subfield><subfield code="g">36(2013), 3 vom: 06. Sept., Seite 631-668</subfield><subfield code="w">(DE-627)343968762</subfield><subfield code="w">(DE-600)2073885-7</subfield><subfield code="w">(DE-576)097935891</subfield><subfield code="x">0171-6468</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:36</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:3</subfield><subfield code="g">day:06</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:631-668</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00291-013-0341-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_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_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</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_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_70</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_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_132</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_185</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_358</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_673</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">36</subfield><subfield code="j">2013</subfield><subfield code="e">3</subfield><subfield code="b">06</subfield><subfield code="c">09</subfield><subfield code="h">631-668</subfield></datafield></record></collection>
|
| score |
7.3975964 |