Cobweb heuristic for multi-objective vehicle routing problem
2015 ◽
Vol 4
(3)
◽
pp. 430
Keyword(s):
<p>Solving a classical vehicle routing problem (VRP) by exact methods presents many difficulties for large dimension problem. Consequently, in multi-objective framework, heuristic or metaheuristic methods are required. Due to particular VRP structure, it seems that a dedicated heuristicis more suitable than a metaheuristic. The aim of this article is to collapse different heuristics solving classical VRP and adapt them for to solve the multi-objective vehicle routing problem (MOVRP). The so-called Cobweb Algorithm simulates spider’s behavior when weaving cobweb. This paper presents the algorithm, a didactic example, concluding remarks and way for further researches.</p>
2015 ◽
Vol 231
(7)
◽
pp. 1248-1263
◽
Keyword(s):
2015 ◽
Vol 24
◽
pp. 50-64
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):