uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Optimising the selection of transport services: A proof-of-concept application utilising time-expansion and Integer Programming
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Companies who wish to ship physical products from one place to another are faced with the choice of a transportation solution among several alternative suppliers each with multiple pricing, route and time options. An optimal solution would allow companies to save resources as well as more effectively serve its customer deliveries. In this project we have approached this problem as an instance of the well researched Minimum Cost Flow Problem and have created a proof-of-concept application utilising time expansion and a Integer Programming solver. The resulting application can for a batch of single commodity demands, including a maximal allowed transport time, successfully find an optimal cost solution. Where the solver is taking account of potential cost savings of consolidated transportation as well as cost and time of handling in transshipment points. 

Abstract [sv]

Vid transport av produkter från en plats till en annan står företag inför ett val mellan olika speditörer med olika priser, tider och rutter. En optimal lösning för detta val skulle möjliggöra för företag att spara pengar såväl som att effektivisera sina kundleveranser. Vi har angripit problemet som ett Minimum Cost Flow Problem och har skapat en prototypapplikation vilken använder sig av tidsexpansion och en lösare av heltalsproblem. Resultatet är en applikation som, för ett parti av likadana varor tillsammans med max-tiden för leveransen, kan hitta en optimal lösning. Lösningen tar hänsyn till möjliga kostnadsbesparingar vid konsolidering, såväl som kostnaden och tiden för hanteringen av densamma i omlastningspunkter.

Place, publisher, year, edition, pages
2016. , 34 p.
Series
Independent Project in Computer and Information Engineering, 2016-006
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:uu:diva-297303OAI: oai:DiVA.org:uu-297303DiVA: diva2:941501
External cooperation
Crowderia
Educational program
Master of Science Programme in Information Technology Engineering
Supervisors
Examiners
Available from: 2016-06-29 Created: 2016-06-22 Last updated: 2016-06-29Bibliographically approved

Open Access in DiVA

fulltext(634 kB)124 downloads
File information
File name FULLTEXT01.pdfFile size 634 kBChecksum SHA-512
d07924478f74148b17b2a5ca2f086141308f19d076cc54d7ce408fc484878ae6e1cf5239bb8b7dd24e7bea617f5fd629f6aec64a7ea3b294f24328dc014bb2a2
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 124 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: 318 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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