Digitala Vetenskapliga Arkivet

Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
The use of abstractions to solve large scheduling problems
RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
2000 (Engelska)Rapport (Övrigt vetenskapligt)
Abstract [en]

This thesis investigates how abstractions can be used to improve performance in a railroad scheduling system that uses constraint programming. The idea behind abstractions is to solve a large problem in smaller parts and extract information from these parts. That information can then be used when solving the entire problem. Two different types of abstractions are introduced: Relations and Net abstractions. The use of relations builds orders between trips or parts of trips. These orders can be used to reduce the search necessary to find a solution to the scheduling problem. When using net abstraction, the problem is solved in an abstract search space, where it is easier to solve. The solution computed in the abstract search space is then used to reduce search when solving the problem in the original space. It is shown that these two types of abstraction can improve performance in problems with various settings. Relations can successfully be used in problems that have few solutions and are hard to solve. Net abstraction on the other hand works best for problems with many valid solutions.

Ort, förlag, år, upplaga, sidor
Kista, Sweden: Swedish Institute of Computer Science , 2000, 1. , s. 64
Serie
SICS Technical Report, ISSN 1100-3154 ; T2000:13
Nyckelord [en]
Train planning, Hierarchical planning, Vehicle routing and scheduling, Constraint programming, Formal abstraction
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
URN: urn:nbn:se:ri:diva-22013OAI: oai:DiVA.org:ri-22013DiVA, id: diva2:1041555
Tillgänglig från: 2016-10-31 Skapad: 2016-10-31 Senast uppdaterad: 2021-12-16Bibliografiskt granskad

Open Access i DiVA

fulltext(319 kB)145 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 319 kBChecksumma SHA-512
9b1a22909ebd8da50583da341f1f61cbe181bcfee1ee58d7126ee5d340624f1071a1d897ee8c3fded6b5b1450f3ae0b1a94564101444570fce9dfde5e757fef3
Typ fulltextMimetyp application/pdf

Av organisationen
SICS
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 145 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 33 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf