Skip to content
Advertisement

Tag: or-tools

CP sat and solution search dead end

Just wondering what CP SAT does when it selects a branch which does not lead to global optimum? For instance, a code minimizing an objective returns: I understand it ignores solutions with greater objective value in minimizing context. Below is the setup. Since the code finished in 40 seconds, can one assume it enumerated all solutions? I was unable to

How to create a vehicle route optimization problem using or-tools and google-distance matrix while nullifying the end location only?

I am trying to create a vehicle routing problem for multi-drivers with pickup and drop-off locations. The starting point for each driver is their current location and the ending point would be anywhere they end. The input to my algorithm is a series of lot/long locations. The final output would be the best(shortest) route decided for the driver starting from

Pickup and delivery VSP with aggregation points

I’m trying to solve a simple pickup and delivery VRP for one vehicle only using or-tools. I was following the docs https://developers.google.com/optimization/routing/pickup_delivery, and it seems that everything works as expected when all the pickup and drop-off points are different from each other. The pickups_deliveries array looks like this: However, let’s assume there are aggregation points where there’s more than one

VRP with different vehicle types using or-tools

I’m trying to optimize the best routes VRP with OR-Tools. I couldn’t find the right function in the documentation.  CASE: Some customers only accept pickup trucks, some accept only trucks, some accept both trucks, pickup, and vans. There’s a single depot location and vehicles should carry orders to the right customers with accepted vehicles. Those vehicles I have Customers accept those vehicle

ORTools add constraint on visited nodes

I want to know if it is possible to set a traveling constraint for different routes, using ORTools VRPTWs problem. For example, if I have a list of nodes A, B, C, D, E Where C cannot be routed with D and E. Therefore possible routes would be (just a few examples): B -> A -> C A -> B

Advertisement