We have collected information about The Split Delivery Vehicle Routing Problem A Survey for you. Follow the links to find out details on The Split Delivery Vehicle Routing Problem A Survey.
https://link.springer.com/chapter/10.1007%2F978-0-387-77778-8_5
Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed.Author: Claudia Archetti, Maria Grazia Speranza
https://link.springer.com/chapter/10.1007/978-3-540-69995-8_20
In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this paper we present a survey of the state-of-the-art on this important problem.Author: Claudia Archetti, Maria Grazia Speranza
https://pubsonline.informs.org/doi/abs/10.1287/trsc.1040.0103
We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity.Author: C. Archetti, M. G. Speranza, A. Hertz
https://www.sciencedirect.com/science/article/pii/0166218X9200172I
Qn~. This variant of the VRP is called the Split Delivery Vehicle Routing Problem (SDVRP). Dror and Trudeau [7, 8] have proposed a heuristic algorithm for the SDVRP and have shown that allowing split deliveries can yield substantial savings, both in the total distance travelled and in the number of vehicles used in the optimal solution.Author: Moshe Dror, Moshe Dror, Gilbert Laporte, Pierre Trudeau
https://www.researchgate.net/publication/220413157_A_Tabu_Search_Algorithm_for_the_Split_Delivery_Vehicle_Routing_Problem
Abstract We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a customer from a set of routes ...
https://en.wikipedia.org/wiki/Vehicle_routing_problem
Vehicle Routing Problem with Profits (VRPP): A maximization problem where it is not mandatory to visit all nodes. The aim is to visit once nodes maximizing the sum of collected profits while respecting a vehicle time limit. Vehicles are required to start and end at the depot. Vehicle Routing Problem with Pickup and Delivery (VRPPD): A number of ...
Searching for The Split Delivery Vehicle Routing Problem A Survey?
You can just click the links above. The data is collected for you.
