

<?xml version="1.0" encoding="UTF-8"?>
<record>
  <title>Multi-Venue Basketball Match Scheduling Based on Simulated Annealing Algorithm</title>
  <journal>Journal of Digital Information Management</journal>
  <author>Haiping Chen</author>
  <volume>23</volume>
  <issue>1</issue>
  <year>2025</year>
  <doi>https://doi.org/10.6025/jdim/2025/23/1/1-10</doi>
  <url>https://www.dline.info/fpaper/jdim/v23i1/jdimv23i1_1.pdf</url>
  <abstract>This work studies the multi-venue basketball event scheduling plan based on a simulated annealing algorithm,
aiming to improve the stability and fairness of event scheduling. By reviewing the application advantages
and disadvantages of traditional intelligent algorithms in basketball event scheduling, this paper introduces
the principle of simulated annealing algorithm and its application in basketball event scheduling. A basketball
tournament scheduling plan based on a simulated annealing algorithm was designed and implemented for
multiple competition venues, and its effectiveness was verified through experiments. The experimental results
show that compared with traditional intelligent algorithms, the plan exhibits better performance in terms of
stability and fairness.</abstract>
</record>
