Optimized load planning of trains in intermodal transportation

Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to p...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Bruns, Florian [verfasserIn] Knust, Sigrid

Format:	Artikel
Sprache:	Englisch

Erschienen:	2010

Schlagwörter:	Load planning Intermodal transportation Integer linear programming

Anmerkung:	© Springer-Verlag 2010

Übergeordnetes Werk:	Enthalten in: OR spectrum - Springer-Verlag, 2002, 34(2010), 3 vom: 23. Dez., Seite 511-533
Übergeordnetes Werk:	volume:34 ; year:2010 ; number:3 ; day:23 ; month:12 ; pages:511-533

Links:	Volltext

DOI / URN:	10.1007/s00291-010-0232-1

Katalog-ID:	OLC2091991937

Internformat


LEADER	01000naa a22002652 4500
001	OLC2091991937
003	DE-627
005	20230331090832.0
007	tu
008	230331s2010 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/s00291-010-0232-1 \|2 doi
035			\|a (DE-627)OLC2091991937
035			\|a (DE-He213)s00291-010-0232-1-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 Optimized load planning of trains in intermodal transportation
264		1	\|c 2010
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 2010
520			\|a Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time.
650		4	\|a Load planning
650		4	\|a Intermodal transportation
650		4	\|a Integer linear programming
700	1		\|a Knust, Sigrid \|4 aut
773	0	8	\|i Enthalten in \|t OR spectrum \|d Springer-Verlag, 2002 \|g 34(2010), 3 vom: 23. Dez., Seite 511-533 \|w (DE-627)343968762 \|w (DE-600)2073885-7 \|w (DE-576)097935891 \|x 0171-6468 \|7 nnns
773	1	8	\|g volume:34 \|g year:2010 \|g number:3 \|g day:23 \|g month:12 \|g pages:511-533
856	4	1	\|u https://doi.org/10.1007/s00291-010-0232-1 \|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_65
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_187
912			\|a GBV_ILN_358
912			\|a GBV_ILN_673
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2006
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_4307
912			\|a GBV_ILN_4311
912			\|a GBV_ILN_4317
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4333
951			\|a AR
952			\|d 34 \|j 2010 \|e 3 \|b 23 \|c 12 \|h 511-533

Indexfelder

