# Load Balancing between Bins (heuristic or approximation algorithm)?

 2 I've done 2 load balancing examples with such a bin packing problem: Cloud balance (tutorial, video, benchmark report) Machine reassignment Google roadef 2012 (docs) In my experience, the approximation algorithm construction heuristic First Fit Decreasing works ok. But it can improve a lot to suffix it with a few milliseconds or seconds of Tabu Search. answered 14 May '12, 04:04 Geoffrey De ... ♦ 3.6k●3●27●64 accept rate: 6% I've seen the references I think I'm going to try that. Inicially I was going to try ant colony. But after readung about it and seeing your work on Cloud Balance seems the righ way to do it. Also, I usually have about 150/30 (machines/jobs), so this might work well. Let's see... Thanks man... (14 May '12, 19:43) Simon Ant Colony implementation is on Drools Planner's long term todo list. We welcome contributions (github pull requests), so if you feel like implementing Ant Colony (so you can compare it with Tabu Search and Sim Ann with the Planner benchmarker): A prototype implementation should not be hard to implement, because it can copy DefaultLocalSearchSolverPhase and reuse the classes Termination, Move, MoveSelector, ... and be phased after a construction heuristic. (15 May '12, 03:39) Geoffrey De ... ♦
 toggle preview community wiki

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "Title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported

Tags: