Hybrid genetic-tabu search algorithm to optimize the route for capacitated vehicle routing problem with time window
DOI:
https://doi.org/10.12928/ijio.v1i1.1421Keywords:
Genetic Algorithm, Tabu Search, Capacitated Vehicle Routing Problem with Time Windows, Pick-up and DeliveryAbstract
Optimization of transportation and distribution costs is one of the important issues in the supply chain management area. It is caused by their large contribution to the logistics costs that can reach up to 40%. Thus, choosing the right route is one of the efforts that can be done to resolve the issue. This study aims to optimize the capacitated vehicle routing problem with time windows (CVRPTW) for mineral water company distributor with pick-up and delivery problem. To achieve the aim, this study used hybrid algorithm, Genetic Algorithm (GA) and Tabu Search Algorithm (TS). The selection of this hybrid algorithm is due to its capability in minimizing travel distance. The result of this study shows that not only the algorithm has successfully reduced the existing route but also predicted the optimum number of homogenous fleet. By running the algorithm, this study concludes that the number of the optimum routes for this study can be reduced for up to 15.99% than the existing route.References
Abdurrahman, A. F., Ridwan, A. Y., & Santosa, B. (2018). Completion Vehicle Routing Problem (Vrp) In Determining Route And Determining The Number Of Vehicles In Minimizing Transportation Costs In PT. XYZ With Using Genetic Algorithm. International Journal of Innovation in Enterprise System, 2(02), 24-30.
Baker, B. M., & Ayechew, M. A. (2003). A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30(5), 787-800.
Brilliane, C. S., Ridwan, A. Y., & Aurachman, R. (2019). Designing Route Distribution Using Two Phase Tabu Search On Heterogenous Fleet Vehicle Routing Problem With Time Window In Pt. Xyz To Minimize Travel Distance. International Journal of Innovation in Enterprise System, 3(01), 6-14.
Crainic, T. G., & Laporte, G. (Eds.). (2012). Fleet management and logistics. Springer Science & Business Media.
Frazelle, E. (2002). Supply chain strategy: the logistics of supply chain management. McGrraw Hill.
Hugos, M. H. (2018). Essentials of supply chain management. John Wiley & Sons.
Lai, D. S., Demirag, O. C., & Leung, J. M. (2016). A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transportation Research Part E: Logistics and Transportation Review, 86, 32-52.
Lu, D. (2011). Fundamentals of supply chain management. Bookboo
Mak, K. L., & Sun, D. (2009). A new hybrid genetic algorithm and tabu search method for yard cranes scheduling with inter-crane interference. In Proceedings of the World Congress on Engineering 2009. Newswood Limited..
Mohammed, M. A., Ghani, M. K. A., Hamed, R. I., Mostafa, S. A., Ahmad, M. S., & Ibrahim, D. A. (2017). Solving vehicle routing problem by using improved genetic algorithm for optimal solution. Journal of Computational Science, 21, 255-262.
Sonawane, M. P. A., & Ragha, L. (2014). Hybrid genetic algorithm and TABU search algorithm to solve class time table scheduling problem. International Journal of Research Studies in Computer Science and Engineering, 1(4), 19-26.
Toth, P., & Vigo, D. (1998). Exact solution of the vehicle routing problem. In Fleet management and logistics (pp. 1-31). Springer, Boston, MA.
Toth, P., & Vigo, D. (2002). An overview of vehicle routing problems. In The vehicle routing problem (pp. 1-26). Society for Industrial and Applied Mathematics.
Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics.
Utamima, A., Pradina, K. R., Dini, N. S., & Studiawan, H. (2015). Distribution route optimization of gallon water using genetic algorithm and tabu search. Procedia Computer Science, 72, 503-510.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Mohammad Deni Akbar, Rio Aurachmana
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal. Please also carefully read the International Journal of Industrial Optimization (IJIO) Author Guidelines at http://journal2.uad.ac.id/index.php/ijio/about/submissions#onlineSubmissions
- That it is not under consideration for publication elsewhere,
- That its publication has been approved by all the author(s) and by the responsible authorities tacitly or explicitly of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Copyright
Authors who publish with the International Journal of Industrial Optimization (IJIO) agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
1.png)
