1. Forum
  2. Usenet
  3. COMP.LANG.PROLOG

  • Re: TSP with Prolog

    From JAY PRAKASH@21:1/5 to Steve Gregory on Tue Nov 30 01:13:06 2021
    On Thursday, December 1, 1994 at 9:26:11 PM UTC+5:30, Steve Gregory wrote:
    Matthew Huntbach ([email protected]) wrote:
    : Thomas Lindgren ([email protected]) wrote:
    : : In article <[email protected]> [email protected] (Pierre Raufast) writes:
    : : Does anyone know how to program the Travelling Salesman Problem with
    : : Prolog?
    : : ... You may want to use branch-and-bound in that case:
    : : pass around a global minimum and cut off search when the current path
    : : is longer than the minimum; update the minimum when a better solution
    : : is found.
    : For comparison, I discuss the approach in an and-parallel language in my
    : paper "Parallel Branch and Bound Search in Parlog" in International
    : Journal of Parallel Programming 20, 4 pp.299-314, 1991. I also have a version
    : which will appear in a paper next year which has local minima to avoid the : bottleneck effect of many processes accessing a single global minimum.
    : Matthew Huntbach
    A similar approach to Matthew's was implemented and applied to the
    Travelling Salesman Problem; see my paper "Experiments with speculative parallelism in Parlog" in ILPS93. A TR version of this paper, and a KL1 version of the actual code, can be found at http://star.cs.bris.ac.uk/Interests/spec.html.
    steve gregory
    it cant be accessed what should we do now!!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mostowski Collapse@21:1/5 to AY PRAKASH on Tue Nov 30 01:30:16 2021
    Step 1: Use Google, enter "Experiments with speculative parallelism in Parlog"

    Step 2: Click on Paper: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.4719

    AY PRAKASH schrieb am Dienstag, 30. November 2021 um 10:13:07 UTC+1:
    On Thursday, December 1, 1994 at 9:26:11 PM UTC+5:30, Steve Gregory wrote:
    Matthew Huntbach ([email protected]) wrote:
    : Thomas Lindgren ([email protected]) wrote:
    : : In article <[email protected]> [email protected] (Pierre Raufast) writes:
    : : Does anyone know how to program the Travelling Salesman Problem with
    : : Prolog?
    : : ... You may want to use branch-and-bound in that case:
    : : pass around a global minimum and cut off search when the current path
    : : is longer than the minimum; update the minimum when a better solution
    : : is found.
    : For comparison, I discuss the approach in an and-parallel language in my : paper "Parallel Branch and Bound Search in Parlog" in International
    : Journal of Parallel Programming 20, 4 pp.299-314, 1991. I also have a version
    : which will appear in a paper next year which has local minima to avoid the
    : bottleneck effect of many processes accessing a single global minimum.
    : Matthew Huntbach
    A similar approach to Matthew's was implemented and applied to the Travelling Salesman Problem; see my paper "Experiments with speculative parallelism in Parlog" in ILPS93. A TR version of this paper, and a KL1 version of the actual code, can be found at http://star.cs.bris.ac.uk/Interests/spec.html.
    steve gregory
    it cant be accessed what should we do now!!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)