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

DOI10.15807/JORSJ.33.354zbMATH Open0727.90023OpenAlexW2129450453MaRDI QIDQ3351111FDOQ3351111

Authors: Mikio Kubo, Hiroshi Kasugai 

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

Recommendations

• An effective and fast heuristic for the dial-a-ride problem
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Local search heuristics for the probabilistic dial-a-ride problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A matheuristic for the dial-a-ride problem

zbMATH Keywords

heuristicsapproximate solutionvehicle routingdial-a-ride routing

Mathematics Subject Classification ID

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

Cited In (13)

• Routing by ranking: a link analysis method for the constrained dial-a-ride problem
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
• An effective and fast heuristic for the dial-a-ride problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• Pricing and allocation algorithm designs in dynamic ridesharing system
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Constrained TSP and low-power computing
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Local search heuristics for the probabilistic dial-a-ride problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3351111)