Solving Multi-Objective Vehicle Routing Problem with Time Windows Using Hybrid Ants Optimization and Tabu Search Based on Performance Metrics

Mohammed Hassan, Laina Makdyssiian and Wassim Habib Bilal

Modern Applied Science, 2017, vol. 11, issue 5, 52

Abstract: In this research, we are studying the possibility of contribution in solving the multi-objective vehicle Routing problem with time windows, that is one of the optimization problems of the NP-hard type, This problem has attracted a lot of attention now because of its real life applications.Moreover, We will also introduce an algorithm called Hybrid Algorithm (HA) which depends on integrates between Multiple Objective Ant Colony Optimisation (MOACO) and Tabu Search (TS) algorithm based on the Pareto optimization, and compare the presented approach is the developer with standard tests to demonstrate the applicability and efficiency.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/0/0/12828/39571 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/66248 (text/html)

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:ibn:masjnl:v:11:y:2017:i:5:p:52

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().