{"id":22686852,"url":"https://github.com/danuaemx/bin_packing_deap_espanol","last_synced_at":"2025-03-29T15:34:30.729Z","repository":{"id":264547847,"uuid":"893622488","full_name":"danuaemx/bin_packing_deap_espanol","owner":"danuaemx","description":"Proyecto para solucionar el problema de bin packing, para cajas de distintas dimensiones y contenedores distintos, con restricciones de cantidad y opcionalidad","archived":false,"fork":false,"pushed_at":"2024-12-03T02:02:53.000Z","size":130,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-04T16:27:37.705Z","etag":null,"topics":["2d-bin-packing","3d-bin-packing-problem","bpp","deap","espanol","first-fit-algorithm","genetic-algorithm","gui","mvc-pattern","pyqt5","python"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/danuaemx.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2024-11-24T22:36:00.000Z","updated_at":"2024-12-15T02:04:49.000Z","dependencies_parsed_at":"2024-11-25T01:18:24.066Z","dependency_job_id":"5de57fe2-1ce0-4b75-bd28-41e83f9bbe59","html_url":"https://github.com/danuaemx/bin_packing_deap_espanol","commit_stats":null,"previous_names":["danuaemx/bin_packaging_3d_deap_spanish_trs","danuaemx/bin_packing_deap_espanol"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danuaemx%2Fbin_packing_deap_espanol","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danuaemx%2Fbin_packing_deap_espanol/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danuaemx%2Fbin_packing_deap_espanol/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danuaemx%2Fbin_packing_deap_espanol/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/danuaemx","download_url":"https://codeload.github.com/danuaemx/bin_packing_deap_espanol/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246206716,"owners_count":20740710,"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":["2d-bin-packing","3d-bin-packing-problem","bpp","deap","espanol","first-fit-algorithm","genetic-algorithm","gui","mvc-pattern","pyqt5","python"],"created_at":"2024-12-09T23:15:49.346Z","updated_at":"2025-03-29T15:34:30.701Z","avatar_url":"https://github.com/danuaemx.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bin Packing con DEAP en Español\n\nProyecto para solucionar el problema de bin packing, para cajas de distintas dimensiones y contenedores distintos, con restricciones de cantidad y opcionalidad.\n\n## Descripción\n\nEste proyecto utiliza el framework DEAP (Distributed Evolutionary Algorithms in Python) para resolver el problema de bin packing. El objetivo es distribuir un conjunto de cajas de diferentes dimensiones en un número mínimo de contenedores, respetando las restricciones de cantidad y opcionalidad.\n\nEl problema de bin packing es un problema NP-difícil en el campo de la optimización combinatoria. Se utiliza en diversas aplicaciones como la logística, la planificación de la producción y la gestión de inventarios.\n\n## Características\n\n- **Optimización Evolutiva**: Utiliza algoritmos evolutivos para encontrar soluciones óptimas.\n- **Flexibilidad**: Soporta cajas y contenedores de diferentes dimensiones.\n- **Restricciones**: Permite definir restricciones de cantidad y opcionalidad.\n- **Configurabilidad**: Fácil de configurar y ajustar parámetros del algoritmo.\n- **Interfaz gráfica integrada**: Usa Pyqt5 para mostrar gráficas e ingresar los datos del problema\n\n## Uso\n  1. Ejecuta\n   ```\n   #python3 ~/principal/principal.py\n   ```\n  2. La GUI es:\n     ![imagen](https://github.com/user-attachments/assets/1adcc625-9a21-4784-82a7-b93a13ff66f3)\n\n  3. Ejemplo simple:\n     Registrar el problema\n     \n     ![imagen](https://github.com/user-attachments/assets/d6852803-87a1-45f0-9cc2-b37605672197)\n\n     Posteriormente el resultado con 0.978456 de efectividad\n\n     ![imagen](https://github.com/user-attachments/assets/c47df36e-57b6-4732-948b-a0d1aa60069c)\n\n     Detallando gráficamente\n\n     ![imagen](https://github.com/user-attachments/assets/44b37a60-1c90-49ec-a711-628619fadd79)\n\n     ![imagen](https://github.com/user-attachments/assets/0b7ad8b3-278e-44bc-a85b-a7ded99ba0b6)\n\n     ![imagen](https://github.com/user-attachments/assets/43f87fb5-361f-4457-83ea-c2690352b2a1)\n\n     ![imagen](https://github.com/user-attachments/assets/c8eb0300-2dec-4cde-b718-0acaa3abf9a6)\n\n     ![imagen](https://github.com/user-attachments/assets/37a07aeb-6958-4ba1-9100-c297ce6dbf06)\n\n     ![imagen](https://github.com/user-attachments/assets/4ef950d3-88e3-43a7-bf41-cdd9aba0b179)\n\n     \n\n     \n\n\n\n     \n\n\n\n     \n\n\n     \n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanuaemx%2Fbin_packing_deap_espanol","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdanuaemx%2Fbin_packing_deap_espanol","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanuaemx%2Fbin_packing_deap_espanol/lists"}