Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/9658
Title: Composite goal methods for transportation network optimization
Authors: Veluscek, M
Kalganova, T
Broomhead, P
Grichnik, A
Keywords: Transportation network optimization;Ant Colony optimization;Multi-goal methods;Logistics optimization
Issue Date: 2014
Publisher: Elsevier
Citation: Expert Systems with Applications: (19 December 2014)
Abstract: Lately the topic of multi-objective transportation network optimization has received increased attention in the research literature. The use of multi-objective transportation network optimization has led to a more accurate and realistic solution in comparison to scenarios where only a single objective is considered. The aim of this work is to identify the most promising multi-objective optimization technique for use in solving real-world transportation network optimization problems. We start by reviewing the state of the art in multi-objective optimization and identify four generic strategies, which are referred to as goal synthesis, superposition, incremental solving and exploration. We then implement and test seven instances of these four strategies. From the literature, the preferred approach lies in the combination of goals into a single optimization model (a.k.a. goal synthesis). Despite its popularity as a multi-objective optimization method and in the context of our problem domain, the experimental results achieved by this method resulted in poor quality solutions when compared to the other strategies. This was particularly noticeable in the case of the superposition method which significantly outperformed goal synthesis.
URI: http://www.sciencedirect.com/science/article/pii/S0957417414007957
http://bura.brunel.ac.uk/handle/2438/9658
DOI: http://dx.doi.org/10.1016/j.eswa.2014.12.017
ISSN: 0957-4174
Appears in Collections:Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.docx616.14 kBUnknownView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.