Articles liés à Parallel Genetic Algorithmic approach for solving NRP

Parallel Genetic Algorithmic approach for solving NRP - Couverture souple

Bhandare, Nilesh; Mane, Sandip

 
9783659900365: Parallel Genetic Algorithmic approach for solving NRP
Couverture souple
ISBN 10 : 3659900362 ISBN 13 : 9783659900365
Editeur : LAP LAMBERT Academic Publishing, 2016

Synopsis

Nurse Rostering is a complex problem which arises in everyday activities and health care system in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. Even though solving the Nurse Rostering Problem has been interested field for research from many years, still the Nurse Rostering done by manually. Meta heuristics GA, have been proved to be very efficient in obtaining near-optimal solutions for a variety of hard combinatorial problems including the NRP. Heuristics Algorithm have shown excellent search abilities, but often lose their efficacy when applied to large and complex problems, Many optimization methods suffer from the curse of dimensionality, which shown that their performance deteriorates quickly as the dimensionality of the search space increases. Need to provide some degree of parallelism in traditional approach. Nowadays, GPGPUs are able to provide the necessary computational resources to tackle these high-dimensional problems maintaining a limited execution time and a high portability.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Nurse Rostering is a complex problem which arises in everyday activities and health care system in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. Even though solving the Nurse Rostering Problem has been interested field for research from many years, still the Nurse Rostering done by manually. Meta heuristics GA, have been proved to be very efficient in obtaining near-optimal solutions for a variety of hard combinatorial problems including the NRP. Heuristics Algorithm have shown excellent search abilities, but often lose their efficacy when applied to large and complex problems, Many optimization methods suffer from the curse of dimensionality, which shown that their performance deteriorates quickly as the dimensionality of the search space increases. Need to provide some degree of parallelism in traditional approach. Nowadays, GPGPUs are able to provide the necessary computational resources to tackle these high-dimensional problems maintaining a limited execution time and a high portability.

Biographie de l'auteur

Name of Author:- Mr. Nilesh Dilip Bhandare,Place:-Satara,Date of Birth:- 11/08/1989,Address :782/3 Shaniwar peth,Opp. Jivanjyoyt Hospita Satara MH India,Parent:- Mrs. Swati Dilip BhandareName of Co-Author:- Mr. Sandip Mane,Place:-Islampur

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2016
Langue
anglais
ISBN 10 
3659900362
ISBN 13 
9783659900365
Reliure
Broché
Nombre de pages
76
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne