{"id":20676787,"url":"https://github.com/bilal-belli/binpackingproblem","last_synced_at":"2025-09-14T20:25:58.215Z","repository":{"id":180004777,"uuid":"611194683","full_name":"Bilal-Belli/BinPackingProblem","owner":"Bilal-Belli","description":"This repository serves as a comprehensive collection of solutions and implementations for the Bin Packing 1D problem.","archived":false,"fork":false,"pushed_at":"2023-07-13T01:30:42.000Z","size":972,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-10T18:54:12.487Z","etag":null,"topics":["binpacking","heuristic-search-algorithms","hybrid-solution","optimisation","python","tkinter"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Bilal-Belli.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}},"created_at":"2023-03-08T10:14:53.000Z","updated_at":"2024-12-08T10:24:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"707438d7-60e4-4f63-a082-aeca4fa0bc72","html_url":"https://github.com/Bilal-Belli/BinPackingProblem","commit_stats":{"total_commits":24,"total_committers":2,"mean_commits":12.0,"dds":"0.45833333333333337","last_synced_commit":"7c5e7602042db40904685b42ff37ed594f856224"},"previous_names":["bilal-belli/binpackingproblem"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Bilal-Belli/BinPackingProblem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Bilal-Belli%2FBinPackingProblem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Bilal-Belli%2FBinPackingProblem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Bilal-Belli%2FBinPackingProblem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Bilal-Belli%2FBinPackingProblem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Bilal-Belli","download_url":"https://codeload.github.com/Bilal-Belli/BinPackingProblem/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Bilal-Belli%2FBinPackingProblem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275161242,"owners_count":25415959,"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","status":"online","status_checked_at":"2025-09-14T02:00:10.474Z","response_time":75,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["binpacking","heuristic-search-algorithms","hybrid-solution","optimisation","python","tkinter"],"created_at":"2024-11-16T21:13:41.880Z","updated_at":"2025-09-14T20:25:58.146Z","avatar_url":"https://github.com/Bilal-Belli.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bin Packing Problem Optimization Algorithmes\nThis repository serves as a comprehensive collection of solutions and implementations for the Bin Packing 1D problem. It is a classic optimization problem where a set of items with varying sizes must be packed into a fixed number of bins, while minimizing wasted space.\n## Code and Algorithmes\n### Language \u0026 Framework\n- The code is written in the Python language.\n- The framework for the GUI is Tkinter.\n### Features\n- Most common methods for resolving this problem.\n- Graphical user interface.\n\u003cdiv align=\"center\"\u003e\n   \u003cimg  width=\"683\" src=\"https://github.com/Bilal-Belli/BinPackingProblem/assets/74218805/1efc6755-c0a3-47e0-9cbb-86325abd0527\"\u003e\n\u003c/div\u003e\n\n### List of Implimented Algorithmes\n- Branch and bound.\n- Best Fit.\n- First Fit.\n- Next Fit.\n- Worst Fit\n- Tabu Search.\n- Genetic Algorithme.\n- Hybridation WWO (water waves optimiser) and Simulated Annealing.\n## Article (describe the hybridation schema)\n### Research Paper\nThe available research paper document about our hybrid solution is written in 'French'. You can check it in this \u003ca href=\"https://github.com/Bilal-Belli/BinPackingProblem/blob/main/ResearchPaper/OPT_SIQ1_EQUIPE02_RESEARCH_PAPER.pdf\"\u003elink\u003c/a\u003e.\n### Benchmarking\n- The resulting benchmark table is \u003ca href=\"https://github.com/Bilal-Belli/BinPackingProblem/blob/main/benchmarks/TableBenchmarkingResults.xlsx\"\u003ehere\u003c/a\u003e.\n- We chose to conduct our test on 18 benchmarks, which are available \u003ca href=\"https://github.com/Bilal-Belli/BinPackingProblem/tree/main/benchmarks\"\u003ehere\u003c/a\u003e.\n### Performances\n#### Comparaison Fitness between (Exact solution, WWO, WWO with hybridation)\n\u003cdiv align=\"center\"\u003e\n   \u003cimg  width=\"683\" src=\"https://github.com/Bilal-Belli/BinPackingProblem/assets/74218805/de5ba143-78a8-4ecf-a20b-ebc4149e1b01\"\u003e\n\u003c/div\u003e\n\n#### Comparaison Execution time between (WWO without hybridation and WWO with hybridation)\n\u003cdiv align=\"center\"\u003e\n   \u003cimg  width=\"683\" src=\"https://github.com/Bilal-Belli/BinPackingProblem/assets/74218805/53cff904-e973-446d-a4ba-c4889ad61a4a\"\u003e\n\u003c/div\u003e\n\n### For Testing\n- First, download or clone the repository.\n- Second, ensure that you have installed the required libraries and fixed dependencies (path).\n- There is a file named \"testParameters.py\". If you select another benchmarking file, you will need to make changes in this file (Bins max size and Number of objects).\n\n### License\nThis repository is licensed under the MIT License.\n\n### Thank you to the contributors\n- [abiiir-hub](https://github.com/abiiir-hub)\n- [Diihiia](https://github.com/Diihiia)\n- [Rayane-Aboud](https://github.com/Rayane-Aboud)\n- [rinkanilya](https://github.com/rinkanilya)\n- [tired-as-f](https://github.com/tired-as-f)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbilal-belli%2Fbinpackingproblem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbilal-belli%2Fbinpackingproblem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbilal-belli%2Fbinpackingproblem/lists"}