HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM

DOI10.15807/jorsj.33.354zbMath0727.90023OpenAlexW2129450453MaRDI QIDQ3351111

Hiroshi Kasugai, Mikio Kubo

Publication date: 1990

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.33.354

zbMATH Keywords

heuristicsvehicle routingapproximate solutiondial-a-ride routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Constrained TSP and low-power computing ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

This page was built for publication: HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM