This paper presents the results of user interaction with two explorative music environments (sound system A and B) that were inspired from the Banda Linda music tradition in two different ways. The sound systems adapted to how a team of two players improvised and made a melody together in an interleaved fashion: Systems A and B used a fuzzy logic algorithm and pattern recognition to respond wit...

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

in this paper, we have proposed a new algorithm which combines pso and ga in such a way that the new algorithm is more effective and efficient.the particle swarm optimization (pso) algorithm has shown rapid convergence during the initial stages of a global search but around global optimum, the search process will become very slow. on the other hand, genetic algorithm is very sensitive to the in...

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

Subjects listened to a standard six-tone melody, followed by a comparison melody. The comparison melody was always transposed up four semitones from the standard, and this transposition was either exact or it was inexact while maintaining contour. Subjects judged whether or not the comparison melody formed an exact transposition of the standard. It was found that repetition of the standard melo...

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...