<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Using support vector machines to learn the efficient set in multiple objective discrete optimization

Loading...
Thumbnail Image

Departments

School / College / Institute

Program

KU-Authors

Organization Authors

Co-Authors

Aytuğ, Haldun

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

We propose using support vector machines (SVMs) to learn the efficient set in multiple objective discrete optimization (MODO). We conjecture that a surface generated by SVM could provide a good approximation of the efficient set. As one way of testing this idea, we embed the SVM-approximated efficient set information into a Genetic Algorithm (GA). This is accomplished by using a SVM-based fitness function that guides the GA search. We implement our SVM-guided GA on the multiple objective knapsack and assignment problems. We observe that using SVM improves the performance of the GA compared to a benchmark distance based fitness function and may provide competitive results.

Source

Publisher

Elsevier

Citation

item.page.haspartof

Source

European Journal of Operational Research

item.page.ispartofseries

item.page.edition

DOI

10.1016/j.ejor.2007.09.002

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators