Optimizing a Bi-objective Vehicle Routing Problem Appearing in Industrial Enterprises.

A Muti-Start Multiobjective Local Search algorithm is implemented to solve a bi-objective variant of the Vehicle Routing Problem appearing in industry and environmental enterprises. The problem seeks to design a set of routes for each time on a period and in which the service frequency is a decision variable. The algorithm minimizes total emissions by all vehicles and maximizes service quality measure as the number of times that a customer is visited in order to be served.