2026-09-19T00:31:56Zhttps://elekpub.bib.uni-wuppertal.de/oai/

oai:elekpub.bib.uni-wuppertal.de:75394172024-05-24T11:00:05ZubwhsoaDoctoralThesis

vls/2603noah-balancer_mdapi1elekpub.bib.uni-wuppertal.devdExact and heuristic methods for dial-a-ride problemsGaul, Daniela1995-VerfasserautKlamroth, Kathrin1968-Akademischer BetreuerdgsStiglmayr, MichaelAkademischer BetreuerdgsSchmidt, Marie Elisabeth1985-Akademischer BetreuerdgsBergische Universität WuppertalGrad-verleihende InstitutiondggtextthesisTextHochschulschriftthesisdoctoralThesisgwXA-DEWuppertalDezember 20232023single unitengelectronic resourceremotetext/htmltext/html1 Online-Ressource (156 Seiten) : Diagramme, KartenComputerOnline-RessourceThe dial-a-ride problem (DARP) consists of two interrelated tasks: on the one hand, a series of transport requests defined by origin, destination, number of seats as well as time windows and ride time need to be assigned to a set of vehicles routes and on the other hand, vehicle schedules need to be computed, both while minimizing a given objective function. State-of-the-art MILP formulations for the DARP are based on binary variables which indicate whether two locations are visited directly after each other. In contrast to these location-based formulations, we propose the concept of event-based modeling. In the resulting event-based (EB) formulation, capacity, pairing and precedence constraints are implicitly encoded. We show that this formulation outperforms the location-based formulations from the literature. Next, the EB MILP is combined with a location-based formulation into a location-augmented-event-based (LAEB) MILP, whose superiority is proven theoretically and computationally. Under the assumption that time windows imply a unique pairwise ordering of locations and other conditions, the LAEB formulation is integral. Ultimately, the concept of event-based modeling is transferred to the dynamic DARP by iteratively solving the EB formulation in a rolling-horizon algorithm, resulting in optimal insertion positions in 99.5% of all iterations on real-life instances.vorgelegt von Daniela GaulBergische Universität Wuppertal, Dissertation, 2024Wuppertal510urn:nbn:de:hbz:468-2-229910.25926/BUW/0-30399374037479206441Exact and heuristic methods for dial-a-ride problemsGaul, Daniela, 1995-Druck-AusgabeHT030768910http://dx.doi.org/10.25926/BUW/0-303https://nbn-resolving.org/urn:nbn:de:hbz:468-2-2299Open AccessRS INC 1.02024-03-18oaDoctoralThesispublicrda24052120251111100825.0CT009000242s2w-hsswupubwgerUBW:C:C.01 https://elekpub.bib.uni-wuppertal.de//domainresource/static/graphics/connectors/viewerLogo.gifWuppertal : Bergische Universität Wuppertalreserved https://ub-wuppertal.digibib.net/search/katalog/record/(DE-605)urn%3Anbn%3Ade%3Ahbz%3A468-2-2299 https://elekpub.bib.uni-wuppertal.de/id/7539417 https://elekpub.bib.uni-wuppertal.de/i3f/v20/7539417/manifest https://elekpub.bib.uni-wuppertal.de/proto_ftsearch/7539417