Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Tabu search for the linear ordering problem withcumulative costs

Tabu search for the linear ordering problem withcumulative costs Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This well known NP-complete problem can also be formulated on a complete weighted graph, where the objective is to find an acyclic tournament that maximizes the sum of arc weights. The variant of the LOP that we target here was recently introduced and adds a cumulative non-linear propagation of the costs to the sum of the arc weights. We first review the previous methods for the LOP and for this variant with cumulative costs (LOPCC) and then propose a heuristic algorithm for the LOPCC, which is based on the Tabu Search (TS) methodology. Our method achieves search intensification and diversification through the implementation of both short and long term memory structures. Our extensive experimentation with 224 instances shows that the proposed procedure outperforms existing methods in terms of solution quality and has reasonable computing-time requirements. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational Optimization and Applications Springer Journals

Tabu search for the linear ordering problem withcumulative costs

Download PDF
19 pages

Loading next page...
 
/lp/springer-journal/tabu-search-for-the-linear-ordering-problem-with-cumulative-costs-1Gd2EDlaOv

References (25)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Springer Science+Business Media, LLC
Subject
Mathematics; Optimization; Operations Research, Management Science; Operation Research/Decision Theory; Statistics, general; Convex and Discrete Geometry
ISSN
0926-6003
eISSN
1573-2894
DOI
10.1007/s10589-009-9270-5
Publisher site
See Article on Publisher Site

Abstract

Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This well known NP-complete problem can also be formulated on a complete weighted graph, where the objective is to find an acyclic tournament that maximizes the sum of arc weights. The variant of the LOP that we target here was recently introduced and adds a cumulative non-linear propagation of the costs to the sum of the arc weights. We first review the previous methods for the LOP and for this variant with cumulative costs (LOPCC) and then propose a heuristic algorithm for the LOPCC, which is based on the Tabu Search (TS) methodology. Our method achieves search intensification and diversification through the implementation of both short and long term memory structures. Our extensive experimentation with 224 instances shows that the proposed procedure outperforms existing methods in terms of solution quality and has reasonable computing-time requirements.

Journal

Computational Optimization and Applications – Springer Journals

Published: Jul 3, 2009

There are no references for this article.