Genetic algorithm applications for the vehicle routing problem with roaming delivery locations
| buir.advisor | Yetiş, Bahar | |
| dc.contributor.author | Turhan, Serkan | |
| dc.date.accessioned | 2021-08-09T07:56:11Z | |
| dc.date.available | 2021-08-09T07:56:11Z | |
| dc.date.copyright | 2021-06 | |
| dc.date.issued | 2021-06 | |
| dc.date.submitted | 2021-07-14 | |
| dc.description | Cataloged from PDF version of article. | en_US |
| dc.description | Thesis (Master's): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2021. | en_US |
| dc.description | Includes bibliographical references (leaves 55-63). | en_US |
| dc.description.abstract | The recent innovations in the e-commerce industry developed a new delivery option where the orders of the customers can be delivered to the trunks of their cars. Compared to the conventional home-delivery, this option is not only able to decrease the total distance traveled but also increase the customer satisfaction by decreasing the number of failed deliveries. The problem introduced by this option is called the vehicle routing problem with roaming delivery locations. This thesis proposes a new, time-efficient solution construction strategy for the problem. The construction strategy is able to represent any feasible solution for the problem and has a complexity linearly increasing with the number of delivery nodes in the problem. Based on the constructor, a new genetic algorithm to find and improve solutions to near-optimal within polynomial time is proposed. Furthermore, a separate, new fine-tuning algorithm to improve the parameters of the genetic algorithm for a given set of problem instances is proposed. The most notable feature of the proposed genetic algorithm is the time-efficiency as it is able to construct a solution within milliseconds for the largest problem instance available in the literature and the computation time scales with the problem size linearly. Parallel computing can be implemented in both the fine-tuning and the genetic algorithm, which allows better results in a shorter processing time. Within 5 minutes of computation time, the fine-tuned genetic algorithm found optimal solutions in 8 out of 19 instances with known optimal solutions, moreover, it was able to find solutions better than the previous solution methodologies in 12 out of 60 instances used in our experiments. Gaps between the results of the proposed genetic algorithm and the best solution found by a commercial solver (CPLEX) are between (0.0%, 26.2%) and (-6.0%, 16.3%) in small-medium and large instances respectively. | en_US |
| dc.description.provenance | Submitted by Betül Özen (ozen@bilkent.edu.tr) on 2021-08-09T07:56:11Z No. of bitstreams: 1 10405101.pdf: 2614119 bytes, checksum: 1f33f13645df871ec5d17816bd6e91ac (MD5) | en |
| dc.description.provenance | Made available in DSpace on 2021-08-09T07:56:11Z (GMT). No. of bitstreams: 1 10405101.pdf: 2614119 bytes, checksum: 1f33f13645df871ec5d17816bd6e91ac (MD5) Previous issue date: 2021-06 | en |
| dc.description.statementofresponsibility | by Serkan Turhan | en_US |
| dc.format.extent | xiii, 71 leaves : illustrations ; 30 cm. | en_US |
| dc.identifier.itemid | B154498 | |
| dc.identifier.uri | http://hdl.handle.net/11693/76414 | |
| dc.language.iso | English | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Vehicle routing problem with roaming delivery locations | en_US |
| dc.subject | Genetic al-gorithm | en_US |
| dc.subject | Evolutionary algorithm | en_US |
| dc.subject | Generalized vehicle routing with time windows | en_US |
| dc.title | Genetic algorithm applications for the vehicle routing problem with roaming delivery locations | en_US |
| dc.title.alternative | Hareketli teslimat noktalı araç rotalama problemleri için geliştirilmiş genetik algoritmalar | en_US |
| dc.type | Thesis | en_US |
| thesis.degree.discipline | Industrial Engineering | |
| thesis.degree.grantor | Bilkent University | |
| thesis.degree.level | Master's | |
| thesis.degree.name | MS (Master of Science) |