Publication | Closed Access

Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations

EngineeringDelivery ServicesTransportation Systems ModelingNetwork AnalysisOperations ResearchVehicle RoutingState–space–time Network RepresentationsSystems EngineeringLogisticsTransportation Systems AnalysisCombinatorial OptimizationTransportation EngineeringDynamic Programming ApproachInteger ProgrammingRoute ChoiceRoute PlanningBusinessVehicle Routing ProblemTransportation Systems