| 摘要 |
PROBLEM TO BE SOLVED: To realize a speedy and property label arrangement by a method for replacing a genetic algorithm. SOLUTION: Respective total penalties for a present label arrangement patten 730 and a label arrangement pattern candidate 740 which is a local alteration of the present label arrangement pattern are calculated. Then, a present total penalty 750 and a candidate total penalty 760 are compared, and when the candidate total penalty 760 is smaller than the present total penalty 750, the present label arrangement pattern 730 is updated by the label arrangement pattern candidate 740. Also, when the candidate total penalty 760 is higher than the present total penalty 750, whether the present label arrangement pattern 730 is updated by the label arrangement pattern candidate 740 or not is probably determined. Then, the present label arrangement pattern 730 which is obtained after repeatedly performing this series of processes until prescribed conditions are satisfied is made an optimal train label arrangement pattern. COPYRIGHT: (C)2006,JPO&NCIPI
|
