Related Experiment Video
Updated: May 13, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Hybrid column generation and large neighborhood search for the dial-a-ride problem
Sophie N Parragh1, Verena Schmid
1Department of Business Administration, University of Vienna, Vienna, Austria.
Abstract:
Demographic change towards an ever aging population entails an increasing demand for specialized transportation systems to complement the traditional public means of transportation. Typically, users place transportation requests, specifying a pickup and a drop off location and a fleet of minibuses or taxis is used to serve these requests. The underlying optimization problem can be modeled as a dial-a-ride problem. In the dial-a-ride problem considered in this paper, total routing costs are minimized while respecting time window, maximum user ride time, maximum route duration, and vehicle capacity restrictions. We propose a hybrid column generation and large neighborhood search algorithm and compare different hybridization strategies on a set of benchmark instances from the literature.
Related Concept Videos
Distributed Loads: Problem Solving
Distance Problem
Rolling Resistance: Problem Solving
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Methods of Medium Optimization
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...