MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problem
详细信息 查看全文
- 作者：Amaya Martí ; nez-Purasa ; amayamar@ubu.es" class="auth_mail" title="E-mail the corresponding author ; Joaquí ; n Pachecob ; jpacheco@ubu.es" class="auth_mail" title="E-mail the corresponding author
- 关键词：Bi-objective problems ; PVRP ; Tabu search ; MOAMP ; NSGA II
- 刊名：Knowledge-Based Systems
- 出版年：2016
- 出版时间：15 November 2016
- 年：2016
- 卷：112
- 期：Complete
- 页码：92-104
- 全文大小：2804 K
文摘
- •
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.