author_variant	f b fb s k sk
matchkey_str	article:01716468:2010----::piielapannotaniitro
hierarchy_sort_str	2010
publishDate	2010
allfields	10.1007/s00291-010-0232-1 doi (DE-627)OLC2091991937 (DE-He213)s00291-010-0232-1-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Optimized load planning of trains in intermodal transportation 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. Load planning Intermodal transportation Integer linear programming Knust, Sigrid aut Enthalten in OR spectrum Springer-Verlag, 2002 34(2010), 3 vom: 23. Dez., Seite 511-533 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:34 year:2010 number:3 day:23 month:12 pages:511-533 https://doi.org/10.1007/s00291-010-0232-1 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_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_187 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2004 GBV_ILN_2006 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_4307 GBV_ILN_4311 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4326 GBV_ILN_4333 AR 34 2010 3 23 12 511-533
spelling	10.1007/s00291-010-0232-1 doi (DE-627)OLC2091991937 (DE-He213)s00291-010-0232-1-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Optimized load planning of trains in intermodal transportation 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. Load planning Intermodal transportation Integer linear programming Knust, Sigrid aut Enthalten in OR spectrum Springer-Verlag, 2002 34(2010), 3 vom: 23. Dez., Seite 511-533 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:34 year:2010 number:3 day:23 month:12 pages:511-533 https://doi.org/10.1007/s00291-010-0232-1 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_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_187 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2004 GBV_ILN_2006 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_4307 GBV_ILN_4311 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4326 GBV_ILN_4333 AR 34 2010 3 23 12 511-533
allfields_unstemmed	10.1007/s00291-010-0232-1 doi (DE-627)OLC2091991937 (DE-He213)s00291-010-0232-1-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Optimized load planning of trains in intermodal transportation 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. Load planning Intermodal transportation Integer linear programming Knust, Sigrid aut Enthalten in OR spectrum Springer-Verlag, 2002 34(2010), 3 vom: 23. Dez., Seite 511-533 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:34 year:2010 number:3 day:23 month:12 pages:511-533 https://doi.org/10.1007/s00291-010-0232-1 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_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_187 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2004 GBV_ILN_2006 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_4307 GBV_ILN_4311 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4326 GBV_ILN_4333 AR 34 2010 3 23 12 511-533
allfieldsGer	10.1007/s00291-010-0232-1 doi (DE-627)OLC2091991937 (DE-He213)s00291-010-0232-1-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Optimized load planning of trains in intermodal transportation 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. Load planning Intermodal transportation Integer linear programming Knust, Sigrid aut Enthalten in OR spectrum Springer-Verlag, 2002 34(2010), 3 vom: 23. Dez., Seite 511-533 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:34 year:2010 number:3 day:23 month:12 pages:511-533 https://doi.org/10.1007/s00291-010-0232-1 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_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_187 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2004 GBV_ILN_2006 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_4307 GBV_ILN_4311 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4326 GBV_ILN_4333 AR 34 2010 3 23 12 511-533
allfieldsSound	10.1007/s00291-010-0232-1 doi (DE-627)OLC2091991937 (DE-He213)s00291-010-0232-1-p DE-627 ger DE-627 rakwb eng 650 VZ 650 VZ 3,2 ssgn Bruns, Florian verfasserin aut Optimized load planning of trains in intermodal transportation 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. Load planning Intermodal transportation Integer linear programming Knust, Sigrid aut Enthalten in OR spectrum Springer-Verlag, 2002 34(2010), 3 vom: 23. Dez., Seite 511-533 (DE-627)343968762 (DE-600)2073885-7 (DE-576)097935891 0171-6468 nnns volume:34 year:2010 number:3 day:23 month:12 pages:511-533 https://doi.org/10.1007/s00291-010-0232-1 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_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_187 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2004 GBV_ILN_2006 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_4307 GBV_ILN_4311 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4326 GBV_ILN_4333 AR 34 2010 3 23 12 511-533
language	English
source	Enthalten in OR spectrum 34(2010), 3 vom: 23. Dez., Seite 511-533 volume:34 year:2010 number:3 day:23 month:12 pages:511-533
sourceStr	Enthalten in OR spectrum 34(2010), 3 vom: 23. Dez., Seite 511-533 volume:34 year:2010 number:3 day:23 month:12 pages:511-533
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Load planning Intermodal transportation Integer linear programming
dewey-raw	650
isfreeaccess_bool	false
container_title	OR spectrum
authorswithroles_txt_mv	Bruns, Florian @@aut@@ Knust, Sigrid @@aut@@
publishDateDaySort_date	2010-12-23T00:00:00Z
hierarchy_top_id	343968762
dewey-sort	3650
id	OLC2091991937
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">OLC2091991937</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331090832.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230331s2010 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00291-010-0232-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2091991937</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00291-010-0232-1-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">Optimized load planning of trains in intermodal transportation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</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 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time.</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">Integer linear programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Knust, Sigrid</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-Verlag, 2002</subfield><subfield code="g">34(2010), 3 vom: 23. Dez., Seite 511-533</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:34</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:3</subfield><subfield code="g">day:23</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:511-533</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00291-010-0232-1</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_65</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_187</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_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</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_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</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_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</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_4326</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">34</subfield><subfield code="j">2010</subfield><subfield code="e">3</subfield><subfield code="b">23</subfield><subfield code="c">12</subfield><subfield code="h">511-533</subfield></datafield></record></collection>
author	Bruns, Florian
spellingShingle	Bruns, Florian ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Integer linear programming Optimized 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
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0171-6468
topic_title	650 VZ 3,2 ssgn Optimized load planning of trains in intermodal transportation Load planning Intermodal transportation Integer linear programming
topic	ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Integer linear programming
topic_unstemmed	ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Integer linear programming
topic_browse	ddc 650 ssgn 3,2 misc Load planning misc Intermodal transportation misc Integer linear programming
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	Optimized load planning of trains in intermodal transportation
ctrlnum	(DE-627)OLC2091991937 (DE-He213)s00291-010-0232-1-p
title_full	Optimized 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	2010
contenttype_str_mv	txt
container_start_page	511
author_browse	Bruns, Florian Knust, Sigrid
container_volume	34
class	650 VZ 3,2 ssgn
format_se	Aufsätze
author-letter	Bruns, Florian
doi_str_mv	10.1007/s00291-010-0232-1
dewey-full	650
title_sort	optimized load planning of trains in intermodal transportation
title_auth	Optimized load planning of trains in intermodal transportation
abstract	Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. © Springer-Verlag 2010
abstractGer	Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. © Springer-Verlag 2010
abstract_unstemmed	Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time. © Springer-Verlag 2010
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_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_110 GBV_ILN_130 GBV_ILN_132 GBV_ILN_185 GBV_ILN_187 GBV_ILN_358 GBV_ILN_673 GBV_ILN_2004 GBV_ILN_2006 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_4307 GBV_ILN_4311 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4326 GBV_ILN_4333
container_issue	3
title_short	Optimized load planning of trains in intermodal transportation
url	https://doi.org/10.1007/s00291-010-0232-1
remote_bool	false
author2	Knust, Sigrid
author2Str	Knust, Sigrid
ppnlink	343968762
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/s00291-010-0232-1
up_date	2024-07-04T10:53:57.514Z
_version_	1803645550609825793
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">OLC2091991937</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331090832.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230331s2010 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00291-010-0232-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2091991937</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00291-010-0232-1-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">Optimized load planning of trains in intermodal transportation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</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 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper the problem of load planning for trains in intermodal container terminals is studied. The objective is to 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. Contrary to previous approaches additionally weight restrictions for the wagons are integrated into our model. We present three different integer linear programming formulations and test them on some real-world instances. It is shown that even non-commercial MIP-solvers can solve our models to optimality in reasonable time.</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">Integer linear programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Knust, Sigrid</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-Verlag, 2002</subfield><subfield code="g">34(2010), 3 vom: 23. Dez., Seite 511-533</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:34</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:3</subfield><subfield code="g">day:23</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:511-533</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00291-010-0232-1</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_65</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_187</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_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</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_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</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_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</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_4326</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">34</subfield><subfield code="j">2010</subfield><subfield code="e">3</subfield><subfield code="b">23</subfield><subfield code="c">12</subfield><subfield code="h">511-533</subfield></datafield></record></collection>
score	7.3992643

Nicht das Richtige dabei?

Schreiben Sie uns!

Optimized load planning of trains in intermodal transportation

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?