抄録
In recent years, digital audio players have become quite widely used, thus the demand for function of generating playlists has increased. Playlist is the order we play several musical composition. And Traveling Salesman Problem (TSP) is optimization problem how we obtain the minimum path for traveling around all the cities and back to the first. In this paper, we focus on the order decision process of playlists. We substitute each musical tune with the city in TSP and the difference of impression between tunes with the distance between cities in TSP, then we show realizable functions and their advantages if we adopt obtained solution as playlist. As the result, by changing the conditions of distances between cities and so on we obtained the following playlists:(1) minimizing the difference of impression between neighboring tunes (2) maximizing the difference of impression between neighboring tunes (3) not thought to be repeated in looping playing mode (4) order of play gives us natural feeling to hear (5) for sharing in hearing by several people.
