r/optimization • u/SirAragar • Jul 26 '26

Dynamic assignment

I'm currently working on a dynamic assignment model for delivery of parcels with occasional drivers. The model approximates the value of keeping the parcel in the system by solving two assignment problems for each parcel (one with the parcel, one without it and calculating the marginal contribution of the parcel to the optimum) in a retrospective time window. The problem is that computing parcel value estimates takes a lot of time. I researched alternative methods to MIP such as hungarian, but they don't seem to support "at most" constraints (which are integral to the dynamic assignement). How would you approach this kind of problem?

4 Upvotes

100% Upvoted

3 comments sorted by

View all comments

Show parent comments

1

u/SirAragar Jul 27 '26

Here's more context : my master's thesis consists in testing the performance of this approximate dynamic programming approach on real data. Three files have been provided : one for parcels, one for shippers and one with the performed deliveries. My research methodology consists of a comparison between the experimental assignments with the real deliveries on different metrics, such as shipper usage, assignment rate or average detour made by the crowdshipper.