Skip to main content

Solving the Problem of Distribution of Fiscal Coupons by Using a Steady State Genetic Algorithm

  • Conference paper
  • First Online:
Innovations in Bio-Inspired Computing and Applications (IBICA 2017)

Abstract

When customers buy goods or services from business entities they are usually given a receipt that is known with the name fiscal or tax coupon, which, among the others, contains details about the value of the transaction. In some countries, the fiscal coupons can be collected during a certain period of time and, at the end of the collection period, they can be handed over to the tax authorities in exchange for a reward, whose price depends on the number of collected coupons and the sum of their values. From the optimisation perspective, this incentive becomes interesting when, both the number of coupons and the sum of their value is large. Hence, in this paper, we model this problem in mathematical terms and devise a test set that can be used for benchmarking purposes. Furthermore, we propose a solution based on Genetic Algorithms, where we compare its results versus the results to the solution of the relaxed versions of the proposed problem. The computational experiments indicate that the proposed solution obtains promising results for complex problem instances, which show that the proposed algorithm can be used to solve realistic problems in a matter of few seconds by utilizing standard personal computers.

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

Access this chapter

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

  1. Tax Administration of Kosovo: Tax Administration of Kosovo, February 2015. http://www.atk-ks.org/

  2. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, Y., Hao, J.-K.: Memetic search for the generalized quadratic multiple knapsack problem. IEEE Trans. Evol. Comput. 20(6), 908–923 (2016)

    Article  Google Scholar 

  4. Yeoh, W., Felner, A., Koenig, S.: BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 2 (2008)

    Google Scholar 

  5. Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 1 (2004)

    Google Scholar 

  6. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd Annual Symposium on SFCS 2008. IEEE (1982)

    Google Scholar 

  7. Kızıltan, Z., Hnich, B.: Symmetry breaking in a rack configuration problem. In: IJCAI 2001 Workshop on Modelling and Solving Problems with Constraints (2001)

    Google Scholar 

  8. Whitley, D., Kauth, J.: GENITOR: a different genetic algorithm. In: 1988 Rocky Mountain Conference on Artificial Intelligence (1988)

    Google Scholar 

  9. Luke, S.: Essentials of Metaheuristics, 2nd edn. Lulu (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kadri Sylejmani .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hyseni, Q., Yildirim Yayilgan, S., Krasniqi, B., Sylejmani, K. (2018). Solving the Problem of Distribution of Fiscal Coupons by Using a Steady State Genetic Algorithm. In: Abraham, A., Haqiq, A., Muda, A., Gandhi, N. (eds) Innovations in Bio-Inspired Computing and Applications. IBICA 2017. Advances in Intelligent Systems and Computing, vol 735. Springer, Cham. https://doi.org/10.1007/978-3-319-76354-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-76354-5_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-76353-8

  • Online ISBN: 978-3-319-76354-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics