{"id":26040616,"url":"https://github.com/chutrunganh/optimization-project-it3052e","last_synced_at":"2026-04-20T00:31:56.777Z","repository":{"id":219793421,"uuid":"749945822","full_name":"chutrunganh/Optimization-Project-IT3052E","owner":"chutrunganh","description":"Optimizing the bin packing problem, aiming to efficiently allocate items of varying sizes into a finite number of bins while maximizing total profit, using optimization algorithms","archived":false,"fork":false,"pushed_at":"2025-02-01T03:48:51.000Z","size":2507,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-02T04:49:35.175Z","etag":null,"topics":["bin-packing-problem","capstone-project","constraint-programming","greedy-algorithm","hust","it3052","it3052e","knapsack","linear-programming","local-search","optimization","project"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/chutrunganh.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-01-29T17:45:26.000Z","updated_at":"2025-03-09T07:46:20.000Z","dependencies_parsed_at":"2025-04-02T04:47:54.249Z","dependency_job_id":"fc97560c-294d-4b4e-b774-159579b74922","html_url":"https://github.com/chutrunganh/Optimization-Project-IT3052E","commit_stats":null,"previous_names":["chutrunganh/optimization-project-it3052e"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/chutrunganh/Optimization-Project-IT3052E","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chutrunganh%2FOptimization-Project-IT3052E","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chutrunganh%2FOptimization-Project-IT3052E/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chutrunganh%2FOptimization-Project-IT3052E/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chutrunganh%2FOptimization-Project-IT3052E/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chutrunganh","download_url":"https://codeload.github.com/chutrunganh/Optimization-Project-IT3052E/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chutrunganh%2FOptimization-Project-IT3052E/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32027985,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-20T00:18:06.643Z","status":"ssl_error","status_checked_at":"2026-04-20T00:17:31.068Z","response_time":55,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["bin-packing-problem","capstone-project","constraint-programming","greedy-algorithm","hust","it3052","it3052e","knapsack","linear-programming","local-search","optimization","project"],"created_at":"2025-03-07T12:46:17.291Z","updated_at":"2026-04-20T00:31:56.763Z","avatar_url":"https://github.com/chutrunganh.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bin Packing Problem\n\n## Problem Statement\n\nThe bin packing problem is an optimization problem in which items of different sizes must be packed into a finite number of bins or containers, each having a\nfixed given capacity, in a way that optimizes the problem depending on the desired outcome.\n\nThe goal in this case:\n\n1) An “item” is packed to at most 1 “bin”;\n2) Each “bin” must meet the requirements of loaded\nquantities: a lower bound \u0026 an upper bound;\n3) The profit gained from “packed items” is maximal.\n\nData provided:\n\n- K number of vehicles/bins\n- N number of items/orders. Each item has a weight (w) and a profit (p)\n- Lower bound (c1) and upper bound (c2) of each vehicle\n\nFor more explanation, problem modeling and implementation, please refer to our [report](https://github.com/chutrunganh/Optimization-Project-IT3052E/blob/main/Group-5-Bin-packing-problem.pdf)\n\n## Solution\n\nWe have implemented a solution for the bin packing problem using the following algorithms:\n\n1. Integer Linear Programming (ILP)\n2. Constraint Programming (CP)\n3. \"Greedy\" assigning method\n4. Local search algorithm for completion\n\n## Results\n\n![Results](/result.png)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchutrunganh%2Foptimization-project-it3052e","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchutrunganh%2Foptimization-project-it3052e","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchutrunganh%2Foptimization-project-it3052e/lists"}