Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/18378
Title: | Solving a Bi-Objective Dial-a-Ride Problem Using Multi-Directional Local Search | Authors: | MOLENBRUCH, Yves BRAEKERS, Kris CARIS, An |
Issue Date: | 2015 | Source: | Orbel29, Antwerpen, 05/02/2015 - 06/02/2015 | Abstract: | Single-objective solution methods for the dial-a-ride problem usually minimize operational costs while ensuring a minimum quality level imposed by service level requirements. This solution technique emphasizes the fundamental nature of the problem by solving a bi-objective variant. Total user ride time, being the total time users spend aboard the vehicles, is explicitly minimized as an additional, quality-oriented objective without making a priori choices regarding the importance of both objectives. To this end, a multi-directional local search (MDLS) metaheuristic is developed, in which a variable neighborhood search (VNS) principle is embedded to perform local search. | Keywords: | dial-a-ride; multi-directional local search; variable neighborhood search | Document URI: | http://hdl.handle.net/1942/18378 | Category: | C2 | Type: | Conference Material |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
141222 - Abstract Orbel29.pdf Restricted Access | Conference material | 105.18 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.