Tag Info

Google-OR Tools: Assignment minimizing overlapping members

The MIP model by Erwin Kalvelagen is a good way to solve the problem, and is probably quite efficient. As an alternative, the following MiniZinc model is a fairly straight-forward model based on the ...
• 196
Accepted

Google-OR Tools: Assignment minimizing overlapping members

It is often a good idea to split this task into two parts: Developing a mathematical model Implement the model (coding) Often, if you do a good job on (1), (2) becomes a breeze. Here is my attempt. ...
• 2,806

Optimizing Storage Allocation and Supply for Manufacturing with Time Constraints

I guess, as you correctly mentioned, this problem is too complex as actually many of the SCM problems are complex and I doubt one math formulation can handle all of its aspects. Instead, the problem ...
• 8,960
Accepted

Modeling: How to force customers visit their NEAREST facility

If the objective is to minimize total distance, this will happen naturally. But if you want to explicitly enforce it, you can impose a rule like \lnot(y_{ni} \land v_j) \quad \text{for all $n,i,j$ ...
• 32.7k
Accepted

Assignment Problem - Students and teachers

As in the comments: as it stands, the problem is infeasible. For student 3, they could never be given a class with any teacher, because they have never had at least two classes with any teacher. You ...
• 462
Accepted

Effective methods for solving the assignment and packing problem

I don't think the following heuristic can be said to "guarantee near-optimal solutions", but it is quite straightforward to code and can make efficient use of parallel threading/multiple ...
• 39.6k
Accepted

Assignment of colored boxes to groups

Here's a mixed integer linear programming formulation that I used to find an optimal solution with objective value $1506$ for your $10 \times 9$ instance. Let $(c_{ij})$ be the given (sparse) cost ...
• 32.7k

Modeling: How to force customers visit their NEAREST facility

If you would like to assign the customers to the nearest facility, one way would be by adding a set-covering constraint to ensure the customers with the minimum distance from a facility are assigned ...
• 8,960
1 vote

Terminology for "One-time" vs. "Continuous Tasks"

For the "continuous" settings you describe, perhaps you are looking for the term, online algorithms, used for algorithms that do not assume finiteness of the timeline nor the set of tasks to ...
1 vote

iterative geographic assignment problem

The urbanization part is easy. Fix $x_{vc}=0$ for all $(v,c)$ combinations that do not satisfy the urbanization constraint (either by adding an equation or simply by not including those variables in ...
• 39.6k
1 vote

Google-OR Tools: Assignment minimizing overlapping members

The original data mises the team 9,16 (these two do not belong to any team) The code in OR-TOOLS Data ...
• 1,378
1 vote
Accepted

Formulating assignment problem with people attributes that need to be balanced per assignment attribute in or-tools, CP-sat

You'd need two optimization variables Binary $x_{s,r} = 1$ if student $s$ from set A is matched with row $r$ from set B Binary $y_{s,c} = 1$ of student is matched to a class $c$ Derived sets/matrix ...
• 3,485
1 vote

Modeling: How to force customers visit their NEAREST facility

Another way is for all customers $n$ sort the distance in ascending order into a set $S_n =\{d_{ni}: d_{n,i} \le d_{n,i+1}\}$ basically indexed by the facility. Then for each customer loop the below ...
• 3,485

Only top scored, non community-wiki answers of a minimum length are eligible