Skip to main content
SpringerLink
Log in

Tabu Search Algorithm for the Vehicle Routing Problem with Time Windows, Heterogeneous Fleet, and Accessibility Restrictions

  • Conference paper
  • First Online:
Proceedings of the 18th Online World Conference on Soft Computing in Industrial Applications (WSC18) (WSC 2014)

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

Included in the following conference series:

  • 212 Accesses

Abstract

Hospitals or the other health service providers usually assign a third party service provider to manage their solid medical waste. In our case, it is known that the third party service’s transportation cost is too expensive. Through the analysis, it is found that the main problem lies in determining solid medical waste pick-up routes.

In this research, a new method to determine pick-up routes will be proposed. The route proposed will minimize the company’s transportation cost. In this case, the clients have their opening hours, the third party service providers has several kinds of vehicle, and there are accessibility restrictions for certain vehicle. The problem is known as VRPHETW with accessibility restrictions. The mathematical model and 2-phased tabu search will be used to solve this problem. The result shows that our proposed route is better than the existing route.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  • Badeau, P., Guertin, F., Gendreau, Michel., Jean-Yves, P., Taillard, E.: A parrallel tabu search heuristic for the vehicle routing problem with time windows. Transp. Res.-C 5(2), 109–122 (1997)

    Article  Google Scholar 

  • Belfiore, P., Favero, L.P.L.: Scatter search for the fleet size and mix vehicle routing problem with time windows. CEJOR 15, 351–368 (2007)

    Article  MathSciNet  Google Scholar 

  • Belfiore, P., Yoshizaki, H.T.Y.: Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Comput. Ind. Eng. 64, 589–601 (2013)

    Article  Google Scholar 

  • Brandao, J.: A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 195, 716–728 (2009)

    Article  MathSciNet  Google Scholar 

  • Brandao, J.: A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput. Oper. Res. 38, 140–151 (2011)

    Article  MathSciNet  Google Scholar 

  • Brandao, J., Mercer, A.: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100, 180–191 (1997)

    Article  Google Scholar 

  • Braysy, O., Porkka, P.P., Dullaert, W., Repoussis, P.P., Tarantilis, C.D.: A well scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows. Expert Syst. Appl. 36, 8460–8475 (2009)

    Article  Google Scholar 

  • Choi, E., Tcha, D.-W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2080–2095 (2007)

    Article  Google Scholar 

  • Dell’Amico, M., Corrado, M.P., Daniele, V.: Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transp. Sci. 41(4), 516–526 (2007)

    Article  Google Scholar 

  • Figliozzi, M.A.: An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp. Res. Part C: Emerg. Technol. 18(5), 668–679 (2010)

    Article  Google Scholar 

  • Gagliardi, J.-P., Renaud, J., Ruiz, A., Coelho, L.C.: The vehicle routing problem with pauses. CIRRELT, May 2014

    Google Scholar 

  • Imran, A., Salhi, S., Wassan, N.A.: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 197, 509–518 (2009)

    Article  Google Scholar 

  • Jiang, J., Ng, K.M., Poh, K.L., Teo, K.M.: Vehicle routing problem with a heterogeneous fleet and time windows. Expert Syst. Appl. 41, 3748–3760 (2014)

    Article  Google Scholar 

  • Kritikos, M.N., George, I.: The heterogeneous fleet vehicle routing problem with overloads and time windows. Int. J. Prod. Econ. 144, 68–75 (2013)

    Article  Google Scholar 

  • Lau, H.C., Sim, M., Teo, K.M.: Vehicle routing problem with time windows and a limited number of vehicles. Eur. J. Oper. Res. 148, 559–569 (2003)

    Article  MathSciNet  Google Scholar 

  • Li, F., Golden, B., Wasil, E.: A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2734–2742 (2007)

    Article  Google Scholar 

  • Li, X., Tian, P., Aneja, Y.P.: An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transp. Res. Part E 46, 1111–1127 (2010)

    Article  Google Scholar 

  • Lima, C.M.R.R., Goldbarg, M.C., Goldbarg, E.F.G.: A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electorn. Notes Discret. Math. 18, 171–176 (2004)

    Article  MathSciNet  Google Scholar 

  • Liu, S., Huang, W., Ma, H.: An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transp. Res. Part E 45, 434–445 (2009)

    Article  Google Scholar 

  • Mbarki, A., Kabbachi, B., Ezaidi, A., Benssaou, M.: Medical waste management: a case study of the souss-massa-draa region, Morocco. J. Environ. Prot. 4, 914–919 (2013)

    Article  Google Scholar 

  • Nahata, B., Ostaszewski, K., Sahoo, P.: Rising health care expenditures: a demand-side analysis. J. Insur. Issues 28(1), 88–102 (2005)

    Google Scholar 

  • Paraskevopoulus, D.C., Repoussis, P.P., Tarantilis, C.D., Ioannou, G., Prastacos, G.P.: A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. J. Heuristics 14, 425–455 (2008)

    Article  Google Scholar 

  • Prins, C.: Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng. Appl. Artif. Intell. 22, 916–928 (2009)

    Article  Google Scholar 

  • Renaud, J., Boctor, F.F.: A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140, 618–628 (2002)

    Article  MathSciNet  Google Scholar 

  • Repoussis, P.P., Tarantilis, C.D.: Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transp. Res. Part C 18, 695–712 (2010)

    Article  Google Scholar 

  • Semet, F., Taillard, E.: Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41, 469–488 (1993)

    Article  Google Scholar 

  • Tabasi, R., Marthandan, G.: Clinical waste management: a review on important factors in clinical waste generation rate. Int. J. Sci. Technol. 3(3) (2013)

    Google Scholar 

  • Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. Oper. Res. 33, 1–14 (1999)

    Article  MathSciNet  Google Scholar 

  • Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Oper. Res. 152, 148–158 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Faculty of Industrial Technology, Bandung Institute of Technology, Jalan Ganeca 10, Bandung, West Java, 40132, Indonesia

    Joseph Sebastian Widagdo & Andi Cakravastia

Authors
  1. Joseph Sebastian Widagdo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andi Cakravastia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph Sebastian Widagdo .

Editor information

Editors and Affiliations

  1. Institute of Computer-Aided Product Development Systems, University of Stuttgart, Stuttgart, Germany

    Bernadetta Kwintiana Ane

  2. Department of Industrial Engineering, Bandung Institute of Technology, Bandung, Indonesia

    Andi Cakravastia

  3. Industrial Engineering, Bandung Institute of Technology, Bandung, Indonesia

    Lucia Diawati

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Widagdo, J.S., Cakravastia, A. (2019). Tabu Search Algorithm for the Vehicle Routing Problem with Time Windows, Heterogeneous Fleet, and Accessibility Restrictions. In: Ane, B., Cakravastia, A., Diawati, L. (eds) Proceedings of the 18th Online World Conference on Soft Computing in Industrial Applications (WSC18). WSC 2014. Advances in Intelligent Systems and Computing, vol 864. Springer, Cham. https://doi.org/10.1007/978-3-030-00612-9_16

Download citation

Publish with us

Policies and ethics

Search

Navigation