pareto-optimal-student-supervisor-allocation | AI tool to assist universities

 by   rithinch Python Version: Current License: MIT

kandi X-RAY | pareto-optimal-student-supervisor-allocation Summary

kandi X-RAY | pareto-optimal-student-supervisor-allocation Summary

pareto-optimal-student-supervisor-allocation is a Python library. pareto-optimal-student-supervisor-allocation has no bugs, it has no vulnerabilities, it has build file available, it has a Permissive License and it has low support. You can download it from GitHub.

The problem of allocating students to supervisors for the development of a personal project or a dissertation is a crucial activity in the higher education environment, as it enables students to get feedback on their work from an expert and improve their personal, academic, and professional abilities. In this project, we propose a multi-objective and near Pareto optimal genetic algorithm for the allocation of students to supervisors. The allocation takes into consideration the students and supervisors' preferences on research/project topics, the lower and upper supervision quotas of supervisors, as well as the workload balance amongst supervisors. We introduce novel mutation and crossover operators for the student-supervisor allocation problem. The experiments carried out show that the components of the genetic algorithm are more apt for the problem than classic components, and that the genetic algorithm is capable of producing allocations that are near Pareto optimal in a reasonable time.
Support
    Quality
      Security
        License
          Reuse

            kandi-support Support

              pareto-optimal-student-supervisor-allocation has a low active ecosystem.
              It has 8 star(s) with 2 fork(s). There are 4 watchers for this library.
              OutlinedDot
              It had no major release in the last 6 months.
              There are 0 open issues and 1 have been closed. There are 4 open pull requests and 0 closed requests.
              It has a neutral sentiment in the developer community.
              The latest version of pareto-optimal-student-supervisor-allocation is current.

            kandi-Quality Quality

              pareto-optimal-student-supervisor-allocation has 0 bugs and 0 code smells.

            kandi-Security Security

              pareto-optimal-student-supervisor-allocation has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
              pareto-optimal-student-supervisor-allocation code analysis shows 0 unresolved vulnerabilities.
              There are 0 security hotspots that need review.

            kandi-License License

              pareto-optimal-student-supervisor-allocation is licensed under the MIT License. This license is Permissive.
              Permissive licenses have the least restrictions, and you can use them in most projects.

            kandi-Reuse Reuse

              pareto-optimal-student-supervisor-allocation releases are not available. You will need to build from source code and install.
              Build file is available. You can build the component from source.
              Installation instructions are not available. Examples and code snippets are available.

            Top functions reviewed by kandi - BETA

            kandi has reviewed pareto-optimal-student-supervisor-allocation and discovered the below as its top functions. This is intended to give you an instant insight into pareto-optimal-student-supervisor-allocation implemented functionality, and help decide if they suit your requirements.
            • Runs the experiments
            • Starts the genetic algorithm
            • Reads the experiment data from a file
            • Convert a string to the appropriate operator
            • Creates a GAMS file
            • Check if a student is an edge
            • Generate a random solution
            • Creates a random graph
            • Create an Excel excel file
            • Generate a solution to uniform solution
            • Runs the genetic algorithm
            • Removes all edges that satisfy the given supervisor
            • Cross crossover between two structures
            • Scans the input data and returns the input data
            • Returns a set of all available edges for a given sup
            • Return True if stu is a 4 cycle
            • Prints all experiments optsOpt student
            • Transfer a student
            • Creates random data excel
            • Generate roulette wheel
            • Solve a 4 cycle
            • Edit configuration file
            • Creates experiments from real data
            • Function to create experiment
            • Generate random allocation for a given structure
            • Computes the crossover between two solutions
            Get all kandi verified functions for this library.

            pareto-optimal-student-supervisor-allocation Key Features

            No Key Features are available at this moment for pareto-optimal-student-supervisor-allocation.

            pareto-optimal-student-supervisor-allocation Examples and Code Snippets

            No Code Snippets are available at this moment for pareto-optimal-student-supervisor-allocation.

            Community Discussions

            No Community Discussions are available at this moment for pareto-optimal-student-supervisor-allocation.Refer to stack overflow page for discussions.

            Community Discussions, Code Snippets contain sources that include Stack Exchange Network

            Vulnerabilities

            No vulnerabilities reported

            Install pareto-optimal-student-supervisor-allocation

            You can download it from GitHub.
            You can use pareto-optimal-student-supervisor-allocation like any standard Python library. You will need to make sure that you have a development environment consisting of a Python distribution including header files, a compiler, pip, and git installed. Make sure that your pip, setuptools, and wheel are up to date. When using pip it is generally recommended to install packages in a virtual environment to avoid changes to the system.

            Support

            For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .
            Find more information at:

            Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items

            Find more libraries
            CLONE
          • HTTPS

            https://github.com/rithinch/pareto-optimal-student-supervisor-allocation.git

          • CLI

            gh repo clone rithinch/pareto-optimal-student-supervisor-allocation

          • sshUrl

            git@github.com:rithinch/pareto-optimal-student-supervisor-allocation.git

          • Stay Updated

            Subscribe to our newsletter for trending solutions and developer bootcamps

            Agree to Sign up and Terms & Conditions

            Share this Page

            share link