Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/37595
Title: | Solving a periodic capacitated vehicle routing problem using simulated annealing algorithm for a manufacturing company | Authors: | Aydemir, E Karagül, Kenan |
Keywords: | Capacitated Vehicle Routing Problem; Simulated Annealing Algorithm; Julia Programming Language |
Publisher: | ASSOC BRASILEIRA ENGENHARIA PRODUCAO-ABEPRO | Abstract: | Goal: This paper aims to implement a periodic capacitated vehicle routing problem with simulated annealing algorithm using a real-life industrial distribution problem and to recommend it to industry practitioners. The authors aimed to achieve high-performance solutions by coding a manually solved industrial problem and thus solving a real-life vehicle routing problem using Julia language and simulated annealing algorithm. Design / Methodology / Approach: The vehicle routing problem (VRP) that is a widely studied combinatorial optimization and integer programming problem, aims to design optimal tours for a fleet of vehicles serving a given set of customers at different locations. The simulated annealing algorithm is used for periodic capacitated vehicle routing problem. Julia is a state-of-art scientific computation language. Therefore, a Julia programming language toolbox developed for logistic optimization is used. Results: The results are compared to savings algorithms from Matlab in terms of solution quality and time. It is seen that the simulated annealing algorithm with Julia gives better solution quality in reasonable simulation time compared to the constructive savings algorithm. Limitations of the investigation: The data of the company is obtained from 12 periods with a history of four years. About the capacitated vehicle routing problem, the homogenous fleet with 3000 meters/vehicle is used. Then, the simulated annealing design parameters are chosen rule-of-thumb. Therefore, better performance can be obtained by optimizing the simulated annealing parameters. Originality / Value: The main contribution of this study is a new solution method to capacitated vehicle routing problems for a real-life industrial problem using the advantages of the high-level computing language Julia and a meta-heuristic algorithm, the simulated annealing method. |
URI: | https://hdl.handle.net/11499/37595 https://doi.org/10.14488/BJOPM.2020.011 |
ISSN: | 2237-8960 |
Appears in Collections: | Honaz Meslek Yüksekokulu Koleksiyonu WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
document22.pdf | 1.66 MB | Adobe PDF | View/Open |
CORE Recommender
WEB OF SCIENCETM
Citations
9
checked on Dec 20, 2024
Page view(s)
34
checked on Aug 24, 2024
Download(s)
20
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.