To main content

Lukas Bach

Research Scientist

Lukas Bach

Research Scientist

Lukas Bach
Phone: +47 479 63 696
Mobile: +47 479 63 696
Department: Mathematics and Cybernetics
Office: Oslo

publications and responsibilities

Publications

Publication

A Memetic Algorithm for the Mixed Capacitated General Routing Problem with Route Balancing

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1357685

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...

Year 2016
Type Presentation
Publication

A Memetic Algorithm for the Mixed Capacitated General Routing Problem with Route Balancing

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1360707

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...

Year 2016
Type Presentation
Publication

A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1392579

In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch-and-Cut-and-Price algorithm fo...

Authors Bach Lukas Lysgaard Jens Wøhlk Sanne
Year 2016
Type Journal article
Publication

Adaptive Large Neighborhood Search on the Graphics Processing Unit

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1395194

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...

Year 2016
Type Presentation
Publication

Adaptive Large Neighborhood Search on the Graphics Processing Unit

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1395197

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...

Year 2016
Type Presentation
Publication

Integrating Timetabling and Crew Scheduling at a Freight Railway Operator

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1261879

We investigate to what degree we can integrate a Train Timetabling / Engine Scheduling Problem with a Crew Scheduling Problem. In the Timetabling / Engine Scheduling Problem we determine for each demand a specific time within its time window when the demand should be serviced. Furthermore, we genera...

Authors Bach Lukas Dollevoet Twan Huisman Dennis
Year 2016
Type Journal article
Publication

GPU parallelization of ALNS for the DCVRP

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1360725

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...

Year 2016
Type Presentation
Publication

Integrating Timetabling and Crew Scheduling at a Freight Railway Operator

https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1261880

We investigate to what degree we can integrate a Train Timetabling / Engine Scheduling Problem with a Crew Scheduling Problem. In the Timetabling / Engine Scheduling Problem we determine for each demand a specific time within its time window when the demand should be serviced. Furthermore, we genera...

Authors Bach Lukas Dollevoet Twan Huisman Dennis
Year 2015
Type Presentation
View all publications