An efficient guided local search approach for service network design problem with asset balancing

Service network design is a core problem for logistic transportation planning. It involves determination of the most cost-effective transportation network, package flow distribution as well as balanced vehicle schedules. In this paper, we propose an efficient guided local search approach metaheuristic for this problem, which is able to produce competitive results with much less computational time than those proposed in the literature.