Proposing new models for finding the most efficient DMUs in DEA

A Multi-objective Cash-in-transit Pollution-location-routing Problem Based on Urban Traffic Conditions

“…Constraint (31) states that each customer must be linked to one cash transfer vehicle. Constraint (32) states that each parabola just uses dimension j of speed. Constraint (33) states that if node j is met after node i, the time of meeting node j is equal to the total time of movement from node to node j and the time spent between i and j. Constraint (34) displays that the time spent from node i to node j, is bigger than the 36) display that the time of movement is proportionate to the time frame spent in traffic.…”

“…Studying the function of multiobjective algorithms is much more complicated than that of single-objective algorithms in a way that one assessment indicator alone will not suffice to study all the acquired responses for the presented algorithms. Hence, in this paper, to assess the quality of the solutions for the suggested algorithms, Pareto solutions attained from the suggested algorithm are compared with NSGA-II [26] and multi-objective imperialist competitive algorithm (MOICA) [30] algorithms having six indices of quality metric, mean ideal distance [31], spacing metric, diversification metric, data envelopment metric [32], and PROMETHEE metric [29].…”