The online dial a ride problem under reasonable load:
Abstract: "In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time peri...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1999
|
| Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1999,8 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp. average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis." |
| Beschreibung: | 9 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012576422 | ||
| 003 | DE-604 | ||
| 005 | 20031112 | ||
| 007 | t| | ||
| 008 | 990518s1999 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 956285767 |2 DE-101 | |
| 035 | |a (OCoLC)43565100 | ||
| 035 | |a (DE-599)BVBBV012576422 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-703 | ||
| 100 | 1 | |a Hauptmeier, Dietrich |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The online dial a ride problem under reasonable load |c Dietrich Hauptmeier ; Sven O. Krumke ; Jörg Rambau |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1999 | |
| 300 | |a 9 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 1999,8 | |
| 520 | 3 | |a Abstract: "In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp. average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis." | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Transportation problems (Programming) | |
| 700 | 1 | |a Krumke, Sven O. |e Verfasser |0 (DE-588)135671175 |4 aut | |
| 700 | 1 | |a Rambau, Jörg |d 1966- |e Verfasser |0 (DE-588)115478515 |4 aut | |
| 810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1999,8 |w (DE-604)BV004801715 |9 1999,8 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008540676 | |
Datensatz im Suchindex
| _version_ | 1820882503499513856 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Hauptmeier, Dietrich Krumke, Sven O. Rambau, Jörg 1966- |
| author_GND | (DE-588)135671175 (DE-588)115478515 |
| author_facet | Hauptmeier, Dietrich Krumke, Sven O. Rambau, Jörg 1966- |
| author_role | aut aut aut |
| author_sort | Hauptmeier, Dietrich |
| author_variant | d h dh s o k so sok j r jr |
| building | Verbundindex |
| bvnumber | BV012576422 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)43565100 (DE-599)BVBBV012576422 |
| 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">BV012576422</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031112</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">990518s1999 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">956285767</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)43565100</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012576422</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hauptmeier, Dietrich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The online dial a ride problem under reasonable load</subfield><subfield code="c">Dietrich Hauptmeier ; Sven O. Krumke ; Jörg Rambau</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">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">1999,8</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp. average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transportation problems (Programming)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Krumke, Sven O.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135671175</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rambau, Jörg</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115478515</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">1999,8</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1999,8</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008540676</subfield></datafield></record></collection> |
| id | DE-604.BV012576422 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:07:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008540676 |
| oclc_num | 43565100 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 9 S. graph. Darst. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| spelling | Hauptmeier, Dietrich Verfasser aut The online dial a ride problem under reasonable load Dietrich Hauptmeier ; Sven O. Krumke ; Jörg Rambau Berlin Konrad-Zuse-Zentrum für Informationstechnik 1999 9 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1999,8 Abstract: "In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp. average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis." Computer algorithms Transportation problems (Programming) Krumke, Sven O. Verfasser (DE-588)135671175 aut Rambau, Jörg 1966- Verfasser (DE-588)115478515 aut Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1999,8 (DE-604)BV004801715 1999,8 |
| spellingShingle | Hauptmeier, Dietrich Krumke, Sven O. Rambau, Jörg 1966- The online dial a ride problem under reasonable load Computer algorithms Transportation problems (Programming) |
| title | The online dial a ride problem under reasonable load |
| title_auth | The online dial a ride problem under reasonable load |
| title_exact_search | The online dial a ride problem under reasonable load |
| title_full | The online dial a ride problem under reasonable load Dietrich Hauptmeier ; Sven O. Krumke ; Jörg Rambau |
| title_fullStr | The online dial a ride problem under reasonable load Dietrich Hauptmeier ; Sven O. Krumke ; Jörg Rambau |
| title_full_unstemmed | The online dial a ride problem under reasonable load Dietrich Hauptmeier ; Sven O. Krumke ; Jörg Rambau |
| title_short | The online dial a ride problem under reasonable load |
| title_sort | the online dial a ride problem under reasonable load |
| topic | Computer algorithms Transportation problems (Programming) |
| topic_facet | Computer algorithms Transportation problems (Programming) |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT hauptmeierdietrich theonlinedialarideproblemunderreasonableload AT krumkesveno theonlinedialarideproblemunderreasonableload AT rambaujorg theonlinedialarideproblemunderreasonableload |