Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Heuristic Techniques for Real-Time Order Acceptance and Scheduling in Metal Additive Manufacturing Read chapter Read first chapter

2020 | OriginalPaper | Chapter

8. Distance-Constrained Vehicle Routing Problems: A Case Study Using Artificial Bee Colony Algorithm

Authors : Aslan Deniz Karaoglan, Ismail Atalay, Ibrahim Kucukkoc

Published in: Mathematical Modelling and Optimization of Engineering Problems

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The vehicle routing problem (VRP) is one of the most frequently encountered NP-Hard optimization problems in logistics and distance-constrained VRP is used when there are constraints such as fuel, driver’s continuous working hours, or the balanced workload of each distribution path. Heuristics and metaheuristics are widely used to solve this NP-Hard problem. In recent years swarm intelligence became popular to solve such problems. In this study, a single depot with a single vehicle type that is used to transport the staff (controllers of Balikesir Directorate of Science, Industry and Technology—Turkey) to 19 different towns by the routes with a length of maximum 550 km. The aim is to minimize the total pathway of the vehicle and to visit all the towns. The artificial bee colony (ABC) algorithm is used for the optimization. This result indicates that the ABC algorithm can be used effectively to solve the distance restricted vehicle routing problems.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter RSM-Based Optimization of Excitation Capacitance and Speed for a Self-Excited Induction Generator
next chapter Fractional Model for Type 1 Diabetes
Literature
1.
2.
K. Braekers, K. Ramaekers, I.V. Nieuwenhuyse, The vehicle routing problem: State of the art classification and review. Comput. Ind. Eng. 99, 300–313 (2016)CrossRef
3.
H. Seidgar, Kiani, M., H. Fazlollahtabar, Genetic and artificial bee colony algorithms for scheduling of multi-skilled manpower in combined manpower-vehicle routing problem. Prod. Manuf. Res. 4(1), 133–151 (2016)
4.
5.
Y. Xia, Z. Fu, I. Pan, F.H. Duan, Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order. PLoS One 13(5), e0195457 (2018)
6.
T. Tlili, S. Faiz, S. Krichen, A hybrid metaheuristic for the distance-constrained capacitated vehicle routing problem, in 2nd World Conference on Business, Economics and Management Book Series: Procedia—Social and Behavioral Sciences, vol. 109 (2014), pp. 779–783
7.
G. Laporte, Y. Nobert, S. Taillefer, A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle-routing problem. Math. Model. 9(12), 857–868 (1987)MathSciNetCrossRef
8.
C.L. Li, D. Simchilevi, M. Desrochers, On the distance constrained vehicle routing problem. Oper. Res. 40(4), 790–799 (1992)MathSciNetCrossRef
9.
I. Kara, On the Miller–Tucker–Zemlin based formulations for the distance constrained vehicle routing problems, in International Conference on Mathematical Sciences. AIP Conference Proceedings, vol. 1309 (AIP Conference Proceedings, Bolu, 2010), pp. 551–561
10.
I. Kara, T. Derya, Polynomial size formulations for the distance and capacity constrained vehicle routing problem, in International Conference on Numerical Analysis and Applied Mathematics (ICNAAM), vol. 1389 (AIP Conference Proceedings, Halkidiki, 2011), pp. 9–25
11.
V. Nagarajan, R. Ravi, Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209–214 (2012)MathSciNetCrossRef
12.
S. Almoustafa, S. Hanafi, N. Mladenovic, New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226(3), 386–394 (2013)MathSciNetCrossRef
13.
Z. Luo, H. Qin, A. Lim, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur. J. Oper. Res. 234(1), 49–60 (2014)MathSciNetCrossRef
14.
J. Jin, T.G. Crainic, A. Lokketangen, A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 44, 33–41 (2014)MathSciNetCrossRef
15.
Y. Wang, Y. Chen, Y. Lin, Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem. Comput. Ind. Eng. 106, 105–122 (2017)CrossRef
16.
T. Avila, A. Corberan, I. Plana, J.M. Sanchis, Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. Euro J. Comput. Optim. 5(3), 339–365 (2017)MathSciNetCrossRef
17.
A. Alvarado-Iniesta, J.L. Garcia-Alcaraz, M.I. Rodriguez-Borbon, A. Maldonado, Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm. Expert Syst. Appl. 40(12), 4785–4790 (2013)CrossRef
18.
S. Zhang, C.K.M. Lee, K.L. Choy, W. Ho, W.H. Ip, Design and development of a hybrid artificial bee colony algorithm for the environmental. Transp. Res. Part D: Transp. Environ. 31, 85–99 (2014)CrossRef
19.
S. Iqbal, M. Kaykobad, M.S. Rahman, Solving the multi-objective vehicle routing problem with soft time windows with the help of bees. Swarm Evol. Comput. 24, 50–64 (2015)CrossRef
20.
S. Mao, X.L. Zhao, Z.T. Wang, M.F. Zheng, W.J. Xie, The uncertain time dependent vehicle routing problem with soft time windows, in IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) Held as Part of IEEE World Congress on Computational Intelligence (IEEE WCCI) (Vancouver, 2016), pp. 38–45
21.
S. Mingprasert, R. Masuchun, Applied artificial bee colony algorithm for multiple capacitated vehicle routing problem: case study of the plastic packaging industry, in 14th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON) (Phuket, 2017), pp. 270–273
22.
Y. Zhou, H.Z. Zheng, F.C. Meng, C.S. Li, On the application of the vehicle routing problem with multi-distribution centers in reverse logistics, in 4th International Conference on Systems and Informatics (ICSAI) (Hangzhou, 2017), pp. 750–755
23.
J.N. Che, K. Zhou, X.Y. Zhang, X. Tong, L.Y. Hou, S.Y. Jia, Y.T. Zhen, Application of hybrid artificial fish swarm algorithm based on similar fragments in VRP, in 10th International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR)—Remote Sensing Image Processing, Geographic Information Systems, and Other Applications, Proceedings of SPIE, vol. 10611 (Xiangyang, 2018)
24.
D. Karaboga, B. Gorkemli, C. Ozturk, N. Karaboga, A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21–57 (2014)CrossRef
25.
D. Karaboga, An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Computer Engineering Department, 2005
26.
27.
28.
D. Karaboga, Artificial Intelligence Optimization Algorithms (Original: Yapay Zeka Optimizasyon Algoritmalari), 4th edn (Nobel, Istanbul, 2006)
29.
R. Zhang, S. Shiji, W. Cheng, A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int. J. Prod. Econ. 141(1), 167–168 (2013)CrossRef
30.
X. Wang, H. Duan, A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput. Ind. Eng. 73, 96–114 (2014)CrossRef
31.
O. Bulut, M.F. Tasgetiren, An artificial bee colony algorithm for the economic lot scheduling problem. Int. J. Prod. Res. 52(4), 1150–1170 (2014)CrossRef
32.
J.C. Bansal, H. Sharma, K.V. Arya, A. Nagar, Memetic search in artificial bee colony algorithm. Soft Comput. 17(10), 1911–1928 (2013)CrossRef
33.
A.D. Karaoglan, E. Cetin, Artificial bee colony algorithm for labor intensive project type job shop scheduling problem: a case study, in Global Joint Conference on Industrial Engineering and Its Application Areas (GJCIE 2018) (Urgup-Nevsehir, 2018)
34.
E. Yurtkuran, A discrete artificial bee colony algorithm for single machine scheduling problems. Int. J. Prod. Res. 54, 6860–6878 (2016)CrossRef
Metadata
Title
Distance-Constrained Vehicle Routing Problems: A Case Study Using Artificial Bee Colony Algorithm
Authors
Aslan Deniz Karaoglan
Ismail Atalay
Ibrahim Kucukkoc
Copyright Year
2020
Book
Mathematical Modelling and Optimization of Engineering Problems

Print ISBN: 978-3-030-37061-9

Electronic ISBN: 978-3-030-37062-6

Copyright Year: 2020

DOI
https://doi.org/10.1007/978-3-030-37062-6_8

Premium Partners

    Image Credits