-
Notifications
You must be signed in to change notification settings - Fork 347
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Use cost bound in heuristic #1222
base: master
Are you sure you want to change the base?
Conversation
My attempts at ordering unassigned jobs to favor cutting branches were void: we'd need to maintain an extra data structure + pay the re-ordering price from time to time, which in my tests destroys the benefit of using the bound with unsorted data. |
Benchmarking setup for job-based instancesInstancesIn order to measure the impact of this PR, I've generated random instances with sizes ranging from 200 to 5000 jobs. Since route length is a major factor in complexity, I've generated several instances per number of jobs to match typical sizes: S (10 jobs per route), M (50 jobs per route), L (100 jobs per route), XL (250 jobs per route) and XXL (500 jobs per route). ProcessFor all those instances I'm solving only with the heuristics (no local search) with both current ResultsSolving speedup between
If we look at total computing time, the speedup is 2.17, meaning PR is more than 2x faster than |
Benchmarking setup for shipment-based instancesUsing the usual Li&Lim benchmark (all classes with instance sizes from 100 to 1000), again solving only with the heuristics (no local search) with both current Average computing times (ms) and speedup
|
Issue
Fixes #1219
Tasks
Try ordering unassigned jobs to increase bound efficiencyCHANGELOG.md