• A Capacitated Clustering-based Method for Newspaper Delivery Routing 

      Hasle, Geir; Kloster, Oddvar; Smedsrud, Morten (Lecture, 2011)
      We present an efficient solver that produces clustered, balanced, and cost effective routes for distribution in a given geographical area. Through cloud computing, the optimization functionality is used by more than ...
    • A heuristic for rich maritime inventory routing problems 

      Kloster, Oddvar; Flatberg, Truls; Hasle, Geir (Lecture, 2011)
      In maritime inventory routing, a fleet of vessels is employed to transport products that are produced and consumed in different ports with limited storage capacity. The tight coupling between inventory management and ...
    • Experiments on the Node, Edge, and Arc Routing Problem 

      Hasle, Geir; Kloster, Oddvar; Smedsrud, Morten; Gaze, Kevin (Research report, 2012)
      The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004 along with the first benchmark called CBMix. The NEARP generalizes the classical Capacitated Vehicle Routing Problem (CVRP), the ...
    • Parallel Local search for the CVRP on the GPU 

      Schulz, Christian Ferdinand; Hasle, Geir; Kloster, Oddvar; Riise, Atle; Smedsrud, Morten (Lecture, 2010)
      For many applications of optimized transportation management, there is still a large gap between the requirements and the performance of today’s decision support systems. Vehicle routing is no exception. Although there has ...
    • Solving Node Edge Arc Routing Problems in the Distribution of Media Products 

      Flatberg, Truls; Kloster, Oddvar; Nilssen, Eivind Jodaa; Smedsrud, Morten; Hasle, Geir (Lecture, 2009)
      There is a strong pressure on economy in the distribution of media products. Two important remedies are more efficient carrier routes and distribution of side products. Both call for effective and dynamic route design and ...
    • The Node Edge Arc Routing Problem - applications and heuristics 

      Hasle, Geir; Flatberg, Truls; Kloster, Oddvar; Nilssen, Eivind Jodaa; Smedsrud, Morten (Lecture, 2009)
      In the VRP literature, the Arc Routing Problem is often advocated as an adequate model for routing applications such as newspaper delivery and garbage collection. We argue that a better model is the Node Edge Arc Routing ...
    • Using Heterogeneous Computing for Solving Vehicle Routing Problems 

      Hasle, Geir; Kloster, Oddvar; Smedsrud, Morten (Lecture, 2010)
      In the talk, we briefly explain modern PC architectures and the general principles of heterogeneous computing. We illustrate how multi-core and GPU computing may be utilized for higher performance and more robust VRP ...