Skip to main content
SpringerLink
Log in

A Tabu Search Algorithm for the Traveling Purchaser Problem with Transportation Time Limit

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14239))

Included in the following conference series:

  • 493 Accesses

Abstract

This study extends the well-known traveling purchaser problem (TPP) by considering a transportation time limit of perishable food in cold-chain logistics. The problem is called the traveling purchaser problem with transportation time limit (TPP-TTL). The objective of the TPP-TTL is to find a route and procurement plan for the purchaser to satisfy the demand of a number of product types with minimum cost. To satisfy the product demand, the purchaser visits a number of capacitated markets, in which the available amount of products is limited. Furthermore, since the travel times cause deterioration on the perishable products, a transportation time limit is taken into account in the TPP-TTL for each product type. The problem is formulated as a mixed-integer programming model and solved by using a tabu search (TS) algorithm. In the computational experiments, TS is carried out for a number of different-sized instances and the results are compared to the results obtained by GUROBI solver to determine the performance of the proposed algorithm. The results of the experiments show that the TS is capable to find many optimal results with less computational time than the GUROBI solver.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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. Almeida, C.P., Gonçalves, R.A., Goldbarg, E.F., Goldbarg, M.C., Delgado, M.R.: An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem. Ann. Oper. Res. 199(1), 305–341 (2012)

    Article  Google Scholar 

  2. Batista-Galvan, M., Riera-Ledesma, J., Salazar-Gonzalez, J.J.: The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach. Comput. Oper. Res. 40, 2103–2115 (2013)

    Article  Google Scholar 

  3. Bianchessi, N., Irnich, S., Tilk, C.: A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288, 152–170 (2021)

    Article  Google Scholar 

  4. Bianchessi, N., Mansini, R., Speranza, M.G.: The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235, 73–87 (2014)

    Article  Google Scholar 

  5. Boctor, F.F., Laporte, G., Renaud, J.: Heuristics for the traveling purchaser problem. Comput. Oper. Res. 30(4), 491–504 (2003)

    Article  Google Scholar 

  6. Cheaitou, A., Hamdan, S., Larbi, R., Alsyouf, I.: Sustainable traveling purchaser problem with speed optimization. Int. J. Sustain. Transp. 15(8), 621–640 (2021)

    Article  Google Scholar 

  7. Choi, M.J., Lee, S.H.: The multiple traveling purchaser problem for maximizing system’s reliability with budget constraints. Expert Syst. Appl. 38(8), 9848–9853 (2011)

    Article  Google Scholar 

  8. Gendreau, M., Hertz, A., Laporte, G.: A Tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)

    Article  Google Scholar 

  9. Glover, F.: Tabu search – Part I. ORSA J. Comput. 1(3), 190–206 (1989)

    Article  Google Scholar 

  10. Glover, F.: Tabu search – Part II. ORSA J. Comput. 2(1), 4–32 (1990)

    Article  Google Scholar 

  11. Gouveia, L., Paias, A., Voß, S.: Models for a traveling purchaser problem with additional side-constraints. Comput. Oper. Res. 38, 550–558 (2011)

    Article  Google Scholar 

  12. Kucukoglu, I.: The traveling purchaser problem with fast service option. Comput. Oper. Res. 141, 105700 (2022)

    Article  Google Scholar 

  13. Manerba, M., Mansini, R., Riera-Ledesma, J.: The traveling purchaser problem and its variants. Eur. J. Oper. Res. 259(1), 1–18 (2017)

    Article  Google Scholar 

  14. Laporte, G., Riera-Ledesma, J., Salazar-González, J.-J.: A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper. Res. 51(6), 940–951 (2003)

    Article  Google Scholar 

  15. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960)

    Article  Google Scholar 

  16. Qiu, M., Zhuo, F., Eglese, R., Qiong, T.: A Tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups. Comput. Oper. Res. 100, 102–116 (2018)

    Article  Google Scholar 

  17. Ramesh, T.: Traveling purchaser problem. Opsearch 18(1–3), 78–91 (1981)

    Google Scholar 

  18. Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A Tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170–186 (1997)

    Article  Google Scholar 

  19. Tsang, Y.P., Choy, K.L., Wu, C.H., Ho, G.T.S., Lam, H.Y., Tang, V.: An intelligent model for assuring food quality in managing a multi-temperature food distribution centre. Food Control 90, 81–97 (2018)

    Article  Google Scholar 

  20. Voß, S.: Dynamic tabu search strategies for the traveling purchaser problem. Ann. Oper. Res. 63, 253–275 (1996)

    Article  Google Scholar 

Download references

Acknowledgement

This work is supported by the Commission of Scientific Research Projects of Bursa Uludag University, Project Number FUİ-2022-1042.

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Bursa Uludag University, Bursa, Turkey

    Ilker Kucukoglu

  2. KU Leuven, KU Leuven Institute for Mobility – CIB, Leuven, Belgium

    Pieter Vansteenwegen & Dirk Cattrysse

Authors
  1. Ilker Kucukoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pieter Vansteenwegen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dirk Cattrysse
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilker Kucukoglu .

Editor information

Editors and Affiliations

  1. Hochschule für Wirtschaft und Recht Berlin, Berlin, Germany

    Joachim R. Daduna

  2. Deutsches Zentrum für Luft- und Raumfahrt (DLR), Berlin, Germany

    Gernot Liedtke

  3. Deutsches Zentrum für Luft- und Raumfahrt (DLR), Berlin, Germany

    Xiaoning Shi

  4. University of Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kucukoglu, I., Vansteenwegen, P., Cattrysse, D. (2023). A Tabu Search Algorithm for the Traveling Purchaser Problem with Transportation Time Limit. In: Daduna, J.R., Liedtke, G., Shi, X., Voß, S. (eds) Computational Logistics. ICCL 2023. Lecture Notes in Computer Science, vol 14239. Springer, Cham. https://doi.org/10.1007/978-3-031-43612-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43612-3_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43611-6

  • Online ISBN: 978-3-031-43612-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation