Nov 15, 2016 · A solution method that combines tabu search and MOAMP (Multiobjective Adaptive Memory Programming) strategies is proposed for this model.
A bi-objective model for the design of daily routes over a planning period is analyzed. This model is proposed in response to a real problem encountered by ...
A bi-objective model for the design of daily routes over a planning period is analyzed. This model is proposed in response to a real problem encountered by ...
A bi-objective model for the design of daily routes over a planning period is analyzed. This model is pro- posed in response to a real problem encountered ...
Bibliographic details on MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problem.
MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problem ; ISSN · 0950-7051 ; Año de publicación · 2016 ; Volumen · 112 ; Páginas · 92-104 ; Tipo ...
Sep 12, 2013 · A solution method for this problem was developed by applying tabu search within the framework of Multiobjective Adaptive Memory Programming ( ...
We study the problem under the bi-objective perspective, "minimizing" simultaneously the total traveled distance and the stock.
People also ask
How do you implement Tabu search?
What is Tabu search algorithm in AI?
This paper proposes a method based on tabu search and multiobjective adaptive memory programming (MOAMP) strategies. With this method it is possible to obtain ...
The MOAMP approach has been used successfully in some real problems of scheduling-routing ... search and NSGA-II for a real Bi-objective scheduling-routing ...