Skip to main content
SpringerLink
Log in

A Hybrid Tabu Search Algorithm for the Variable Periodic Vehicle Routing Problem

  • Research Article - Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

This paper presents a real-life variable periodic vehicle routing problem (VPVRP) which is originated from an auto parts company. The idea of lean production has been applied in the production of the auto parts manufacturer. The VPVRP consists of the assignment of a pickup schedule for each of its supplier’s locations and also the establishment of daily routes in order to minimize total transportation cost. Since the problem is a special case of the periodic vehicle routing problem, several initial solution algorithms and a hybrid tabu search (HTS) are developed for solving the problem. There are distinctive features in the HTS, including the intensification strategy, the diversification strategy, and the combination of tabu search with the switch mechanism. The computational results show that the proposed initial algorithms and the HTS outperform the current scheduling method used by the case plant with a significant improvement.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alonso, F.; Alvarez, M.J.; Beasley, J.E.: A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J. Oper. Res. Soc. 59, 963–976 (2008)

    Article  MATH  Google Scholar 

  2. Alegre, J.; Laguna, M.; Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur. J. Oper. Res. 179, 736–746 (2007)

    Article  MATH  Google Scholar 

  3. Tang, J.; Zhang, J.; Pan, Z.: A scatter search algorithm for solving vehicle routing problem with loading cost. Expert Syst. Appl. 37, 4073–4083 (2010)

    Article  Google Scholar 

  4. Drummond, L.M.A.; Ochi, L.S.; Vianna, D.S.: An asynchronous parallel metaheuristic for the period vehicle routing problem. Fut. Gener. Comput. Syst. 17, 379–386 (2001)

    Article  MATH  Google Scholar 

  5. Angelelli, E.; Speranza, M.G.: The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137, 233–247 (2002)

    Article  MATH  Google Scholar 

  6. Hemmelmayr, V.; Doerner, K.; Hartl, R.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195, 791–802 (2009)

    Article  MATH  Google Scholar 

  7. Pirkwieser, S.; Raidl, G.: Multilevel variable neighborhood search for periodic routing problems. Evol. Comput. Comb. Optim. Lect. Notes Comput. Sci. 6022, 226–238 (2010)

    MathSciNet  Google Scholar 

  8. Coene, S.; Arnout, A.; Spieksma, F.: On a periodic vehicle routing problem. J. Oper. Res. Soc. 61, 1719–1728 (2010)

    Article  MATH  Google Scholar 

  9. Alinaghian, M., Ghazanfari, M., Salamatbakhsh, A., Norouzi, N.: A new competitive approach on multi-objective periodic vehicle routing problem. Int. J. Appl. Oper. Res. 1, 33–41 (2012)

  10. Hemmelmayr, V., Doerner, K.F., Hartl, R.F., Rath, S.: A heuristic solution method for node routing based solid waste collection problems. J. Heuristics 19, 129–156 (2011)

    Article  Google Scholar 

  11. Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.: A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Appl. Math. 163, 53–64 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Maya, P.; Sörensen, K.; Goos, P.: A metaheuristic for a teaching assistant assignment-routing problem. Comput. Oper. Res. 39, 249–258 (2012)

    Article  Google Scholar 

  13. Bouthillier, A.L.; Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32, 1685–1708 (2005)

    Article  MATH  Google Scholar 

  14. Cordeau, J.F.; Maischberger, M.: A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39, 2033–2050 (2012)

    Article  Google Scholar 

  15. Baptista, S.; Oliveira, R.C.; Zúquete, E.: A period vehicle routing case study. Eur. J. Oper. Res. 139, 220–229 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gendreau, M.; Guertin, F.; Potvin, J.Y.; Taillard, E.: Parallel tabu search for real-time vehicle routing and dispatching. Transp. Sci. 33, 381–390 (1999)

    Article  MATH  Google Scholar 

  18. Al-Turki, U.; Fedjki, C.; Andijani, A.: Tabu search for a class of single-machine scheduling problems. Comput. Oper. Res. 28, 1223–1230 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Liaw, C.F.: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Comput. Oper. Res. 30, 2081–2095 (2003)

    Article  MATH  Google Scholar 

  20. Czapiński, M.: An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform. J. Parallel Distrib. Comput. 73, 1461–1468 (2013)

    Article  Google Scholar 

  21. Kargahi, M.; Anderson, J.; Dessouky, M.: Structural weight optimization of frames using tabu search. I: optimization procedure. J. Struct. Eng. 132, 1858–1868 (2006)

    Article  Google Scholar 

  22. Laguna, M.; Martí, R.; Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217–1230 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, 106, Taiwan

    Ching-Jong Liao & Wan-Yin Chen

  2. Department of International Trade, Chihlee University of Technology, No. 313, Section 1, Wunhua Road, Banciao District, New Taipei City, 22050, Taiwan

    Cheng-Hsiung Lee

Authors
  1. Ching-Jong Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheng-Hsiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wan-Yin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cheng-Hsiung Lee.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liao, CJ., Lee, CH. & Chen, WY. A Hybrid Tabu Search Algorithm for the Variable Periodic Vehicle Routing Problem. Arab J Sci Eng 42, 513–535 (2017). https://doi.org/10.1007/s13369-016-2255-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-016-2255-7

Keywords

Search

Navigation