Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tidsberoende restider för Vehicle Routing Problem: MED OPTAPLANNER
KTH, School of Information and Communication Technology (ICT).
KTH, School of Information and Communication Technology (ICT).
2015 (Swedish)Independent thesis Basic level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [sv]

Trafikstockning är ett vanligt förekommande problem i storstäder och för med sig förseningar och extra kostnader för transportföretag. Vehicle Routing Problem är ett kombinatoriskt optimeringsproblem som ämnar hitta lägsta kostnaden att besöka en mängd kunder med flera fordon. Här beskrivs ett sätt att använda och förbättra ruttplanering i Stockholm med Vehicle Routing Problem och OptaPlanner genom att införa tidsberoende restider. Modeller till Vehicle Routing Problem har skapats där kostnaden mellan kunderna kvantifierades genom att mäta distans fågelvägen, fasta restider inom trafiknätet och tidsberoende restider i trafiknätet.

Jämförelser visade en tydlig förbättring hos modellerna som utgick från trafiknätet, jämfört med sträckan fågelvägen. Modellen med tidsberoende restider visade en marginell förbättring gentemot den fasta restider. Denna relativt lilla förbättring kan förklaras genom de heuristiker som har använts.

Abstract [en]

Traffic congestion is a common problem in urban areas, which results in delays and increased costs for transport companies. Vehicle routing problem is a combinatorial optimization problem intending to find the lowest cost to visit multiple clients with a fleet of vehicles. This report describes how route planning in Stockholm can be improved by optimizing the Vehicle Routing Problem using OptaPlanner by introducing time-dependent travel times. Models for the Vehicle Routing Problem have been created where the cost is quantified by calculating the distance by a straight line, fixed travel times in the traffic network and time-dependent travel times in the traffic network.

Results showed a clear improvement of the models that used costs based on the traffic network, as compared to the model where the distance is measured by a straight line. The model with time-dependent travel times showed a marginal improvement over the fixed travel times. The rather small improvement may be due to the heuristics that have been used.

Place, publisher, year, edition, pages
2015. , 26 p.
Series
TRITA-ICT-EX, 2015:120
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-177524OAI: oai:DiVA.org:kth-177524DiVA: diva2:873147
Examiners
Available from: 2015-11-25 Created: 2015-11-23 Last updated: 2017-06-15Bibliographically approved

Open Access in DiVA

fulltext(3102 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 3102 kBChecksum SHA-512
b25dd9541b3dd787a2b79db3dc55d2f73bfcc2c78890048a592bf59288be19267d4d9e89d147e5d126737bd43b4f87556b72ea6c35525f5b09e918a2d13f6e91
Type fulltextMimetype application/pdf

By organisation
School of Information and Communication Technology (ICT)
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 170 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf