Bug 34673 - TransportCostMatrix should be checked iteratively
Summary: TransportCostMatrix should be checked iteratively
Status: RESOLVED DUPLICATE of bug 33796
Alias: None
Product: Koha
Classification: Unclassified
Component: Hold requests (show other bugs)
Version: Main
Hardware: All All
: P5 - low enhancement (vote)
Assignee: Bugs List
QA Contact: Testopia
URL:
Keywords:
Depends on:
Blocks:
 
Reported: 2023-08-31 15:02 UTC by Nick Clemens (kidclamp)
Modified: 2023-09-29 15:23 UTC (History)
5 users (show)

See Also:
Change sponsored?: ---
Patch complexity: ---
Documentation contact:
Documentation submission:
Text to go in the release notes:
Version(s) released in:


Attachments

Note You need to log in before you can comment on or make changes to this bug.
Description Nick Clemens (kidclamp) 2023-08-31 15:02:18 UTC
Currently the TransportCostMatrix is used during the holds queue process to find the least cost branch when filling a hold.

For each request we find the cheapest branch option (or one of them if they are equal) then check the pool of items from that branch to see if one of them can satisfy the hold.

If we can't fill from the least cost branch, then we move on to any other branch.

It would improve the situation for libraries if we went through all branches ordered by the cost transport matrix, and optionally randomized when costs are equal.
Comment 1 Kyle M Hall 2023-09-29 15:23:45 UTC

*** This bug has been marked as a duplicate of bug 33796 ***