Skip to main content
Springer Nature Link
Log in

Solving the Travelling Umpire Problem with Answer Set Programming

  • Conference paper
  • First Online:
BNAIC 2016: Artificial Intelligence (BNAIC 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 765))

Included in the following conference series:

  • 711 Accesses

Abstract

In this paper, we develop an Answer Set Programming (ASP) solution to the Travelling Umpire Problem (TUP). We investigate a number of different ways to improve the computational performance of this solution and compare it to the current state-of-the-art. Our results demonstrate that the ASP solution is superior to other declarative solutions, such as Constraint Programming, but that it cannot match the most recent special-purpose algorithms from the literature. However, when compared to the earlier generation of special-purpose algorithms, it does quite well.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Pührer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L.K., Wallner, J.P., Xiao, G.: The fourth answer set programming competition: preliminary report. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 42–53. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40564-8_5

    Chapter  Google Scholar 

  2. Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151–181 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  3. Calimeri, F., et al.: The third answer set programming competition: preliminary report of the system competition track. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 388–403. Springer, Heidelberg (2011). doi:10.1007/978-3-642-20895-9_46

    Chapter  Google Scholar 

  4. de Oliveira, L., de Souza, C., Yunes, T.: Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic. EJOR 2, 592–600 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. de Oliveira, L., de Souza, C., Yunes, T.: On the complexity of the traveling umpire problem. Theor. Comput. Sci. 562, 101–111 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637–654. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04238-6_75

    Chapter  Google Scholar 

  7. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., Schaub, T.: Abstract gringo. In: TPLP (2015)

    Google Scholar 

  8. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the potsdam answer set solving collection. AI Communications 24(2), 107–124 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Baral, C., Brewka, G., Schlipf, J. (eds.): LPNMR 2007. LNCS (LNAI), vol. 4483. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  10. Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS, vol. 9345, pp. 531–544. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_44

    Chapter  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  12. Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507–523. Springer, Heidelberg (2011). doi:10.1007/978-3-642-25566-3_40

    Chapter  Google Scholar 

  13. Toffolo, T., Van Malderen, S., Wauters, T.V., Berghe, G.: Branch-and-Price and Improved Bounds to the Traveling Umpire Problem. PATAT, York (2014)

    MATH  Google Scholar 

  14. Toffolo, T., Wauters, T., Van Malderen, S., Vanden Berghe, G.: Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem. EJOR 3, 932–943 (2015)

    MATH  Google Scholar 

  15. Trick, M.A., Yildiz, H.: Bender‘s cuts guided large neighborhood search for the traveling umpire problem. In: Van Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 332–345. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72397-4_24

    Chapter  Google Scholar 

  16. Trick, M., Yildiz, H.: Benders’ cuts guided large neighborhood search for the traveling umpire problem. Naval Res. Logistics (NRL) 8, 771–781 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Trick, M., Yildiz, H.: Locally optimized crossover for the traveling umpire problem. EJOR 2, 286–292 (2012)

    Article  MathSciNet  Google Scholar 

  18. Trick, M., Yildiz, H., Yunes, T.: Scheduling major league baseball umpires and the traveling umpire problem. Interfaces 3, 232–244 (2012)

    Article  Google Scholar 

  19. Wauters, T.: http://benchmark.gent.cs.kuleuven.be/tup/ Accessed 27 Oct 2016

  20. Wauters, T., Van Malderen, S., Vanden Berghe, G.: Decomposition and local search based methods for the traveling umpire problem. EJOR 3, 886–898 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  21. Xue, L., Luo, Z., Lim, A.: Two exact algorithms for the traveling umpire problem. EJOR 3, 932–943 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science @ Technology Campus De Nayer, KU Leuven, J.-P. De Nayerlaan 5, 2860, St-katelijne-waver, Belgium

    Joost Vennekens

Authors
  1. Joost Vennekens
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joost Vennekens .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands

    Tibor Bosse

  2. Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands

    Bert Bredeweg

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Vennekens, J. (2017). Solving the Travelling Umpire Problem with Answer Set Programming. In: Bosse, T., Bredeweg, B. (eds) BNAIC 2016: Artificial Intelligence. BNAIC 2016. Communications in Computer and Information Science, vol 765. Springer, Cham. https://doi.org/10.1007/978-3-319-67468-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67468-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67467-4

  • Online ISBN: 978-3-319-67468-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics