巻号一覧
前身誌
114 巻, 4 号
選択された号の論文の15件中1～15を表示しています
- |<
- <
- 1
- >
- >|
-
巡回セールスマン問題の例から茨木 俊秀1994 年 114 巻 4 号 p. 411-419
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーPDF形式でダウンロード (2030K) -
大堀 隆文, 山本 啓了, 薛 念祖, 渡辺 一央1994 年 114 巻 4 号 p. 420-425
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーHopfield has shown that the combinatorial optimization problem can be solved on an artificial neural network system minimizing the quadratic energy function. One of the difficulties in applying the network to actual problems is that the network converges to local minimum solutions very slowly because the sigmoidal function is used for an input-output function of the neuron. In order to overcome this difficulty, we propose an accelerated Hopfield neural network which can control the speed of convergence near the local minima by an acceleration parameter. Computational results for the combinatorial problems with two and twenty-five variables show that: (1) the proposed model converges to the local minima more quickly than the conventional model, (2) that the acceleration of convergence makes the attraction region of each local minimum change and makes the accuracy of the solution worse, (3) that if an initial point is selected around the center of unit hyper cube, the proposed network converges to a local minimum very quickly with high accuracy, and these good properties keep unchanged by the acceleration parameter.抄録全体を表示PDF形式でダウンロード (1375K) -
多田 実, 石井 博昭1994 年 114 巻 4 号 p. 426-429
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーWhen we consider the assignment problem, the value of efficiency eij from the assignment of person i to job j must be determined by a decision maker. However, when he/she wants to evaluate the efficiency suitably, it may be difficult to give a rigid number. That is, the description of the problem seems to need manifold examinations, e.g., a vocational aptitude test (usually at great cost). Since the efficiency (or personal ability) naturally has a qualitative property, we accordingly consider two assignment problems with satisfaction degrees which are based on fuzzy set theory.抄録全体を表示PDF形式でダウンロード (1166K) -
藤沢 克樹, 久保 幹雄, 森戸 晋1994 年 114 巻 4 号 p. 430-437
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーIn this paper, we report on an application of tabu search to the graph partitioning problem which has applications on circuit board wiring and program segmentation. We discuss how to adapt tabu search to the graph partitioning problem and compare the performance with simulated annealing, another variant of local search incorporating randomized technique. Numerical experiments show that our algorithm dominates the simulated annealing algorithm in accuracy of solutions and speed on both uniform and geometric instances. In particular, our tabu search implementation works much better than the simulated annealing algorithm on structured (geometric) instances. We also investigate how to tune up our implementation and to optimize the various parameters via extensive numerical experiments.抄録全体を表示PDF形式でダウンロード (1786K) -
戴 陽, 岩野 和生, 加藤 直樹1994 年 114 巻 4 号 p. 438-443
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーGiven a connected undirected multigraph G=(V, E) with positive edge capacities and a positive integer k with k≥2, the minimum k-cut problem is to find a set S⊆E of minimum capacity whose removal leaves k connected components. It is known that this problem is NP-hard. In this paper we propose a new approximate algorithm for solving the minimum k-cut problem by using efficient algorithm for the minimum range k-cut problem. Our method is based on the association of the range value of a k-cut and its cut value when each edge weight is chosen uniformly randomly between 0 and 1. Though the closeness of our approximate solution has not yet been theoretically evaluated, we demonstrate its usefulness by performing computational experiments and comparing with another appoximate algorithm proposed by Saran and Vazirani. Our computational experiments show that the new method produces almost the same solutions or even better solutions for small k like k=3, 4, with running time much less than that for the algorithm of Saran and Vazirani.抄録全体を表示PDF形式でダウンロード (1295K) -
吉田 泰子, 松井 知己1994 年 114 巻 4 号 p. 444-449
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーThe edge coloring problem finds an assignment of colors to the edges of a given graph using as few colors as possible, so that no two adjacent edges receive the same colors. This problem arises in many application settings. Examples are routing in a permutation network, a preemptive scheduling of an open shop, a preemptive scheduling of unrelated parallel processors, and a class-teacher timetable problem. When a given graph is bipartite, strongly polynomial time algorithms for finding an edge coloring have previously been given.
In this paper, we propose an algorithm for finding all the edge colorings of bipartite graphs without parallel edges. Our algorithm requires O (Km(d*+logn)) time and O (d*m2) space, where n (m) denotes the number of vertices (edges), d* denotes the maximum degree, and K denotes the number of edge colorings. Although the time complexity is proportional to the number of edge colorings, the memory space doesn't depend on-it.抄録全体を表示PDF形式でダウンロード (1550K) -
Bertrand Simon Huppe, 奥谷 巖1994 年 114 巻 4 号 p. 450-455
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーThe purpose of this study is to construct a new algorithm using Genetic Algorithm (GA) which can assist decision makers concerned with resource allocation and manpower scheduling problems.
There are many methods for solving a variety of manpower scheduling problems. Depending upon the requirements involved in a problem, they can be classified into two basic types; one deals with the minimization of the project duration time with a constraint on the total availability of certain key resources, while the other deals with the minimization of the peak of used resources or “leveling” resource demand with a constraint on the total project duration time. In practice, the requirements are becoming so complicated and marginal that it is sometimes practically impossible to solve the problem by traditional methods. In this paper, we developed a systematic scheduling procedure by use of GA, which is very general in that the procedure can take multiple constrains as well as various forms of goal into account. It is demonstrated in the model testings that the proposed procedure can improve the disadvantages of the existing methods compared.抄録全体を表示PDF形式でダウンロード (1346K) -
内村 圭一, 神吉 健一郎1994 年 114 巻 4 号 p. 456-462
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーWe present a practical algorithm that finds the shortest round trip route rounding arbitrary plural nodes on road network data that we made. This algorithm is based on our intuition. When we look at a road map and decide the shortest round trip routes, we should imagine a frame including all tour nodes. The frame is composed of a convex hull. The time complexity is compared between the proposed algorithm and a greedy method which is one of the approximation methods. The practice time of the above two methods and the Hopfield type neural network which is said to be effective for solving a travelling salesman problem, are compared among them each other, too. The accuracy of the proposed algorithm is then compared to an exhaustive search, the greedy method, and the Hopfield type neural network on road network data. From these results, it is shown that the proposed algorithm is effective for finding round trip routes.抄録全体を表示PDF形式でダウンロード (789K) -
伊藤 大雄1994 年 114 巻 4 号 p. 463-469
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーConnectivity (of node-to-node) is used to examine the robustness of graphs. In some telecommunication networks, some switches are integrated into a logical switching area. In this case, we should examine node-to-area connectivity rather than node-to-node connectivity.
A new idea, NA (node-to-area)-connectivity, is proposed, and this paper shows that the problem of making a minimum NA-connected spanning subgraph of a given graph belongs to the class NP-hard. It also shows, however, that a near-optimum solution to this problem can be given by a linear-time algorithm. The concept of k-NA-connectivity is also introduced, and this paper shows that any k-NA-connected graph G=(V, E) has a sparse k-NA-connected spanning subgraph G'=(V, E') with |E|=O(k|V|). This is shown by presenting an O(|E|)-time algorithm to find one such subgraph. Although the problem of making a minimum k-NA-connected spanning subgraph of a given graph, of course, belongs to the class NP-hard, this problem can be given an approximate solution by the algorithm.抄録全体を表示PDF形式でダウンロード (1160K) -
3機械フローショップスケジューリング問題への応用木瀬 洋, 程 金良, 松本 浩典1994 年 114 巻 4 号 p. 470-475
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーThe 3-machine flowshop scheduling problem that askes to minimize the makespan is very important in present manufacturing systems because 3-machine flowshops are typical examples of the flexible manufacturing systems. From the point of computational complexity this problem is unary NP-complete, suggesting that it is very hard to exactly solve large scale problem instances that occur in practical situations. In order to develop an efficient branch-and-bound algorithm for this problem we notice some dominance relation whose precondition, although being rare in the practical situation, is a sufficient condition for the optimal schedule, suggesting that if it approximately holds, thus being more realistic, then the dominance relation holds with high possibility. The branch-and-bound algorithm proposed here takes advantage of this possibility that is represented by a membership function in the context of fuzzy inference for obtaining an optimal solution as early as possible in the branch-and-bound search. Extensive numerical experiments show that optimal solutions of problem instances with up to 200 jobs can be obtained with quite high probability.抄録全体を表示PDF形式でダウンロード (1333K) -
山田 武士, Bruce E. Rosen, 中野 良平1994 年 114 巻 4 号 p. 476-482
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーThe Job Shop Scheduling Problem is one of the most difficult NP-hard combinatorial optimization problems. This research investigates finding near optimal schedules using simulated annealing and a recently developed schedule permutation procedure. New schedules are generated by permuting operations within existing schedules. Simulated annealing (SA) probabilistically chooses one of the new schedules and probabilistically accepts or rejects it, allowing importance sampling search over the job shop schedule space. The initial and final temperatures are adaptively determined a priori, and a reintensification strategy improves the search by resetting the current temperature and state.
Experimental results show this method, possessing the simplicity and flexibility of SA, can find near optimal schedules for the difficult benchmark problems and can outperform the existing SA adjacent swapping approach as applied to job shop scheduling problems.抄録全体を表示PDF形式でダウンロード (973K) -
Kiyoshi Yoneda1994 年 114 巻 4 号 p. 483-490
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーThis paper concerns the classic problem of contingency tables with given marginals, also known as the problem of origin-destination table estimation. While traditional methods provide nonnegative real number estimates. the method herein provides integer estimates. The algorithm comprises two stages: the first is the standard iterative scaling which yields real value estimates; the second trims the real estimates into integers by combinatorial optimization. A penalty scheme converts the constrained combinatorial optimization into an unconstrained one so that any standard combinatorial optimization method can be used, such as simulated annealing. Bootstrapping experiments and an analysis of 39 sample sets of 12- and 18-floor elevator traffic measurement indicate that the integer estimate provides a higher resolution than the standard real estimate with roughly the same accuracy.抄録全体を表示PDF形式でダウンロード (1240K) -
石原 学, 白滝 順1994 年 114 巻 4 号 p. 491-496
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーThe intelligibility of intermittently eliminated Japanese speech wave is discussed in this paper. In our experiment, a segment of a Japanese speech wave is intermittently removed by varying the erasing duration and the period. Here, ratio of the erasing duration to period are varied from 10:90 to 90:10 every 10 percent. Listening tests for evaluating intermittently eliminated speech wave have been carried out by about 1000 males aged from 21 to 24 years. Experimental results show that the intelligibility falls from 0.1 ms for 1 ms. The intelligibility increase for the erasing period surpassing 2 to 3 ms.抄録全体を表示PDF形式でダウンロード (1465K) -
武田 英樹, 神成 文彦1994 年 114 巻 4 号 p. 497-503
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーA Ti: Sapphire laser pumped with six-flashlamps was developed. Small signal gain measurement was performed resulting in a peak gain-length product of 1.75. Optical energy available in the laser head was estimated to _??_800mJ, and the laser energy of 300 mJ was extracted using a normal stable resonator. When a grazing-incidence grating resonator with a relatively small incident angle of 82° was applied, we obtained the maximum laser energy of 120 mJ and the linewidth of _??_10pm, which was tunable within the mirror reflectivity bandwidth.抄録全体を表示PDF形式でダウンロード (1394K) -
神谷 祐二, 柴田 孝次1994 年 114 巻 4 号 p. 504-505
発行日: 1994/04/20
公開日: 2008/12/19
ジャーナル フリーPDF形式でダウンロード (748K)
- |<
- <
- 1
- >
- >|