Recent computational developments for large scale multiple depot vehicle scheduling problems:
Abstract: "This paper presents an integer linear programming approach with delayed column generation for the NP-hard Multiple-Depot Vehicle Scheduling Problem (MDVSP) in public mass transit. We describe in detail all basic ingredients of our approach that are indispensable to solve truly large-...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1997
|
| Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1997,17 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents an integer linear programming approach with delayed column generation for the NP-hard Multiple-Depot Vehicle Scheduling Problem (MDVSP) in public mass transit. We describe in detail all basic ingredients of our approach that are indispensable to solve truly large-scale real-world instances to optimality, and we report on computational investigations that are based on real-world instances from the city of Berlin, the city of Hamburg, and the region around Hamburg. These real-world instances have up to 25 thousand timetabled trips and 70 million dead-head trips. Computational tests using the data of the Hamburger Hochbahn AG indicate savings of several vehicles and a cost reduction of about 10% compared with the solution provided by HOT II, the vehicle scheduling tool of the HanseCom GmbH, Hamburg. Parts of our algorithms are already integrated in the BERTA system of the Berliner Verkehrsbetriebe (BVG) and will soon be integrated in the MICROBUS system of the Gesellschaft für Informatik, Verkehrs- und Umweltplanung mbH (IVU), Berlin." |
| Beschreibung: | 21 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV017189076 | ||
| 003 | DE-604 | ||
| 005 | 20031007 | ||
| 007 | t| | ||
| 008 | 030604s1997 xx ||||z00||| eng d | ||
| 035 | |a (OCoLC)37991500 | ||
| 035 | |a (DE-599)BVBBV017189076 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-188 | ||
| 100 | 1 | |a Löbel, Andreas |d 1967- |e Verfasser |0 (DE-588)120072386 |4 aut | |
| 245 | 1 | 0 | |a Recent computational developments for large scale multiple depot vehicle scheduling problems |c Andreas Löbel |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1997 | |
| 300 | |a 21 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |v 1997,17 | |
| 520 | 3 | |a Abstract: "This paper presents an integer linear programming approach with delayed column generation for the NP-hard Multiple-Depot Vehicle Scheduling Problem (MDVSP) in public mass transit. We describe in detail all basic ingredients of our approach that are indispensable to solve truly large-scale real-world instances to optimality, and we report on computational investigations that are based on real-world instances from the city of Berlin, the city of Hamburg, and the region around Hamburg. These real-world instances have up to 25 thousand timetabled trips and 70 million dead-head trips. Computational tests using the data of the Hamburger Hochbahn AG indicate savings of several vehicles and a cost reduction of about 10% compared with the solution provided by HOT II, the vehicle scheduling tool of the HanseCom GmbH, Hamburg. Parts of our algorithms are already integrated in the BERTA system of the Berliner Verkehrsbetriebe (BVG) and will soon be integrated in the MICROBUS system of the Gesellschaft für Informatik, Verkehrs- und Umweltplanung mbH (IVU), Berlin." | |
| 650 | 4 | |a Integer programming | |
| 650 | 4 | |a Linear programming | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Transportation |z Germany |z Hamburg | |
| 651 | 4 | |a Deutschland | |
| 810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1997,17 |w (DE-604)BV004801715 |9 1997,17 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010360063 | |
Datensatz im Suchindex
| _version_ | 1820882518687088640 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Löbel, Andreas 1967- |
| author_GND | (DE-588)120072386 |
| author_facet | Löbel, Andreas 1967- |
| author_role | aut |
| author_sort | Löbel, Andreas 1967- |
| author_variant | a l al |
| building | Verbundindex |
| bvnumber | BV017189076 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)37991500 (DE-599)BVBBV017189076 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV017189076</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031007</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030604s1997 xx ||||z00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37991500</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017189076</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Löbel, Andreas</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120072386</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recent computational developments for large scale multiple depot vehicle scheduling problems</subfield><subfield code="c">Andreas Löbel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="v">1997,17</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents an integer linear programming approach with delayed column generation for the NP-hard Multiple-Depot Vehicle Scheduling Problem (MDVSP) in public mass transit. We describe in detail all basic ingredients of our approach that are indispensable to solve truly large-scale real-world instances to optimality, and we report on computational investigations that are based on real-world instances from the city of Berlin, the city of Hamburg, and the region around Hamburg. These real-world instances have up to 25 thousand timetabled trips and 70 million dead-head trips. Computational tests using the data of the Hamburger Hochbahn AG indicate savings of several vehicles and a cost reduction of about 10% compared with the solution provided by HOT II, the vehicle scheduling tool of the HanseCom GmbH, Hamburg. Parts of our algorithms are already integrated in the BERTA system of the Berliner Verkehrsbetriebe (BVG) and will soon be integrated in the MICROBUS system of the Gesellschaft für Informatik, Verkehrs- und Umweltplanung mbH (IVU), Berlin."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transportation</subfield><subfield code="z">Germany</subfield><subfield code="z">Hamburg</subfield></datafield><datafield tag="651" ind1=" " ind2="4"><subfield code="a">Deutschland</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="t">Preprint SC</subfield><subfield code="v">1997,17</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1997,17</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010360063</subfield></datafield></record></collection> |
| geographic | Deutschland |
| geographic_facet | Deutschland |
| id | DE-604.BV017189076 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T17:08:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010360063 |
| oclc_num | 37991500 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | 21 S. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| spelling | Löbel, Andreas 1967- Verfasser (DE-588)120072386 aut Recent computational developments for large scale multiple depot vehicle scheduling problems Andreas Löbel Berlin Konrad-Zuse-Zentrum für Informationstechnik 1997 21 S. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1997,17 Abstract: "This paper presents an integer linear programming approach with delayed column generation for the NP-hard Multiple-Depot Vehicle Scheduling Problem (MDVSP) in public mass transit. We describe in detail all basic ingredients of our approach that are indispensable to solve truly large-scale real-world instances to optimality, and we report on computational investigations that are based on real-world instances from the city of Berlin, the city of Hamburg, and the region around Hamburg. These real-world instances have up to 25 thousand timetabled trips and 70 million dead-head trips. Computational tests using the data of the Hamburger Hochbahn AG indicate savings of several vehicles and a cost reduction of about 10% compared with the solution provided by HOT II, the vehicle scheduling tool of the HanseCom GmbH, Hamburg. Parts of our algorithms are already integrated in the BERTA system of the Berliner Verkehrsbetriebe (BVG) and will soon be integrated in the MICROBUS system of the Gesellschaft für Informatik, Verkehrs- und Umweltplanung mbH (IVU), Berlin." Integer programming Linear programming Network analysis (Planning) Transportation Germany Hamburg Deutschland Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1997,17 (DE-604)BV004801715 1997,17 |
| spellingShingle | Löbel, Andreas 1967- Recent computational developments for large scale multiple depot vehicle scheduling problems Integer programming Linear programming Network analysis (Planning) Transportation Germany Hamburg |
| title | Recent computational developments for large scale multiple depot vehicle scheduling problems |
| title_auth | Recent computational developments for large scale multiple depot vehicle scheduling problems |
| title_exact_search | Recent computational developments for large scale multiple depot vehicle scheduling problems |
| title_full | Recent computational developments for large scale multiple depot vehicle scheduling problems Andreas Löbel |
| title_fullStr | Recent computational developments for large scale multiple depot vehicle scheduling problems Andreas Löbel |
| title_full_unstemmed | Recent computational developments for large scale multiple depot vehicle scheduling problems Andreas Löbel |
| title_short | Recent computational developments for large scale multiple depot vehicle scheduling problems |
| title_sort | recent computational developments for large scale multiple depot vehicle scheduling problems |
| topic | Integer programming Linear programming Network analysis (Planning) Transportation Germany Hamburg |
| topic_facet | Integer programming Linear programming Network analysis (Planning) Transportation Germany Hamburg Deutschland |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT lobelandreas recentcomputationaldevelopmentsforlargescalemultipledepotvehicleschedulingproblems |