Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2019: Computing and Combinatorics pp 567–579Cite as

Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints

  • Conference paper
  • First Online:

  • 934 Accesses

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

Abstract

The traveling purchaser problem (TPP), a generalization of the traveling salesman problem, is to determine a tour of suppliers and purchase needed products from suppliers, while minimizing the traveling and purchasing cost. This problem finds applications in the routing and scheduling contexts and its variants with different constraints have been widely studied. Motivated by the phenomenon that most real-world instances of TPP have a small parameter (such as the number of suppliers, the number of products to purchase and others), we study TPP and its variants from the view of parameterized complexity. We show that TPP and some variants are fixed-parameter tractable by taking the number k of products or the number m of suppliers as the parameter, and W[2]-hard by taking the number q of visited suppliers as the parameter. Furthermore, we implement some of our fixed-parameter tractable algorithms to show that they are practically effective when the parameters are not very large.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Ahuja, R.K., Orlin, J.B., Stein, C.: Improved algorithms for bipartite network flow. SIAM J. Comput. 23(5), 906–933 (1994)

    Article  MathSciNet  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

    Article  MathSciNet  Google Scholar 

  3. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9(1), 61–63 (1962)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. 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 

  6. Desaulniers, G.: Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1), 179–192 (2010)

    Article  MathSciNet  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Cornell University, Mathematical Sciences Institute (1992)

    Google Scholar 

  8. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor. Comput. Sci. 141(1), 109–131 (1995)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10, 196–210 (1962)

    Article  MathSciNet  Google Scholar 

  11. Ho, S.C., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)

    Article  Google Scholar 

  12. Kang, S., Ouyang, Y.: The traveling purchaser problem with stochastic prices: exact and approximate algorithms. Eur. J. Oper. Res. 209(3), 265–272 (2011)

    Article  MathSciNet  Google Scholar 

  13. Manerba, D., Gendreau, M., Mansini, R.: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach. Eur. J. Oper. Res. 148, 59–71 (2016)

    MathSciNet  MATH  Google Scholar 

  14. Mansini, R., Tocchella, B.: The traveling purchaser problem with budget constraint. Comput. Oper. Res. 36(7), 2263–2274 (2009)

    Article  MathSciNet  Google Scholar 

  15. Narayanaswamy, N., Raman, V., Ramanujan, M., Saurabh, S.: LP can be a cure for parameterized problems. In: 29th Symposium on Theoretical Aspects of Computer Science, STACS 2012, vol. 14, pp. 338–349. LIPIcs (2012)

    Google Scholar 

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

    MATH  Google Scholar 

  17. Ravi, R., Salman, F.S.: Approximation algorithms for the traveling purchaser problem and its variants in network design. In: Algorithms-ESA 1999, pp. 29–40 (1999)

    Chapter  Google Scholar 

  18. Singh, K.N., van Oudheusden, D.L.: A branch and bound algorithm for the traveling purchaser problem. Eur. J. Oper. Res. 97(3), 571–579 (1997)

    Article  Google Scholar 

  19. Zhang, Z., He, H., Luo, Z., Qin, H., Guo, S.: An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem. In: Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3432–3438 (2015)

    Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China, under grants 61772115 and 61370071.

Author information

Authors and Affiliations

  1. University of Electronic Science and Technology of China, Chengdu, China

    Mingyu Xiao, Jianan Zhang & Weibo Lin

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weibo Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingyu Xiao .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. Xidian University, Xi'an, China

    Zhenhua Duan

  3. Xidian University, Xi'an, China

    Cong Tian

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

Xiao, M., Zhang, J., Lin, W. (2019). Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26176-4_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26175-7

  • Online ISBN: 978-3-030-26176-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation