Publication | Closed Access

A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

Mathematical ProgrammingEngineeringDiscrete OptimizationOperations ResearchLogisticsSystems EngineeringCombinatorial OptimizationMechanism DesignTransportation EngineeringMultiple ObjectivesCombinatorial ProblemComputer ScienceMultiple CapacitiesInteger ProgrammingHeuristic AlgorithmScheduling ProblemBusinessVehicle Routing ProblemHeuristic Search