Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
C
c2-planning-scheduling-paper
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Markus Klinik
c2-planning-scheduling-paper
Commits
9afca06a
Commit
9afca06a
authored
May 24, 2019
by
Markus Klinik
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
implementation: structure
parent
3b28d614
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
20 additions
and
10 deletions
+20
-10
implementation.tex
implementation.tex
+20
-10
No files found.
implementation.tex
View file @
9afca06a
\section
{
Implementation
}
\section
{
Implementation
}
\label
{
sec:implementation
}
\label
{
sec:implementation
}
In this section we describe some design decisions of the implementation of our method.
We have implemented our algorithm in the functional programming language Clean.
The source code is available at our university's GitLab.
\footnote
{
\url
{
https://gitlab.science.ru.nl/mklinik/ga-scheduler
}}
The implementation works in two phases.
The implementation works in two phases.
Phase one uses a genetic algorithm to find a
n assignment
.
Phase one uses a genetic algorithm to find a
set of good assignments
.
Phase two uses th
is assignment to build a schedule
.
Phase two uses th
ese assignments to build schedules
.
\subsection
{
Genetic Algorithm
}
\subsection
{
Genetic Algorithm
}
Describe our implementation.
Our genetic algorithm is based on the implementation by
\citet
{
Alexeev2014SimpleGeneticAlgorithm
}
.
We ported his code from Haskell to Clean and extended it in a number of ways to make it fit our needs.
\paragraph
{
Encoding
}
\paragraph
{
Selection
}
\paragraph
{
Crossover
}
\paragraph
{
Mutation
}
\paragraph
{
Constraints and invalid assignments
}
\paragraph
{
Scalarization
}
\begin{itemize}
[noitemsep]
\item
crossover
\item
mutation
\item
constraints
\item
scalarization
\item
invalid assignments
\end{itemize}
\subsection
{
Greedy Schedule Building
}
\subsection
{
Greedy Schedule Building
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment