Table 1.

Comparison of the proposed study with closely related studies

Paper	Model			Product		Product classification	Period		Capacities		Picked up and delivery	Network structure			Uncertainty	Methods
	SO	BO	MO	S	M		S	M	Facility	Transportation		F	R	CL
Susarla and Karimi (2012)	●				●			●	●			●				LP-metric method
Mousazadeh et al. (2015)		●			●			●	●			●			●	CPLEX
Weraikat et al. (2016a)	●				●			●	●				●			Lagrangian relaxation
Weraikat et al. (2016b)	●				●			●	●				●			Lagrangian relaxation
Zahiri et al. (2017)			●		●			●	●			●			●	Evolutionary algorithm
Moslemi et al. (2017)			●		●			●	●	●				●		NSGAII
Ahlaqqach et al. (2018)			●		●			●	●					●		IBM ILOG CPLEX
Imran et al. (2018)			●		●			●	●			●			●	branch and bound
Nematollahi et al. (2018)		●					●					●				Heuristic
Sabouhi et al. (2018)	●			●				●	●			●			●	Possibilistic chance-constrained programming
Zandieh et al. (2018)			●		●			●	●			●				NSGA-II
Narayana et al. (2019)	●				●			●	●				●			Runge–Kutta fourth order
Roshan et al. (2019)			●		●			●	●			●			●	AUGMECON-2
Chen et al. (2019)	●			●			●					●				Evaluation algorithm
Nasrollahi and Razmi (2019)		●			●			●	●			●			●	NSGA-II
Taleizadeh et al. (2019)	●			●			●						●		●	GAMS
Franco and Alfonso-Lizarazo (2019)		●			●			●				●			●	Sample path
Timajchi et al. (2019)		●		●				●	●	●		●				Hybrid genetic algorithm
Alizadeh et al. (2020)		●			●		●		●	●				●		Bounded De Novo programming
Liu et al. (2020)	●				●	●	●						●			Smoothing method
Current study			●		●	●		●	●	●	●			●	●	Hybrid method

SO single-objective, BO bi-objective, MO multi-objective, S single, M multi, F forward, R reverse, CL closed-loop