{"id":22868720,"url":"https://github.com/lazernata/transport-problem","last_synced_at":"2025-03-31T10:51:29.266Z","repository":{"id":254427730,"uuid":"702984579","full_name":"lazernata/transport-problem","owner":"lazernata","description":"Bachelor's Thesis Work: Shiny app to solve the transport problem. Available in Spanish and English","archived":false,"fork":false,"pushed_at":"2024-08-23T09:58:55.000Z","size":515,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"v.0.1","last_synced_at":"2025-02-06T15:58:48.551Z","etag":null,"topics":["operational-research","rstudio","shinyapps","statistics"],"latest_commit_sha":null,"homepage":"","language":"R","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lazernata.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-10-10T11:33:19.000Z","updated_at":"2024-08-23T09:59:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"ec62a4fb-0cb9-46aa-a035-799fb1f9f5d5","html_url":"https://github.com/lazernata/transport-problem","commit_stats":null,"previous_names":["lazernata/transport-problem"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lazernata%2Ftransport-problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lazernata%2Ftransport-problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lazernata%2Ftransport-problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lazernata%2Ftransport-problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lazernata","download_url":"https://codeload.github.com/lazernata/transport-problem/tar.gz/refs/heads/v.0.1","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246458022,"owners_count":20780675,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["operational-research","rstudio","shinyapps","statistics"],"created_at":"2024-12-13T12:37:03.890Z","updated_at":"2025-03-31T10:51:29.238Z","avatar_url":"https://github.com/lazernata.png","language":"R","funding_links":[],"categories":[],"sub_categories":[],"readme":"## What is the transport problem?\nThe transportation (distribution) problem or theory is a particular model of the linear programming problem. This type of problem is about finding a way to minimize the transport costs for the distribution of a given good from the points of supply, called sources, to the points of reception, called destinations. A particular case of the transport problem is the assignment problem, which consists of optimally distributing tasks to workers, and the transshipment problem, when goods can pass through intermediate receiving and shipping points, i.e. transit points, to reach their final destination.\n\nIn order to solve the transport problem with RStudio, the user has to write a few lines of code and already be familiar with the program, as well as have it installed on the computer. However, in most cases, people do not know the structure of the R language, or the RStudio program, but still need to solve a transport problem. For this purpose, and also to demonstrate the possibilities of the Shiny package, an application has been developed to solve this particular type of\nstatistical problem.\n\n## Description of Shiny\nThe application [4] is composed of three pages: the main page (Figure 1), the guide (including instructions for the use of the application and a brief theoretical information of the transport problem), and, finally, the page with the general information of Shiny. In the main part, it can be seen that the need to work with the lines of code as such is eliminated, but the learner simply has to follow the following steps, which are also described in the second section of the application in the \u0026quot;Guide\u0026quot; part:\n1. Select the number of rows (origins) and columns (destinations), using the corresponding buttons.\n2. Select the type of problem to be solved with the \u0026quot;Select problem type\u0026quot; button.\n3. Select whether it is a maximization or minimization problem.\n4. Enter the transport cost matrix and the addresses of the constraints in the corresponding fields (Attention! To avoid malfunctioning of the program, it is mandatory to enter the addresses of the constraints as indicated in the application itself).\n5. Click on the \u0026quot;Solution\u0026quot; button to obtain the result. In this way, the time and effort needed to solve this problem is reduced, which is demonstrated in the following section, solving the previous example, using this Shiny.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flazernata%2Ftransport-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flazernata%2Ftransport-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flazernata%2Ftransport-problem/lists"}