Multiobjective Dynamic Vehicle Routing Problem and Time Seed Based Solution Using Particle Swarm Optimization

Table 1

The most common variants of VRP.

Serial number	Problem	Problem description	Features	Ref.
1	VRP-PD	VRP with pickup and delivery	It is transportation problem for a given set of goods from some pickup locations to the delivery locations. No central depot for the delivery vehicles is required.	[37]
2	C-VRP	Capacitated VRP	It is a simple VRP with vehicles having prespecified and same goods carrying capacity.	[38]
3	H-VRP	Heterogeneous VRP	It is slightly different from C-VRP. Here, the vehicles have prespecified but different goods carrying capacity.	[39]
4	VRP-LIFO	VRP with last-in-first out	In this VRP, the items that have been picked up most recently must be the items that need to be delivered in the next locations.	[40]
5	VRP-TW	VRP with time window	It is a VRP with delivery time interval for each customer. The delivery vehicles can visit the customers in the given time interval.	[41]
6	O-VRP	Open VRP	In this VRP, the delivery vehicles are not required to report back to the central depot after visiting all the assigned customers.	[42]
7	DAF-VRP	Dial-A-flight VRP	It is a VRP in public transport through airline.	[43]
8	DAR-VRP	Dial-A-ride VRP	It is an on-road general public transport problem.	[44]
9	VRP-MT	VRP with multiple trips	In this VRP, the delivery vehicles take more than one tour once it finishes the assigned tour.	[45]