Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 17 (2004), No. 3

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 37 (2024)

  2. Vol. 36 (2023)

  3. Vol. 35 (2022)

  4. Vol. 34 (2021)

  5. Vol. 33 (2020)

  6. Vol. 32 (2019)

  7. Vol. 31 (2018)

  8. Vol. 30 (2017)

  9. Vol. 29 (2016)

  10. Vol. 28 (2015)

  11. Vol. 27 (2014)

  12. Vol. 26 (2013)

  13. Vol. 25 (2012)

  14. Vol. 24 (2011)

  15. Vol. 23 (2010)

  16. Vol. 22 (2009)

  17. Vol. 21 (2008)

  18. Vol. 20 (2007)

  19. Vol. 19 (2006)

  20. Vol. 18 (2005)

  21. Vol. 17 (2004)

  22. Vol. 16 (2003)

  23. Vol. 15 (2002)

  24. Vol. 14 (2001)

  25. Vol. 13 (2000)

  26. Vol. 12 (1999)

  27. Vol. 11 (1998)

  28. Vol. 10 (1997)

  29. Vol. 9 (1996)

  30. Vol. 8 (1995)

  31. Vol. 7 (1994)

  32. Vol. 6 (1993)

  33. Vol. 5 (1992)

  34. Vol. 4 (1991)

  35. Vol. 3 (1990)

  36. Vol. 2 (1989)

  37. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 17 (2004), No. 3

Experiments of a New Meta-Heuristics to Reduce the Search Space by Partially Fixing of the Solution Values

Kazumiti NUMATA, Yukinobu IWAKURA

pp. 103-112

Abstract

In this paper we present a new meta-heuristic approach to the traveling Salesman problem (TSP) and evaluate its performance. Proposed method reproduces and selects a population of local optima searched by random start modified Lin-Kernighan (mLK) method. It enhances the search power and efficiency of mLK by fixing the part of the solution whose values coincide each other and thus reducing the search space of solutions. Results of numerical experiments on TSPLIB95 (500 or so cities instances) show that it is superiorly competitive to existing meta-heuristic methods for TSP. The reason of enhanced search power is also investigated through obserbation of its search processes.

Bookmark

Share it with SNS

Article Title

Experiments of a New Meta-Heuristics to Reduce the Search Space by Partially Fixing of the Solution Values

A Method for Solving Jobshop Scheduling Problems with Limited Common Buffers

Gui Fu, Yong ZHAO, Nobuo SANNOMIYA

pp. 113-121

Abstract

A new jobshop scheduling problem with limited common buffers is dealt with in this paper. The standard genetic algorithm is not applicable to the present problem for deadlocks led by buffer constraints. A new algorithm is proposed by combining the genetic algorithm (GA) with a semi-active decoding which avoids deadlocks and satisfies the buffer constraints. Some benchmark problems appending with buffer constraints are tested by both the proposed GA and the multi-start local search method (MLS). Computation results show that the proposed GA outperforms MLS well. Computation is also made by varying the number of common buffers. These results are compared among the available results of the no-buffer jobshop problem and the normal jobshop problem. Consequently the results of the proposed GA are satisfactory.

Bookmark

Share it with SNS

Article Title

A Method for Solving Jobshop Scheduling Problems with Limited Common Buffers

Optimal Structure of Decision-tree-based Pairwise Support Vector Machines

Fumitake TAKAHASHI, Shigeo ABE

pp. 122-130

Abstract

Decision Directed Acyclic Graph (DDAG) and Adaptive Directed Acyclic Graph (ADAG) are the decision-tree-based support vector machines for multiclass problems. These methods show high generalization abilities but their abilities depend on the structures. In this paper, we determine the structures so that the unclassifiable regions caused by voting are resolved by the decision boundaries for class pairs with low generalization ability. Namely, at the higher level of the tree, we select a pair of classes with higher generalization ability that is estimated by the error bounds proposed for SVMs. We demonstrate the effectiveness of our method using benchmark data sets.

Bookmark

Share it with SNS

Article Title

Optimal Structure of Decision-tree-based Pairwise Support Vector Machines

Analysis and Synthesis of Model Reference ILQ Servo System with Tracking Robustness

Sadaaki KUNIMATSU, Masakazu FUJII, Takao FUJII

pp. 131-138

Abstract

In this paper, we propose a design method for servo systems with tracking robustness. Here we consider the control configuration of robust servo system plus a reference model, in which the robust servo system is designed by the ILQ design method as proposed by the third author. First, we show the configuration of this servo system and then provide a theoretical basis for parameter tuning. Second, we clarify the relation between these parameters and the closed loop performance such as robust stability and tracking robustness. Finally we establish a new design method of ILQ servo system with tracking robustness, and show its effectiveness by a numerical example.

Bookmark

Share it with SNS

Article Title

Analysis and Synthesis of Model Reference ILQ Servo System with Tracking Robustness

An Adaptive Equalizer for Stochastic Communication Channels with the EM Algorithm

Takao KOMOTO, Kazunori IWATA, Kazushi IKEDA, Kazunori HAYASHI, Hideaki SAKAI

pp. 139-141

Bookmark

Share it with SNS

Article Title

An Adaptive Equalizer for Stochastic Communication Channels with the EM Algorithm

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.