Sökning: "weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search"

Hittade 1 uppsats innehållade orden weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search.

  1. 1. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem

    Kandidat-uppsats, Linköpings universitet/Artificiell intelligens och integrerade datorsystem

    Författare :Anton Hölscher; [2018]
    Nyckelord :weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search;

    Sammanfattning : This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to solve the Weighted k-Chinese Postman Problem for undirected graphs, of varying size, representing neighbourhoods in Sweden.A tabu search heuristic was implemented with each iteration consisting of giving a cycle from the most expensive tour to the cheapest. LÄS MER