Cobweb Heuristic for solving Multi-Objective Vehicle Routing Problem

Joseph Okitonyumbe Y.F., Berthold E.-L. Ulungu and Joel Kapiamba Nt.

MPRA Paper from University Library of Munich, Germany

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.

Keywords: Keywords: Savings; Cobweb; Heuristics; Multiobjective; Vehicle Routing Problem. (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
Date: 2015-07-11
New Economics Papers: this item is included in nep-cmp and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in International Journal of Applied Mathematical Research 3.4(2015): pp. 430-436

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/66121/1/MPRA_paper_66121.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:66121

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().