Skip to main content
SpringerLink
Log in

Modified DFA Minimization with Artificial Bee Colony Optimization in Vehicular Routing Problem with Time Windows

  • Conference paper
  • First Online:
Data Management, Analytics and Innovation

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1042))

Abstract

A NP-hard problem, vehicular routing is a combinatorial optimization problem. Vehicular routing problem with time windows indicates vehicular routing with specified start and end time. There will be “n” number of vehicles starting from the depot to cater to the needs of “m” customers. In this paper, Gehring and Homberger benchmark problems are considered wherein the size of customers is taken to be 1000. Artificial Bee Colony Optimization algorithm is executed on these 60 datasets and the number of vehicles along with total distance covered is recorded. The modified version of Deterministic Finite Automata is applied along with the Artificial Bee Colony Optimization and the results produce 25.55% efficient routes and 15.42% efficient distance compared to simple Artificial Bee Colony Optimization algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Toth, P., Vigo, D.: The vehicle routing problem. In: Toth, P., Vigo, D. (eds.) SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)

    Google Scholar 

  2. Golden, B.L., Assad, A.A., Wasil, E.A.: Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 245–286. SIAM, Philadelphia (2002)

    Chapter  Google Scholar 

  3. Karaboga, D.: An idea based honey bee swarm for numerical optimization. Technical Report-TR06, October (2005)

    Google Scholar 

  4. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  Google Scholar 

  5. Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl. Soft Comput. 9(2), 625–631 (2009)

    Article  Google Scholar 

  6. Umamaheswari, K., Sarathambekai, S.: Task scheduling in distributed systems using discrete particle swarm optimization. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 4(2):510–522 (2014/2)

    Google Scholar 

  7. Sarathambekai, S., Umamaheswari, K.: Task scheduling in distributed systems using heap intelligent discrete particle swarm optimization. J. Comput. Intell. 33(4):737–770 (2017/11)

    Article  MathSciNet  Google Scholar 

  8. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  9. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  10. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. J. Oper. Res. Soc. Am. 12(4), 568–581 (1964)

    Google Scholar 

  11. Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. J. Oper. Res. Soc. Am. 40(2), 342–354 (1992). https://doi.org/10.1287/opre.40.2.342

    Article  MathSciNet  MATH  Google Scholar 

  12. Bhagade, A.S., Puranik, P.V.: Artificial bee colony (abc) algorithm for vehicle routing optimization problem. Int. J. Soft Comput. Eng. (IJSCE) 2(2), 2231–2307 (2012)

    Google Scholar 

  13. https://www.sintef.no/projectweb/top/vrptw/solomon-benchmark/

  14. Watson, B.W.: A taxonomy of finite automata minimization algorithms. Computing Science Report 93/44 Eindhoven, January 1995 (1995)

    Google Scholar 

  15. Perrin, D.: CHAPTER 1—Finite Automata Formal Models and Semantics, Handbook of Theoretical Computer Science, pp. 1–57. Elsevier, Amsterdam (1990)

    Google Scholar 

  16. Bulhões, S.R., Uchoa, E.: A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93, 66–78 (2017)

    Article  MathSciNet  Google Scholar 

  17. Schneider, M.: The vehicle-routing problem with time windows and driver-specific times. Eur. J. Oper. Res. 250(1), 101–119 (2016). https://doi.org/10.1016/j.ejor.2015.09.015

    Article  MathSciNet  MATH  Google Scholar 

  18. Huang, G., Cai, Y., Cai, H: Multi-agent ant colony optimization for vehicle routing problem with soft time windows and road conditions. In: MATEC Web Conference, Volume 173, 2018 International Conference on Smart Materials, Intelligent Manufacturing and Automation [SMIMA] (2018). https://doi.org/10.1051/matecconf/201817302020

    Article  Google Scholar 

  19. Matthopoulos, P.-P., Sofianopoulou, S.: A firefly algorithm for the heterogeneous fixed fleet VRP. Int. J. Ind. Syst. Eng. 33(1) (2018)

    Article  Google Scholar 

  20. Shi, Y.-J., Meng, F.-W., Shen, G.-J.: A modified artificial bee colony algorithm for vehicle routing problems with time windows. Inf. Technol. J. 11(10), 1490–1495 (2012)

    Article  Google Scholar 

  21. Nahum, O.E., Hadas, Y., Spiegel, U.: Multi-objective vehicle routing problems with time windows: a vector evaluated artificial bee colony approach. Int. J. Comput. Inf. Technol. 3(1), 41–47 (2014)

    Google Scholar 

  22. Alzaqebah, M., Abdullah, S., Jawarneh, S.: Modified artificial bee colony for the vehicle routing problems with time windows. SpringerPlus 5(1), 1298 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of CSE, PSG Institute of Technology and Applied Research, Coimbatore, India

    G. Niranjani

  2. Department of IT, PSG College of Technology, Coimbatore, India

    K. Umamaheswari

Authors
  1. G. Niranjani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Umamaheswari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Niranjani .

Editor information

Editors and Affiliations

  1. Society for Data Science, Pune, Maharashtra, India

    Neha Sharma

  2. A.K. Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India

    Amlan Chakrabarti

  3. Department of Automatics and Applied Software, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Balas

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Niranjani, G., Umamaheswari, K. (2020). Modified DFA Minimization with Artificial Bee Colony Optimization in Vehicular Routing Problem with Time Windows. In: Sharma, N., Chakrabarti, A., Balas, V. (eds) Data Management, Analytics and Innovation. Advances in Intelligent Systems and Computing, vol 1042. Springer, Singapore. https://doi.org/10.1007/978-981-32-9949-8_45

Download citation

  • DOI: https://doi.org/10.1007/978-981-32-9949-8_45

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-32-9948-1

  • Online ISBN: 978-981-32-9949-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation