Munich Personal RePEc Archive

Cobweb Heuristic for solving Multi-Objective Vehicle Routing Problem

Okitonyumbe Y.F., Joseph and Ulungu, Berthold E.-L. and Kapiamba Nt., Joel (2015): Cobweb Heuristic for solving Multi-Objective Vehicle Routing Problem. Published in: International Journal of Applied Mathematical Research , Vol. 4, No. 3 (11 July 2015): pp. 430-436.

[img]
Preview
PDF
MPRA_paper_66121.pdf

Download (1MB) | Preview

Abstract

Abstract 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 heuristic is 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.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.