Skip to main content

Questions tagged [or-tools]

Questions related to or-tools, Google's open-source software suite for optimization

1 vote
1 answer
38 views

Most constraining constraint CP-SAT

I am using CP-SAT to minimize a problem similar to Flexible Job Shop Scheduling (https://github.com/google/or-tools/blob/stable/examples/python/flexible_job_shop_sat.py), with a minimization objective....
QuestioningPanda's user avatar
2 votes
1 answer
99 views

How to reset hints in a CP-SAT model?

Pretty much the title. I have a cp model for which I have already provided a hint when minimizing a given objective function. I now want to provide a new hint to minimize the model with respect to a ...
John D's user avatar
  • 221
0 votes
1 answer
40 views

Job Shop Scheduling with Multiple possible machines for a task in CP-SAT

I am trying to convert the job shop scheduling example of CP-SAT, which goes as; Below is a simple example of a job shop problem, in which each task is labeled by a pair of numbers (m, p) where m is ...
Jigeli's user avatar
  • 19
0 votes
2 answers
53 views

How to request shifts when nurses _don't_ work

So I am working on a variation of the nurse scheduler. This includes then the ability to have nurses request when they are going to be on... However, I need to be able to support requests for when ...
Michael Wiles's user avatar
1 vote
2 answers
52 views

Convert sequence to succession matrix with CP-SAT

Say I have a sequence [3,1,0,2], where each element is a decision variable, i.e. I decide upon an optimal sequence of numbers. Is there an appropriate way to convert this sequence to a 2D succession ...
QuestioningPanda's user avatar
3 votes
2 answers
834 views

How to avoid similar solutions?

I have a problem like this $x_1 +x_2 +x_3 =10$ let's assume $0 \leq x_i \leq 10$ It is obvious that this problem has more than one solution For example : Solution 1 : $x_1 =0 , x_2= 1 , x_3 =9$ ...
Optimization team's user avatar
2 votes
1 answer
86 views

Cumulative constraint with a window

I have a decision variable R, indexed by n over N, where R[n] is equal to some integer value. I want a constraint that, for a specific window size, e.g. 5, gives a maximum to the summed values inside ...
QuestioningPanda's user avatar
2 votes
1 answer
121 views

Optimizing a Route Selection Problem with Multiple Constraints and Objectives

I'm developing a solution to optimize a vehicle routing problem where each stop has an associated score (priority), specific geo coordinates, and a required stop duration. The goal is to maximize the ...
Rastislav's user avatar
  • 131
2 votes
1 answer
97 views

Assignment of colored boxes to groups

I am working on a problem that I think can be solved as an extension to the assignment problem, but am open to hear about other ways to solve. PROBLEM There are a lot of colored boxes. For each color ...
frellwan's user avatar
1 vote
1 answer
97 views

Information shared among workers in OR-tools CP-SAT

I stumbled upon this video while using OR-Tools CP-SAT solver https://www.youtube.com/watch?v=lmy1ddn4cyw At around 12:10, the part of multithreaded solvers starts. I understand these solvers are ...
QuestioningPanda's user avatar
2 votes
1 answer
260 views

CP-SAT: Workarounds for OnlyEnforceIf with Linear Expressions

Background I've written a solver that selects a subset of people from a larger pool such that the subset has at least X people per attribute (Gender/Job/Country etc. X differs per attribute). This ...
Riezz's user avatar
  • 41
1 vote
0 answers
86 views

Vehicle Routing Problem OR-tools - Distance between solutions / vehicles

I have an alternative problem which I reckon can be solved using OR-tools. For this problem, apart from the distance between nodes within a solution, I also need the distance between the n-th node of ...
Jigeli's user avatar
  • 19
2 votes
1 answer
115 views

Solving a weighted XOR-SAT problem

I want to solve a variant of the weighted XOR-SAT problem. Concretely, Given $n$ boolean variables $x_1,\ldots,x_n$ each of which is assigned a non-negative cost $c_1,\ldots,c_n\in\mathbb{R}_{\ge 0}$ ...
nalzok's user avatar
  • 123
1 vote
1 answer
86 views

Implementing soft time window constraints with time_matrix dependent on vehicle types

I am solving a CVRPTWPD using Google ORTools. Here, objective is to minimize the travelled distance and not time. I have start locations for each vehicle but arbitrary end locations are possible. I ...
mufassir's user avatar
  • 211
0 votes
1 answer
130 views

How to set the parameters for GLOP for a DUAL_FEASIBLE case

Now I have a linear programming model, I have tried to formulate this model with or-tools, and then solve it with the GLOP but failed. After reaching the 15-minute time limit, the status of GLOP is ...
Ying's user avatar
  • 105

15 30 50 per page
1
2 3 4 5
12