Procedia Engineering · 2011 · 56 citations · 10 references
ManagementDecision SciencesOperations ManagementOptimizationTransportTransportationCombinatorial OptimizationRoute PlanningRoutingRouting AlgorithmsTransportation ProblemsVehicle SchedulingCustomer Waiting TimeDelivery ProblemDelivery Vehicle SchedulingPickup SchedulingRouting ProblemsTabu SearchVehicle RoutingVehicle Routing Problems
The vehicle routing problem with simultaneous pickup and delivery considering customer satisfaction is based on a time window at each customer location. In such a problem, the transportation requests have to be performed by vehicles, each request having to be met as early as possible. The costumer satisfaction is inversely proportional to the waiting time for the vehicle from the lower bound of the time window. The goal is to minimize the total length of vehicles’ paths to reduce cost, and to maximize the sum of all customer satisfactions to improve service quality. Initial solution obtained by the cheapest insertion method can be improved by tabu search algorithm. Finally computational results are reported on test instances.
10