Soccer game optimizitation for continous and disecrete problem  

Oleh:

Purnomo, Hindriyanto Dwi

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI - atma jaya
Dalam koleksi: Metris: Jurnal Mesin, Elektro, Industri dan Sains vol. 15 no. 02 (Dec. 2014), page 65-76.
Topik: Inventory; Lost sales; Finite Planning Horizon

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: MM42 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Soccer games optimization is a new metaheuristics method that mimics the soccer player's movement,whwerein each player decides their best positions to dribble the ball the ball towards the goal based on the ball position and other player's position. This paper discussed the method for continous and disecrete problems based on 'pair cooperation'between a player and the ball position. The algorithm is implemented in eight benchmark problems consisting of continous uncontrained problems, continous contrained problems and discrete problem. The performance of the algorithm for the continous unconstrained problems is compared to two meta-heuristic algorithms, the genetic algorithm and the practicle swarm optimization. The continous contrained problems and disecrete problems are compared with the result in the literature. the experimental results show that the algorithm is a potentially powerful optimization procedure that can be aplied for various optimization problems.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali