• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Exact methods for solving the small scale single vehicle pickup and delivery problem with time windows

Lakel, Yacine Mohamed
Master thesis
Thumbnail
View/Open
148682815.pdf (1.023Mb)
URI
https://hdl.handle.net/1956/15817
Date
2016-08-15
Metadata
Show full item record
Collections
  • Department of Informatics [742]
Abstract
The single vehicle pickup and delivery problem with time windows (1-PDPTW) is a wellknown problem in transportation and combinatorics. In practice, these routes are relatively small with less then 30 stops. In this thesis, we consider two exact methods to solve this problem for small instance sizes. The first is solving the corresponding MIP-model using commercial linear programming software and the second is a forward dynamic programming algorithm. The motivation for this thesis is to determine the usability of exact methods as a heuristic to solve the multi vehicle pickup and delivery problem.
Publisher
The University of Bergen
Copyright
Copyright the Author. All rights reserved

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit