Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for subject:(Destroy AND Repair). One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Delft University of Technology

1. Janssens de Bisthoven, Sébastien (author). A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers.

Degree: 2020, Delft University of Technology

Automated vehicles have the potential to create a future in which most cars are shared instead of being individually owned and used. The advantages of vehicle sharing are expected to be multiple: reduced traffic, freed-up parking space, safer trips and a lower environmental impact of traveling. The dial-a-ride problem with transfers (DARP-T) consists in finding a set of minimum cost routes that satisfies a set of transportation requests. Requests may share a vehicle and may be transferred from one vehicle to another at any node during their journey. In this thesis, we describe a heuristic solving moderate to large instances of the static heterogeneous DARP-T in which the requests have demanding time constraints. The heuristic builds a solution in a constructive greedy randomized procedure and subsequently improves it with a destroy and repair procedure. The heuristic is tested on instances we randomly generated containing up to 1000 requests traveling between any two of the 100 most populated cities in the Netherlands inside a four-hour timescale. These instances are also solved without transfers to determine the benefits transfers can bring and the user inconvenience they may cause. We also investigate the influence of the demand on the objective function value, look into the influence of the fleet size on the fleet usage, and present some visualizations of the solutions found.

Applied Mathematics

Advisors/Committee Members: van Essen, Theresia (mentor), Pierotti, Jacopo (mentor), Aardal, Karen (graduation committee), Kraaikamp, Cornelis (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: DARP-T; Destroy and Repair; Pick-up and Delivery Problem; Transfers; Time Windows

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Janssens de Bisthoven, S. (. (2020). A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:88b87961-444e-46c3-91c0-940cd59d3626

Chicago Manual of Style (16th Edition):

Janssens de Bisthoven, Sébastien (author). “A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers.” 2020. Masters Thesis, Delft University of Technology. Accessed October 30, 2020. http://resolver.tudelft.nl/uuid:88b87961-444e-46c3-91c0-940cd59d3626.

MLA Handbook (7th Edition):

Janssens de Bisthoven, Sébastien (author). “A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers.” 2020. Web. 30 Oct 2020.

Vancouver:

Janssens de Bisthoven S(. A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2020 Oct 30]. Available from: http://resolver.tudelft.nl/uuid:88b87961-444e-46c3-91c0-940cd59d3626.

Council of Science Editors:

Janssens de Bisthoven S(. A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:88b87961-444e-46c3-91c0-940cd59d3626

.