Journals / Journal of Management Marketing and Logistics / 2017 / Cilt: 4 - Sayı: 2

INTELLIGENT ROUTING APPROACH FOR THE DISTRIBUTIONS REGARDING TO THE SUPPLY CHAIN MANAGEMENT OF AGRICULTURAL PRODUCTS AND FOODS

Pages
168–177
Publication Date
2017-06-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Findings- The main contribution of this study in which the Capacitated Vehicle Routing Problem has been addressed is to find the route set to service all the customers in a region while considering the points to be serviced globally; or for each sub-region, the separated tours to service the related customer group while considering them as subsets.Conclusion- Using the hybrid meta-heuristic algorithm including Genetic Algorithms and Local Search developed for the solution, low costly route sets with separated/global tours may be generated within very short periods of time.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Purpose- In this study, to effectively manage the supply chain intended for the storage, transportation and distribution of agricultural products and foods, an intelligent routing approach is proposed for accomplishing this distribution at low cost.
📊
Key Findings & Data:Methodology- As an activity in logistics, the demands related to the exportation of various foods/goods in agricultural production are considered.
💡
Conclusion & Impact:Findings- The main contribution of this study in which the Capacitated Vehicle Routing Problem has been addressed is to find the route set to service all the customers in a region while considering the points to be serviced globally; or for each sub-region, the separated tours to service the related customer group while considering them as subsets.Conclusion- Using the hybrid meta-heuristic algorithm including Genetic Algorithms and Local Search developed for the solution, low costly route sets with separated/global tours may be generated within very short periods of time.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Genetic algorithms · capacitated vehicle routing problem · logistics

Abstract

Purpose- In this study, to effectively manage the supply chain intended for the storage, transportation and distribution of agricultural products and foods, an intelligent routing approach is proposed for accomplishing this distribution at low cost. Methodology- As an activity in logistics, the demands related to the exportation of various foods/goods in agricultural production are considered. It is assumed that a vehicle fleet, each vehicle with a certain load capacity, starts at a depot with the loads, visits a set of points using the shortest paths while accomplishing the related distributions and returns back to the depot. It is aimed to find the route set with the minimum cost so that all customers are to be visited. Findings- The main contribution of this study in which the Capacitated Vehicle Routing Problem has been addressed is to find the route set to service all the customers in a region while considering the points to be serviced globally; or for each sub-region, the separated tours to service the related customer group while considering them as subsets.Conclusion- Using the hybrid meta-heuristic algorithm including Genetic Algorithms and Local Search developed for the solution, low costly route sets with separated/global tours may be generated within very short periods of time.

🔖

Cite This Article

KARAKOC, M. (2017). INTELLIGENT ROUTING APPROACH FOR THE DISTRIBUTIONS REGARDING TO THE SUPPLY CHAIN MANAGEMENT OF AGRICULTURAL PRODUCTS AND FOODS. Journal of Management Marketing and Logistics, Cilt: 4 - Sayı: 2, 168–177. https://ajindex.com/articles/836170

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (10)

  1. Berger, J. & Barkaoui, M. 2003, “A hybrid genetic algorithm for the capacitated vehicle routing problem”, Genetic and Evolutionary Computation Conference (GECCO’03): Part I, pp. 646-656, Lecture Notes in Computer Science, 2723. Boonsam, P., Suthikarnnarunai, N. & Chitphaiboon, W. 2011, “Assignment problem and vehicle routing problem for an improvement of cash distribution”, World Congress on Engineering and Computer Science (WCECS), vol. II, October 19-21,
  2. San Francisco, USA. Bortfeldt, A. 2012, “A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints”, Computers & Operations Research, vol. 39, no. 9, pp. 2248-2257.
  3. Cacchiani, V., Hemmelmayr, V.C. & Tricoire, F. 2014, “A set-covering based heuristic algorithm for the periodic vehicle routing problem”, Discrete Applied Mathematics, vol. 163, no. 1, pp. 53-64.
  4. Chand, P. & Mohanty, J.R. 2013, “Solving vehicle routing problem with proposed non-dominated sorting genetic algorithm and comparison with classical evolutionary algorithms”, International Journal of Computer Applications (IJCA), vol. 69, no. 26, pp. 34-41.
  5. Chand, P., Mishra, B.S.P. & Dehuri, S. 2010, “A multi objective genetic algorithm for solving vehicle routing problem”, International Journal of Information Technology and Knowledge Management, vol. 2, no. 2, pp. 503-506.
  6. Dantzig, G.B. & Ramser, J.H. 1959, “The truck dispatching problem”, Management Science, vol. 6, no. 1, pp. 80-91.
  7. Du, L. & He, R. 2012, “Combining nearest neighbor search with tabu search for large-scale vehicle routing problem”, Physics Procedia, vol. 25, pp. 1536-1546, International Conference on Solid State Devices and Materials Science, April 1-2,
  8. Macao. Fuellerer, G., Doerner, K.F., Hartl, R.F. & Iori, M. 2010, “Metaheuristics for vehicle routing problems with three-dimensional loading constraints”, European Journal of Operational Research, vol. 201, no. 3, pp. 751-759.
  9. Fukasawa, R., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E. & Werneck, R.F. 2006, “Robust branch-and-cut-and-price for the capacitated vehicle routing problem”, Mathematical Programming, vol. 106, no. 3, pp. 491-511. Hà, M.H., Bostel, N., Langevin, A. & Rousseau, L.M. 2014, “An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size”, Computers & Operations Research, vol. 43, pp. 9-19.
  10. Ho, W., Ho, G.T.S., Ji, P. & Lau, H.C.W. 2008, “A hybrid genetic algorithm for the multi-depot vehicle routing problem”, Engi