For computationally hard discrete optimization problems, we rely on increasing computing power to reduce the solution time. In recent years the computational capacity of the Graphics Processing Unit (GPU) in ordinary desktop computers has increased significantly compared to the Central Processing Un...

For computationally hard discrete optimization problems, we rely on increasing computing power to reduce the solution time. In recent years the computational capacity of the Graphics Processing Unit (GPU) in ordinary desktop computers has increased significantly compared to the Central Processing Un...

For computationally hard discrete optimization problems, we rely on increasing computing power to reduce the solution time. In recent years the computational capacity of the Graphics Processing Unit (GPU) in ordinary desktop computers has increased significantly compared to the Central Processing Un...

This paper describes an applied simulation study on the flow of rail replacement buses in Oslo. We performed the studies using SIMADES, a newly developed multi-agent discrete event simulator. In the project, we enriched the simulator with agents representing entities commonly found in the urban mobi...

In recent years the computational capacity of the Graphics Processing Unit (GPU) in ordinary desktop computers has increased significantly compared to the Central Processing Unit (CPU). It is interesting to explore how this alternative source of computing power can be utilized. Most investigations o...

Lately there has been increasing research on the Mixed Capacitated General Routing Problem (MCGRP) – a generalization of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. Although it is an important aspect of real-life VRPs, route balancing has drawn surprisingly littl...

Lately there has been an increase of research on the Mixed Capacitated General Routing Problem (MCGRP) – a generalization of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. Although it is an important aspect of real-life VRPs, route balancing has drawn surprisingly l...

We investigate the efficiency of Adaptive Large Neighborhood Search on the Graphics Processing Unit (GPU). We do this by implementing the algorithm for the Distance-constrained Capacitated Vehicle Routing Problem (DCVRP), which we benchmark towards a state of the art CPU implementation. The computat...

We investigate the efficiency of Adaptive Large Neighborhood Search (ALNS) on the Graphics Processing Unit (GPU). We do this by implementing an ALNS algorithm for the Distance-constrained Capacitated Vehicle Routing Problem (DCVRP), which we benchmark towards a state of the art sequential implementa...