Sökning: "Travelling Salseman Problem with Time Windows"

Hittade 1 uppsats innehållade orden Travelling Salseman Problem with Time Windows.

  1. 1. Optimization Methods for Snow Removal of Bus Stops

    L3-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Corina Hüni; [2023]
    Nyckelord :Snow removal; Travelling Salseman Problem with Time Windows; Heuristic; Local search; Tabu search; Snöröjning; Handelsresandeproblemet med Tidsfönster; Heuristik; Lokalsökning; Tabusökning;

    Sammanfattning : Snow removal is an important optimization problem in countries with snowfall. Bus stops can only be cleared after the adjacent street is cleared. LÄS MER