Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Masuda, H. Nojima, Y. Ishibuchi, H. |
| Copyright Year | 2014 |
| Description | Author affiliation: Osaka Prefecture Univ., Sakai, Japan (Masuda, H.; Nojima, Y.; Ishibuchi, H.) |
| Abstract | Various evolutionary multiobjective optimization (EMO) algorithms have been proposed in the literature. They have different search mechanisms for increasing the diversity of solutions and improving the convergence to the Pareto front. As a result, each algorithm has different characteristics in its search behavior. Multiobjective search behavior can be visually shown in an objective space for a test problem with two or three objectives. However, such a visual examination is difficult in a high-dimensional objective space for many-objective problems. The use of distance minimization problems has been proposed to examine many-objective search behavior in a two-dimensional decision space. This idea has an inherent limitation: the number of decision variables should be two. In our former study, we formulated a four-objective distance minimization problem with 10, 100, and 1000 decision variables. In this paper, we generalize our former study to many-objective problems with an arbitrary number of objectives and decision variables by proposing an idea of specifying reference points on a plane in a high-dimensional decision space. As test problems for computational experiments, we generate six-objective and eight-objective problems with 10, 100, and 1000 decision variables. Our experimental results on those test problems show that the number of decision variables has large effects on multiobjective search in comparison with the choice of an EMO algorithm and the number of objectives. |
| Starting Page | 2633 |
| Ending Page | 2640 |
| File Size | 692013 |
| Page Count | 8 |
| File Format | |
| e-ISBN | 9781479914883 |
| DOI | 10.1109/CEC.2014.6900642 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2014-07-06 |
| Publisher Place | China |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Minimization Vectors Visualization Optimization Field-flow fractionation Convergence Algorithm design and analysis |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|