Multivisit Drone-Vehicle Routing Problem with Simultaneous Pickup and Delivery considering No-Fly Zones

Table 1

Summary of related studies.

Reference	T	D	SV/MV	SPD	NF	Objective	Method
Murray and Chu [6]	1	1	SV	No	No	Min time	MILP, heuristic
Ha et al. [7]	1	1	SV	No	No	Min cost	MILP, GRASP
Agatz et al. [8]	1	1	SV	No	No	Min time	MILP, approximation algorithm
Yurek and Ozmutlu [22]	1	1	SV	No	No	Min time	MILP, heuristic
Kitjacharoenchai et al. [9]	m	m	SV	No	No	Min time	MIP, heuristic
Raj and Murray [31]	1	m	SV	No	No	Min time	MILP, heuristic
Gonzalez et al. [10]	1	1	MV	No	No	Min time	MIP, heuristic
Luo et al. [38]	1	m	MV	No	No	Min time	MILP, heuristic
Wang et al. [11]	m	m	SV	No	No	Min time	Worst-case analysis
Masmoudi et al. [12]	m	1	MV	No	No	Min cost	MILP, ALNS
Wikarek et al. [5]	m	m	MV	No	No	Min distance	MILP, iterative algorithm
Ham [4]	m	m	MV	No	No	Min time	Constraint programming approach
Lu et al. [50]	m	m	MV	No	No	Multiobjective	MILP, heuristic
Jeong et al. [51]	1	1	SV	No	Yes	Min time	MIP, heuristic
Zhang and Li [14]	1	m	MV	Yes	No	Min distance	MIP, heuristic
Meng et al. [15]	m	m	MV	Yes	No	Min cost	MILP, two-stage heuristic algorithm
This paper	m	m	MV	Yes	Yes	Min cost	MILP, two-stage heuristic algorithm