A New Mathematical Model for a Bi-objective Location Routing Problem Solved by A Multi-Objective Genetic Algorithm

Location of warehouses and routing of vehicles are two essential key points in order to distribute perishable products properly. Poor location-routing tasks may cause tremendous losses. In this paper, a bi-objective mixed integer mathematical programming is proposed to reduce the total cost of thesupply chain and to balance the workload of distribution centers, concurrently. A multi-objective evolutionary algorithm called Non-Dominated Genetic Algorithm-II (NSGA-II) is customized to generate set of non-dominated solutions on Pareto front of the problem. The performance of proposedalgorithm and an efficient exact multi-objective method, called ε-constraint, is compared on several benchmark instances using several performance measurements. The analysis reveals the efficacy and applicability of proposed method.

Keywords:

Location-Routing problem , Distribution of perishableproducts , NSGA-II ETM , ε -Constraint method