MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problem

作者：

Highlights：

• The work deals with a real muti-objective optimization problem in logistics.

• Two methods are proposed and analyzed.

• The first one is based on MOAMP, a Tabu Search strategy for multi-objective optimization problems.

• The second one is based on NSGA-II, a very well-known multi-objective genetic algorithm.

• The results of computational experiences show the best performance of MOAMP-based method.

摘要

•The work deals with a real muti-objective optimization problem in logistics.•Two methods are proposed and analyzed.•The first one is based on MOAMP, a Tabu Search strategy for multi-objective optimization problems.•The second one is based on NSGA-II, a very well-known multi-objective genetic algorithm.•The results of computational experiences show the best performance of MOAMP-based method.

论文关键词：Bi-objective problems,PVRP,Tabu search,MOAMP,NSGA II

论文评审过程：Received 10 May 2016, Revised 28 July 2016, Accepted 1 September 2016, Available online 3 September 2016, Version of Record 4 October 2016.

论文官网地址：https://doi.org/10.1016/j.knosys.2016.09.001