[Koha-bugs] [Bug 35826] New: Optimize building of holds queue based on transport cost matrix

[bugzilla-daemon at bugs.koha-community.org]

https://bugs.koha-community.org/bugzilla3/show_bug.cgi?id=35826

            Bug ID: 35826
           Summary: Optimize building of holds queue based on transport
                    cost matrix
 Change sponsored?: ---
           Product: Koha
           Version: master
          Hardware: All
                OS: All
            Status: NEW
          Severity: enhancement
          Priority: P5 - low
         Component: Hold requests
          Assignee: koha-bugs at lists.koha-community.org
          Reporter: andreas.jonsson at kreablo.se
        QA Contact: testopia at bugs.koha-community.org
                CC: gmcharlt at gmail.com

There are several problems when building the holds queue which makes it hard
for the libraries to predict the outcome for how items are allocated based on
their configured policy.

1. The allocation of items should be done by optimizing on transport cost. 
Currently a greedy algorithm is applied when building the holds queue which
doesn't always produce optimal results.

2. The allocation of items should not fall back to some default allocation if
an allocation by using the transport cost matrix fails.  If no allocation can
be found that satisfies the configured constraints it is a violation of the
configured policies o proceed and make an allocation.

3. Although items at the local library have transport cost 0, assigning local
items should not be given absolute precedence.  It is simply false that
assigning local items "is obviously the least costly" as the comment says.

  (That we hard code the cost to 0 for local items is also an arbitrary
restriction in Koha, there is no technical reason as to why we shouldn't allow
the libraries to set a cost for allocating local items.)

I am currently working on a solution based on the Hungarian Algorithm.

-- 
You are receiving this mail because:
You are watching all bug changes.
You are the assignee for the bug.