Skip to main content
SpringerLink
Log in

A Hybrid Constructive Mat-heuristic Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9595))

Included in the following conference series:

Abstract

In this paper, a variant of Vehicle Routing Problem, called Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery (HVRPSPD), is considered. The HVRPSPD can be defined as determining the routes and vehicle types on each route in such a way that the pickup and delivery demands of each customer must be performed with same vehicle, while minimizing the total cost. We propose a mathematical model for the problem and some valid inequalities for the model. Since the HVRPSPD is an NP-hard problem, the proposed mathematical model can be used to find the optimal solution for the small-size problems. Therefore we propose a hybrid mat-heuristic approach based on the formulation and Local Search to solve medium and large-size HVRPSPDs. A series of experiments is performed to evaluate the performance of proposed algorithm. Computational results show that hybrid mat-heuristic is computationally efficient to find good quality of initial solutions.

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

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Toth, P., Vigo, D.: The vehicle routing problem. Society for Industrial and Applied Mathematics (2001)

    Google Scholar 

  3. Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408–416 (2009)

    Article  MathSciNet  Google Scholar 

  4. Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49–66 (1984)

    Article  MATH  Google Scholar 

  5. Salhi, S., Rand, G.K.: Incorporating vehicle routing into the vehicle fleet composition problem. Eur. J. Oper. Res. 66(3), 313–330 (1993)

    Article  MATH  Google Scholar 

  6. Gheysens, F., Golden, B., Assad, A.: A new heuristic for determining fleet size and composition. In: Gallo, G., Sandi, C. (eds.) Netflow at Pisa. Mathematical Programming Studies, vol. 26, pp. 233–236. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  7. Taillard, É.D.: A heuristic column generation method for the heterogeneous fleet vrp. Revue française d’automatique, d’informatique et de Recherche Opérationnelle Recherche Opérationnelle 33(1), 1–14 (1999)

    Google Scholar 

  8. 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(1), 148–158 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Baldacci, R., Toth, P., Vigo, D.: Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1), 213–245 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hoff, A., Andersson, H., Christiansen, M., Hasle, G., Løkketangen, A.: Industrial aspects and literature survey: fleet composition and routing. Comput. Oper. Res. 37(12), 2041–2061 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15(1), 1–31 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Parragh, S.N., Doerner, K., Hartl, R.F.: A survey on pickup and delivery models part i: transportation between customers and depot. J. Betriebswirtschaft 58, 21–51 (2008)

    Article  Google Scholar 

  13. Rieck, J., Zimmermann, J.: A hybrid algorithm for vehicle routing of less-than-truckload carriers. In: Sörensen, K., Sevaux, M., Habenicht, W., Geiger, M.J. (eds.) Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems, vol. 624, pp. 155–171. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Çetin, S., Gencer, C.: Heterojen araç filolu zaman pencereli eş zamanlı dağıtım-toplamalı araç rotalama problemleri: Matematiksel model. Int. J. Research Dev. 3(1), 19–27 (2011)

    Google Scholar 

  15. Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 23(1), 79–96 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ríos-Mercado, R.Z., López-Pérez, J.F., Castrillón-Escobar, A.: A GRASP for a multi-depot multi-commodity pickup and delivery problem with time windows and heterogeneous fleet in the bottled beverage industry. In: Pacino, D., Voß, S., Jensen, R.M. (eds.) ICCL 2013. LNCS, vol. 8197, pp. 143–157. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Hoos, H.H., Stützle, T.: Stochastic local search: Foundations & applications. Elsevier (2004)

    Google Scholar 

  18. Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393–410 (1954)

    MathSciNet  Google Scholar 

  19. Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Program. 106(2), 365–390 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Boschetti, M.A., Maniezzo, V., Roffilli, M., Bolufé Röhler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171–177. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Croce, D.F., Salassa, F.: A variable neighborhood search based matheuristic for nurse rostering problems. Ann. Oper. Res. 218(1), 185–199 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Della Croce, F., Grosso, A., Salassa, F.: A matheuristic approach for the total completion time permutation flow shop problem. Operations Research for Complex Decision Making, pp. 20 (2010)

    Google Scholar 

  23. Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41–53. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Raidl, G.R., Puchinger, J.: Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.) An Emerging Approach to Optimization. Studies in Computational Intelligence, vol. 114, pp. 31–62. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Maniezzo, V., Stützle, T., Vo, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Heidelberg (2010)

    Book  Google Scholar 

  26. Dondo, R., Cerdá, J.: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176(3), 1478–1507 (2007)

    Article  MATH  Google Scholar 

  27. Liu, F.H., Shen, S.Y.: The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50, 721–732 (1999)

    Article  MATH  Google Scholar 

  28. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  29. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. oper. Res. Soc. 50, 1034–1042 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Baskent University, Ankara, Turkey

    Baris Kececi & Imdat Kara

  2. Department of Industrial Engineering, Gazi University, Ankara, Turkey

    Fulya Altiparmak

Authors
  1. Baris Kececi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fulya Altiparmak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Imdat Kara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Baris Kececi .

Editor information

Editors and Affiliations

  1. University of Málaga, Málaga, Spain

    Francisco Chicano

  2. Austrian Insttitute of Technology, Vienna, Austria

    Bin Hu

  3. University of Granada, Granada, Spain

    Pablo García-Sánchez

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kececi, B., Altiparmak, F., Kara, I. (2016). A Hybrid Constructive Mat-heuristic Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery. In: Chicano, F., Hu, B., García-Sánchez, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2016. Lecture Notes in Computer Science(), vol 9595. Springer, Cham. https://doi.org/10.1007/978-3-319-30698-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30698-8_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30697-1

  • Online ISBN: 978-3-319-30698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation