Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems:
Abstract: "This paper presents two Lagrangean relaxation approaches for the NP-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to comput...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1996
|
| Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1996,22 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents two Lagrangean relaxation approaches for the NP-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to compute feasible solutions efficiently. A further application is to use the Lagrangean relaxations as new pricing strategies for a delayed column generation of a branch-and-cut approach. The computational investigations are based on real-world test sets from the cities of Berlin and Hamburg having up to 25 thousand timetabled trips and 70 million dead-head trips." |
| Beschreibung: | 19 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV017186512 | ||
| 003 | DE-604 | ||
| 005 | 20031002 | ||
| 007 | t| | ||
| 008 | 030603s1996 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)37991479 | ||
| 035 | |a (DE-599)BVBBV017186512 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 100 | 1 | |a Kokott, Andreas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems |c Andreas Kokott ; Andreas Löbel |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1996 | |
| 300 | |a 19 S. |b graph. Darst. | ||
| 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 1996,22 | |
| 520 | 3 | |a Abstract: "This paper presents two Lagrangean relaxation approaches for the NP-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to compute feasible solutions efficiently. A further application is to use the Lagrangean relaxations as new pricing strategies for a delayed column generation of a branch-and-cut approach. The computational investigations are based on real-world test sets from the cities of Berlin and Hamburg having up to 25 thousand timetabled trips and 70 million dead-head trips." | |
| 650 | 4 | |a Lagrange equations | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Relaxation methods (Mathematics) | |
| 650 | 4 | |a Transportation |z Germany | |
| 651 | 4 | |a Deutschland | |
| 700 | 1 | |a Löbel, Andreas |d 1967- |e Verfasser |0 (DE-588)120072386 |4 aut | |
| 810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1996,22 |w (DE-604)BV004801715 |9 1996,22 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010357707 | |
Datensatz im Suchindex
| _version_ | 1820882503710277632 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Kokott, Andreas Löbel, Andreas 1967- |
| author_GND | (DE-588)120072386 |
| author_facet | Kokott, Andreas Löbel, Andreas 1967- |
| author_role | aut aut |
| author_sort | Kokott, Andreas |
| author_variant | a k ak a l al |
| building | Verbundindex |
| bvnumber | BV017186512 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)37991479 (DE-599)BVBBV017186512 |
| 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">BV017186512</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031002</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030603s1996 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37991479</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017186512</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kokott, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems</subfield><subfield code="c">Andreas Kokott ; 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">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 S.</subfield><subfield code="b">graph. Darst.</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">1996,22</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents two Lagrangean relaxation approaches for the NP-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to compute feasible solutions efficiently. A further application is to use the Lagrangean relaxations as new pricing strategies for a delayed column generation of a branch-and-cut approach. The computational investigations are based on real-world test sets from the cities of Berlin and Hamburg having up to 25 thousand timetabled trips and 70 million dead-head trips."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lagrange equations</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">Relaxation methods (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transportation</subfield><subfield code="z">Germany</subfield></datafield><datafield tag="651" ind1=" " ind2="4"><subfield code="a">Deutschland</subfield></datafield><datafield tag="700" 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="810" ind1="2" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="t">Preprint SC</subfield><subfield code="v">1996,22</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1996,22</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010357707</subfield></datafield></record></collection> |
| geographic | Deutschland |
| geographic_facet | Deutschland |
| id | DE-604.BV017186512 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:07:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010357707 |
| oclc_num | 37991479 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 19 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| spelling | Kokott, Andreas Verfasser aut Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems Andreas Kokott ; Andreas Löbel Berlin Konrad-Zuse-Zentrum für Informationstechnik 1996 19 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1996,22 Abstract: "This paper presents two Lagrangean relaxation approaches for the NP-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to compute feasible solutions efficiently. A further application is to use the Lagrangean relaxations as new pricing strategies for a delayed column generation of a branch-and-cut approach. The computational investigations are based on real-world test sets from the cities of Berlin and Hamburg having up to 25 thousand timetabled trips and 70 million dead-head trips." Lagrange equations Network analysis (Planning) Relaxation methods (Mathematics) Transportation Germany Deutschland Löbel, Andreas 1967- Verfasser (DE-588)120072386 aut Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1996,22 (DE-604)BV004801715 1996,22 |
| spellingShingle | Kokott, Andreas Löbel, Andreas 1967- Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems Lagrange equations Network analysis (Planning) Relaxation methods (Mathematics) Transportation Germany |
| title | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems |
| title_auth | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems |
| title_exact_search | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems |
| title_full | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems Andreas Kokott ; Andreas Löbel |
| title_fullStr | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems Andreas Kokott ; Andreas Löbel |
| title_full_unstemmed | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems Andreas Kokott ; Andreas Löbel |
| title_short | Lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems |
| title_sort | lagrangean relaxations and subgradient methods for multiple depot vehicle scheduling problems |
| topic | Lagrange equations Network analysis (Planning) Relaxation methods (Mathematics) Transportation Germany |
| topic_facet | Lagrange equations Network analysis (Planning) Relaxation methods (Mathematics) Transportation Germany Deutschland |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT kokottandreas lagrangeanrelaxationsandsubgradientmethodsformultipledepotvehicleschedulingproblems AT lobelandreas lagrangeanrelaxationsandsubgradientmethodsformultipledepotvehicleschedulingproblems |