Skip to content

Commit

Permalink
Example notebook PFSP (#110)
Browse files Browse the repository at this point in the history
* Initial version notebook

* Add to README and index

* Update notebook

* Nearly completed notebook

* Full version PFSP notebook

* Add .DS_Store to gitignore
  • Loading branch information
leonlan committed Nov 13, 2022
1 parent 6aafaad commit fd0c9e1
Show file tree
Hide file tree
Showing 5 changed files with 910 additions and 0 deletions.
3 changes: 3 additions & 0 deletions .gitignore
Original file line number Diff line number Diff line change
Expand Up @@ -70,3 +70,6 @@ venv/
.ipynb_checkpoints/

*.lock

# macOS
*.DS_Store
6 changes: 6 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -29,6 +29,11 @@ showing how the ALNS library may be used. These include:
an instance with 90 jobs and 4 resources to within 4% of the best known solution,
using a number of different operators and enhancement techniques from the
literature.
- The permutation flow shop problem (PFSP), [here][9]. We solve an instance with
50 jobs and 20 machines to within 1.5% of the best known solution. Moreover,
we demonstrate multiple advanced features of ALNS, including auto-fitting the
acceptance criterion and adding local search to repair operators. We also
demonstrate how one could tune ALNS parameters.

Finally, the features notebook gives an overview of various options available
in the `alns` package (explained below). In the notebook we use these different
Expand Down Expand Up @@ -63,3 +68,4 @@ in the documentation.
[6]: https://alns.readthedocs.io/en/latest/examples/resource_constrained_project_scheduling_problem.html
[7]: https://alns.readthedocs.io/en/latest/
[8]: https://alns.readthedocs.io/en/latest/examples/capacitated_vehicle_routing_problem.html
[9]: https://alns.readthedocs.io/en/latest/examples/permutation_flow_shop_problem.html
877 changes: 877 additions & 0 deletions docs/source/examples/permutation_flow_shop_problem.ipynb

Large diffs are not rendered by default.

23 changes: 23 additions & 0 deletions docs/source/examples/tai50_20_8.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
number of jobs, number of machines, initial seed, upper bound and lower bound :
50 20 1861070898 3709 3383
processing times :
43 50 51 88 95 52 15 25 2 21 74 1 89 78 14 48 91 33 46 1 39 51 62 77 77 29 82 39 62 27 47 17 60 15 94 97 65 35 5 1 66 49 3 33 98 45 3 25 74 61
57 90 81 15 66 1 89 31 20 46 93 78 41 30 42 71 6 16 76 63 54 38 88 36 69 51 67 54 76 47 37 15 6 62 19 7 97 37 37 60 81 28 87 95 85 76 69 44 70 24
31 19 14 10 78 15 91 35 79 78 45 79 47 33 75 81 66 78 41 38 55 75 5 57 67 12 21 88 47 42 12 25 32 89 11 34 10 95 9 88 79 60 59 81 4 58 40 95 81 1
67 68 38 40 28 5 26 59 77 60 69 57 43 90 30 46 49 77 67 54 7 38 26 83 95 44 84 41 5 12 87 16 4 83 97 58 80 22 1 89 98 92 90 20 14 76 23 54 18 34
67 37 74 4 15 93 4 9 33 97 79 75 91 79 23 60 97 55 76 14 2 3 3 64 94 63 48 67 32 15 45 31 10 70 75 71 50 25 74 94 7 79 25 74 14 95 54 74 44 44
25 21 12 6 56 19 75 35 64 89 99 36 32 53 67 68 97 9 16 55 91 5 81 67 86 26 41 48 28 19 88 37 40 23 27 11 8 5 87 39 32 23 82 32 95 19 88 29 54 11
26 49 42 15 66 67 40 97 13 54 23 1 74 95 45 3 80 78 31 76 52 79 71 58 9 61 20 53 62 45 25 59 71 96 34 50 25 36 18 34 39 39 81 62 25 82 91 26 63 78
91 13 94 52 7 71 1 84 38 61 32 49 63 72 86 63 80 87 55 53 99 7 35 72 45 14 36 35 86 81 41 58 34 43 47 10 23 36 56 84 53 85 32 8 33 67 65 35 19 92
20 64 97 82 36 99 41 30 80 70 61 42 51 15 16 60 47 15 26 96 82 98 59 19 1 50 16 2 6 68 86 62 58 23 12 89 19 31 70 68 29 47 43 47 45 92 81 44 84 64
30 58 95 96 92 54 18 20 27 59 22 93 6 95 58 12 16 93 40 87 5 41 88 92 64 45 13 61 51 70 81 25 54 97 85 7 65 84 80 65 21 9 32 95 20 28 64 29 82 82
22 39 64 56 9 17 55 40 87 60 92 11 51 78 3 73 48 38 92 81 85 90 46 72 58 60 94 85 94 63 23 92 45 97 14 80 59 30 24 44 99 33 90 25 54 91 61 29 1 59
64 60 75 83 41 27 94 22 96 21 53 77 85 33 20 1 90 71 62 94 86 61 15 87 53 30 77 9 34 2 39 54 8 44 12 93 18 88 21 54 94 5 43 89 98 99 43 85 80 7
77 26 69 97 76 37 50 99 80 68 24 47 7 70 91 87 73 7 20 70 3 7 12 76 2 66 45 13 33 66 8 54 4 50 98 38 52 58 57 13 8 9 8 95 27 28 17 38 72 89
53 51 99 24 98 52 67 31 34 61 60 17 82 25 12 61 84 89 11 25 50 11 61 81 14 72 86 87 7 57 81 33 52 4 73 98 2 27 46 84 7 48 67 86 6 36 14 86 75 21
94 51 39 5 19 71 76 23 92 81 88 8 71 9 68 16 87 3 7 38 69 23 17 27 60 75 65 33 47 60 23 30 73 4 82 8 36 20 70 42 62 49 21 3 18 96 41 94 41 58
27 38 8 21 26 5 2 65 58 83 10 34 29 82 89 32 47 43 42 42 16 7 11 27 46 78 73 27 69 38 41 38 50 28 76 39 51 57 39 46 69 15 22 7 67 16 50 76 13 11
11 54 39 65 70 17 17 99 97 45 35 50 5 48 75 71 44 60 59 24 39 64 39 1 65 65 1 12 97 31 21 71 1 37 89 24 15 94 22 94 33 84 45 19 48 89 33 63 38 26
3 64 6 65 89 13 71 22 2 33 99 71 51 61 33 57 56 33 32 52 86 6 9 88 87 57 98 92 39 38 78 54 31 53 92 69 52 87 11 34 67 52 30 9 78 34 14 24 64 6
23 2 29 60 1 88 17 54 8 9 10 20 12 7 5 68 16 79 54 55 41 26 6 78 35 74 68 72 6 73 12 18 85 3 66 72 72 61 22 77 86 46 72 31 27 8 67 5 88 31
55 36 65 96 96 96 91 82 3 47 4 93 74 12 95 82 42 99 57 44 79 48 23 31 57 55 52 4 83 88 67 67 20 34 41 59 74 35 8 26 90 25 23 23 71 1 72 49 73 18
1 change: 1 addition & 0 deletions docs/source/index.rst
Original file line number Diff line number Diff line change
Expand Up @@ -19,6 +19,7 @@ The documentation hosted on this site provides several examples of how the ALNS
examples/resource_constrained_project_scheduling_problem
examples/travelling_salesman_problem
examples/capacitated_vehicle_routing_problem
examples/permutation_flow_shop_problem
other single-trajectory heuristics

.. toctree::
Expand Down

0 comments on commit fd0c9e1

Please sign in to comment.