Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/jbytecode/operationsresearchmodels.jl

A Julia package for operations research subjects
https://github.com/jbytecode/operationsresearchmodels.jl

assignment-problem cpm johnson-algorithm knapsack-problem maximum-flow minimum-spanning-tree p-median-problem pert scheduling shortest-path transportation-problem

Last synced: 22 days ago
JSON representation

A Julia package for operations research subjects

Host: GitHub
URL: https://github.com/jbytecode/operationsresearchmodels.jl
Owner: jbytecode
License: mit
Created: 2022-06-03T17:09:59.000Z (over 2 years ago)
Default Branch: main
Last Pushed: 2024-11-11T19:53:08.000Z (about 1 month ago)
Last Synced: 2024-11-11T20:31:25.690Z (about 1 month ago)
Topics: assignment-problem, cpm, johnson-algorithm, knapsack-problem, maximum-flow, minimum-spanning-tree, p-median-problem, pert, scheduling, shortest-path, transportation-problem
Language: Julia
Homepage:
Size: 517 KB
Stars: 22
Watchers: 2
Forks: 2
Open Issues: 0
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- License: LICENSE

Awesome Lists containing this project

README

        [![Doc](https://img.shields.io/badge/docs-dev-blue.svg)](https://jbytecode.github.io/OperationsResearchModels.jl/dev/)

# OperationsResearchModels.jl

A package for Operations Research problems.

# Installation 

```julia

julia> ]

(@v1.xx) pkg> add OperationsResearchModels

```

or 

```julia

julia> using Pkg

julia> Pkg.add("OperationsResearchModels")

```

# Implemented Problems and Algorithms

- [Assignment Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Assignment-Problem)

- [Transportation Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Transportation-Problem)

- [The Shortest Path](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Shortest-Path)

- [Maximum Flow](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Maximum-Flow)

- [Minimum Spanning Tree](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Minimum-Spanning-Tree)

- [p-median for Location Selection](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#pmedian)

- [CPM - Critical Path Method](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#CPM-(Critical-Path-Method))

- [PERT - Project Evaluation and Review Technique](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#PERT-(Project-Evalutation-and-Review-Technique))

- [The Knapsack Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Knapsack)

- [Johnson's Rule for Flow-Shop Scheduling](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Johnson's-Rule)

- [Flow-shop Scheduling using Permutation Encoded Genetic Algorithms (using a Random Key Genetic Algorithm)](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Genetic-Algorithm-for-the-problems-that-cannot-be-solved-with-using-Johnson's-Rule)

- [Traveling Salesman with Random Key Genetic Algorithm](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Traveling-Salesman)

- [Simplex Method with Real Valued Decision Variables](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Simplex)

# Notes for the users

The package is implemented for mostly academic purposes. The implementations are not optimized for large-scale problems. The users are encouraged to use the package for educational purposes and small-scale problems.