'Adaptive Link Adjustment' Applied to the Fixed Charge Transportation Problem(Numerical Analysis and Optimization)
スポンサーリンク
概要
- 論文の詳細を見る
The fixed charge transportation problem (FCTP) is a classic challenge for combinatorial optimization; it is based on the well-known transportation problem (TP), and is one of the prime examples of an NP-complete variant of the TP, of general importance in a wide range of transportation network design problems. Many techniques have been applied to this problem, and the most effective so far (in terms of near-optimal results in reasonable time on large instances) are evolutionary algorithm based approaches. In particular, an EA proposed by Eckert and Gottlieb has produced the best performance so far on a set of specific benchmark instances. We introduce a new scheme, which has more general applicability, but which we test here on the FCTP. The proposed scheme applies an adaptive mutation process immediately following the evaluation of a phenotype. It thereby adapts automatically to learned information encoded in the chromosome. The underlying encoding approach is to encode an ordering of elements for interpretation by a constructive algorithm (such as with the Link and Node Biased encoding for spanning trees, and the Random Keys encoding which has been applied to both scheduling and graph problems), however the main adaptive process rewards links in such a way that genes effectively encode a measure of the number of times their associated link has appeared in selected solutions. Tests are done which compare our approach with Eckert and Gottlieb's results on benchmark FCTP instances, and other approaches.
- 社団法人電子情報通信学会の論文
- 2007-12-01
著者
関連論文
- 'Adaptive Link Adjustment' Applied to the Fixed Charge Transportation Problem(Numerical Analysis and Optimization)
- A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem(Algorithms and Data Structures)