Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming (2405.11305v1)

Published 18 May 2024 in cs.AI

Abstract: We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP). LNPS is a metaheuristic that starts with an initial solution and then iteratively tries to find better solutions by alternately destroying and prioritized searching for a current solution. Due to the variability of neighborhoods, LNPS allows for flexible search without strongly depending on the destroy operators. We present an implementation of LNPS based on ASP. The resulting heulingo solver demonstrates that LNPS can significantly enhance the solving performance of ASP for optimization. Furthermore, we establish the competitiveness of our LNPS approach by empirically contrasting it to (adaptive) large neighborhood search.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. 2016. Shift design with answer set programming. Fundamenta Informaticae 147(1):1–25.
  2. 2023. Flexible job-shop scheduling for semiconductor manufacturing with hybrid answer set programming (application paper). In Hanus, M., and Inclezan, D., eds., Proceedings of the Twenty-fifth International Symposium on Practical Aspects of Declarative Languages (PADL’23), volume 13880 of Lecture Notes in Computer Science, 1–11. Springer-Verlag.
  3. 2017. Unsatisfiable core shrinking for anytime answer set optimization. In Sierra, C., ed., Proceedings of the Twenty-sixth International Joint Conference on Artificial Intelligence (IJCAI’17), 4781–4785. IJCAI/AAAI Press.
  4. 2019. Anytime answer set optimization via unsatisfiable core shrinking. Theory and Practice of Logic Programming 19:533–551.
  5. 2018. Nurse (re)scheduling via answer set programming. Intelligenza Artificiale 12(2):109–124.
  6. 2012. Unsatisfiability-based optimization in clasp. In Dovier, A., and Santos Costa, V., eds., Technical Communications of the Twenty-eighth International Conference on Logic Programming (ICLP’12), volume 17, 212–221. Leibniz International Proceedings in Informatics (LIPIcs).
  7. 2013. Answer set programming as a modeling language for course timetabling. Theory and Practice of Logic Programming 13(4-5):783–798.
  8. 2019. teaspoon: Solving the curriculum-based course timetabling problems with answer set programming. Annals of Operations Research 275(1):3–37.
  9. 2011. Depth-driven circuit-level stochastic local search for SAT. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI’11), 504–509. IJCAI/AAAI.
  10. 2019. Exploring declarative local-search neighbourhoods with constraint programming. In Schiex, T., and de Givry, S., eds., Proceedings of the Twenty-Fifth International Conference on Principles and Practice of Constraint Programming (CP’19), volume 11802 of Lecture Notes in Computer Science, 37–53. Springer.
  11. 2020. Solving satisfaction problems using large-neighbourhood search. In Simonis, H., ed., Proceedings of the Twenty-Sixth International Conference on Principles and Practice of Constraint Programming (CP’20), volume 12333 of Lecture Notes in Computer Science, 55–71. Springer.
  12. 2015. asprin: Customizing answer set preferences without a headache. In Bonet, B., and Koenig, S., eds., Proceedings of the Twenty-ninth National Conference on Artificial Intelligence (AAAI’15), 1467–1474. AAAI Press.
  13. Brewka, G. 2004. Complex preferences for answer set optimization. In Dubois, D.; Welty, C.; and Williams, M., eds., Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR’04), 213–223. AAAI Press.
  14. 1997. Default logic as a query language. IEEE Transactions on Knowledge and Data Engineering 9(3):448–463.
  15. 2010. Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling 13(4):393–409.
  16. 2005. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102(1):71–90.
  17. 2018. Solver-independent large neighbourhood search. In Hooker, J. N., ed., Proceedings of the Twenty-Fourth International Conference on Principles and Practice of Constraint Programming (CP’18), volume 11008 of Lecture Notes in Computer Science, 81–98. Springer.
  18. 2017. Maxsat-based large neighborhood search for high school timetabling. Computers & Operations Research 78:172–180.
  19. 2016. Combining answer set programming and domain heuristics for solving hard industrial problems. Theory and Practice of Logic Programming 16(5-6):653–669.
  20. 1995. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15(3-4):289–323.
  21. 2022a. ALASPO: an adaptive large-neighbourhood ASP optimiser. In Kern-Isberner, G.; Lakemeyer, G.; and Meyer, T., eds., Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning (KR’22).
  22. 2022b. Large-neighbourhood search for optimisation in answer-set solving. In Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI’22), 5616–5625. AAAI Press.
  23. 2016. Applications of ASP. AI Magazine 37(3):53–68.
  24. 2003. Local branching. Mathematical Programming 98(1-3):23–47.
  25. 2013. Domain-specific heuristics in answer set programming. In desJardins, M., and Littman, M., eds., Proceedings of the Twenty-seventh National Conference on Artificial Intelligence (AAAI’13), 350–356. AAAI Press.
  26. 2015. Potassco User Guide. University of Potsdam, 2 edition.
  27. 2019. Multi-shot ASP solving with clingo. Theory and Practice of Logic Programming 19(1):27–82.
  28. 2011. Complex optimization in answer set programming. Theory and Practice of Logic Programming 11(4-5):821–839.
  29. 2015. Combining heuristics for configuration problems using answer set programming. In Calimeri, F.; Ianni, G.; and Truszczyński, M., eds., Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’15), volume 9345 of Lecture Notes in Artificial Intelligence, 384–397. Springer-Verlag.
  30. 2021. Constraint logic programming for real-world test laboratory scheduling. In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI’21), 6358–6366. AAAI Press.
  31. 1988. The stable model semantics for logic programming. In Kowalski, R., and Bowen, K., eds., Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP’88), 1070–1080. MIT Press.
  32. 2005. Randomized large neighborhood search for cumulative scheduling. In Biundo, S.; Myers, K. L.; and Rajan, K., eds., Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS’05), 81–89. AAAI.
  33. 2015. Stochastic local search algorithms: An overview. In Kacprzyk, J., and Pedrycz, W., eds., Handbook of Computational Intelligence, Springer Handbooks. Springer. 1085–1105.
  34. 2023. How to build your own asp-based system?! Theory and Practice of Logic Programming 23(1):299–361.
  35. 2007. The state of SAT. Discrete Applied Mathematics 155(12):1514–1524.
  36. 2017. Adaptive large neighborhood search for the curriculum-based course timetabling problem. Annals of Operations Research 252(2):255–282.
  37. 2021. Anytime multi-agent path finding via large neighborhood search. In Zhou, Z., ed., Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI’21), 4127–4135. ijcai.org.
  38. Lifschitz, V. 2019. Answer Set Programming. Springer-Verlag.
  39. 2024. Adaptive anytime multi-agent path finding using bandit-based large neighborhood search. In Wooldridge, M. J.; Dy, J. G.; and Natarajan, S., eds., Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI’24), 17514–17522. AAAI Press.
  40. 2017. Integer programming for minimal perturbation problems in university course timetabling. Annals of Operations Research 252(2):283–304.
  41. 2019. Large neighborhood search. In Gendreau, M., and Potvin, J.-Y., eds., Handbook of Metaheuristics. Springer International Publishing. 99–127.
  42. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4):455–472.
  43. 2000. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 4(5):359–388.
  44. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. In Maher, M. J., and Puget, J., eds., Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP’98), volume 1520 of Lecture Notes in Computer Science, 417–431. Springer.
  45. 2011. Hybrid search for minimal perturbation in dynamic CSPs. Constraints 16(3):228–249.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets