Publication | Open Access
HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
20
Citations
16
References
1990
Year
Mathematical ProgrammingNew HeuristicsEngineeringNetwork RoutingOn-demand TransportOperations ResearchVehicle RoutingHeuristic AlgorithmsLogisticsSystems EngineeringDiscrete MathematicsCombinatorial OptimizationTransportation EngineeringTliese Approximate AlgoritlunsComputer ScienceDiaua-ride Routing ProblemRoute ChoiceNetwork Routing AlgorithmRoute PlanningBusinessVehicle Routing Problem
A numbet of papets have been proposed for the approximate solution of the diaUa-ride routing problem, Tl]e object of this paper is to examine some of these heuristics, to introduce some new heuristics, and to compare tliese approximate algoritluns.
| Year | Citations | |
|---|---|---|
Page 1
Page 1