Skip to Main content Skip to Navigation
New interface
Conference papers

MOEA/D for a Tri-objective Vehicle Routing Problem

Abstract : This work examines the Capacitated Vehicle Routing Problem with Balanced Routes and Time Windows (CVRPBRTW). The problem aims at optimizing the total distance cost, the number of vehicles used, and the route balancing, under the existence of time windows and other constraints. The problem is formulated as a Multi-Objective Optimization Problem where all objectives are tackled simultaneously, so as to effect a better solution space coverage. A Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), hybridized with local search elements, is proposed. The application of local search heuristics is not uniform but depends on specific objective preferences and instance requirements of the decomposed subproblems. To test the efficacy of the proposed solutions, extensive experiments were conducted on well known benchmark problem instances and results were compared with other MOEAs.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, February 7, 2017 - 1:04:43 PM
Last modification on : Thursday, March 5, 2020 - 5:41:25 PM
Long-term archiving on: : Monday, May 8, 2017 - 2:23:55 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Andreas Konstantinidis, Savvas Pericleous, Christoforos Charalambous. MOEA/D for a Tri-objective Vehicle Routing Problem. 9th Artificial Intelligence Applications and Innovations (AIAI), Sep 2013, Paphos, Greece. pp.131-140, ⟨10.1007/978-3-642-41142-7_14⟩. ⟨hal-01459605⟩



Record views


Files downloads