Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • 1995-1999  (5)
  • 1996  (5)
Datenquelle
Materialart
Erscheinungszeitraum
  • 1995-1999  (5)
Jahr
Person/Organisation
Schlagwörter
Sprache
  • 1
    Buch
    Buch
    Lagrangean Relaxations and Subgradient Methods for Multiple-Depot Vehicle Scheduling Problems /; Preprint SC 96-22 (1996)
    Berlin :Konrad-Zuse-Zentrum für Informationstechnik,
    Details
    Titel: Lagrangean Relaxations and Subgradient Methods for Multiple-Depot Vehicle Scheduling Problems /; Preprint SC 96-22
    Autor: Kokott, Andreas
    Beteiligte Person(en): Löbel, Andreas
    Verlag: Berlin :Konrad-Zuse-Zentrum für Informationstechnik,
    Erscheinungsjahr: 1996
    Seiten: 24 S.
    Serie: Preprint / Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 96-22
    ISSN: 0933-7911
    Materialart: Buch
    Sprache: Englisch
    URL: http://www.zib.de/Publications/Reports/SC-96-22.pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    ZIB Katalog
    Zuse-Institut Berlin get availability status
  • 2
    facet.materialart.
    Unbekannt
    Optimierung des Fahrzeugumlaufs im Öffentlichen Nahverkehr (1996)
    Details
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper addresses the problem of scheduling vehicles in a public mass transportation system. We show how this problem can be modelled as a special multicommodity flow problem and outline the solution methodology we have developed. Based on polyhedral investigations, we have designed and implemented a branch&cut algorithm and various heuristics with which real vehicle scheduling problems of truely large scale can be solved to optimality. We describe some implementation issues and report computational results.
    Schlagwort(e): ddc:000
    Sprache: Deutsch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 3
    facet.materialart.
    Unbekannt
    Solving Large-Scale Real-World Minimum-Cost Flow Problems by a Network Simplex Method (1996)
    Details
    Publikationsdatum: 2014-11-02
    Beschreibung: This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisions. The real-world test sets include minimum-cost flow problems that are based on single-depot vehicle scheduling problems and on a Lagrangean relaxation of multiple-depot vehicle scheduling problems. Some of the problems are extremely large with up to 42,000 nodes and 20,000,000 arcs. The standard test problems are generated with NETGEN and include parts of the DIMACS standard problems. Our network simplex code is compared with \mbox{RELAX-IV}, Cost Scaling 2 version 3.4, and CPLEX's network solver NETOPT.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 4
    facet.materialart.
    Unbekannt
    Lagrangean Relaxations and Subgradient Methods for Multiple-Depot Vehicle Scheduling Problems (1996)
    Details
    Publikationsdatum: 2014-11-02
    Beschreibung: This paper presents two Lagrangean relaxation approaches for the {\em 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.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 5
    facet.materialart.
    Unbekannt
    Vehicle Scheduling in Public Transit and Lagrangean Pricing (1996)
    Details
    Publikationsdatum: 2014-11-02
    Beschreibung: This paper investigates the solution of the linear programming (LP) relaxation of the multicommodity flow formulation of the multiple-depot vehicle scheduling problems arising in public mass transit. We develop a column generation technique that makes it possible to solve the huge linear programs that come up there. The technique, which we call {\em Lagrangean pricing}, is based on two different Lagrangean relaxations. We describe in detail the basic ingredients of our approach and give computational results for large-scale test data (with up to 70 million variables) from three German public transportation companies. Because of these results, we propose Lagrangean pricing as one of the basic ingredients of an effective method to solve multiple-depot vehicle scheduling problems to proven optimality.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...