Uploaded image for project: 'OptaPlanner'
  1. OptaPlanner
  2. PLANNER-485

Memory friendly nearby selection by caching only the n nearest entities (optionally adhering to some filter)

    XMLWordPrintable

Details

    • NEW
    • NEW

    Description

      Up to a few days ago I was convinced that nearby selection needs to cache all distance combinations.
      But as that would make solving 100k VRP impossible on my machine (100k * 100k uses 38GB RAM), I've been looking at alternatives:

      • Simply limited nearby till the n nearest isn't possible for CH's (as those 100 nearest might not be initialized).
      • However, for CH's we can limit nearby to the n nearest initialized entities.
        This splits up the nearby implementation, based on being used in LS or CH.
        I 'll also allow a "shared" way, for small cases, where the entire nearby distance matrix can be cached.

      Attachments

        Issue Links

          Activity

            People

              gdesmet@redhat.com Geoffrey De Smet
              gdesmet@redhat.com Geoffrey De Smet
              Votes:
              0 Vote for this issue
              Watchers:
              4 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved: