INFORMATION PROCESSING TECHNIQUE FOR DETERMINING TRAVELING ROUTE

• US 20130024227A1
• Filed: 06/20/2012
• Published: 01/24/2013
• Est. Priority Date: 07/20/2011
• Status: Abandoned Application

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: IWANE, Hidenao, Kira, Akifumi
• Application Number:
  US13/527,824
• Publication Number:
  US 20130024227A1
• Time in Patent Office: Days
• US Class Current: 705/7.13
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem

Abstract

A disclosed method includes determining, for each operator group, scheduled execution order by arranging, for each operator group, the predetermined number of operations to be conducted while traveling, wherein at least a portion of the predetermined number of operations is allotted to each of the operator groups; determining, for each operator group, operations to be conducted in the scheduled execution order by determining, for each operator group, along the scheduled execution order of the operator group and while advancing time, whether movement to an operation place of each operation of the predetermined number of operations and start of the operation satisfy a constraint condition set in advance for the predetermined number of operations; and calculating a first evaluation value of orders of the operations determined to be conducted for the plural operator groups.

Claims

1. A computer-readable, non-transitory storage medium storing a program for causing a computer to execute a procedure comprising:

first determining, for each of a plurality of operator groups, scheduled execution order by arranging, for each of the plurality of operator groups, the predetermined number of operations to be conducted while traveling, wherein at least a portion of the predetermined number of operations is allotted to each of the plurality of operator groups;

second determining, for each of the plurality of operator groups, operations to be conducted in the scheduled execution order by determining, for each of the plurality of operator groups, along the scheduled execution order of the operator group and while advancing time, whether movement to an operation place of each operation of the predetermined number of operations and start of the operation satisfy a constraint condition set in advance for the predetermined number of operations; and

calculating a first evaluation value of orders of the operations determined to be conducted for the plurality of operator groups.

2. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the procedure further comprises:

changing a portion of the scheduled execution order based on a predetermined rule;

carrying out the second determining and the calculating for the scheduled execution order after the changing; and

upon determining that a second evaluation value calculated in the carrying out for the scheduled execution order after the changing is less than the first evaluation value, storing the second evaluation value, orders of operations determined to be conducted for the plurality of operator groups, and the scheduled execution order after the change.

3. The computer-readable, non-transitory storage medium as set forth in claim 2, wherein the changing, the carrying out and the storing are repeated until a first condition that the second evaluation value becomes less than a first threshold, a second condition that an execution time consumed from the first determining to the storing exceeds a predetermined first period or a third condition that a state that a variation of the second evaluation value is less than a second threshold is kept for a predetermined second period is satisfied.

4. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the second determining comprises:

storing, for each of the plurality of operator groups, an operation state and a movement destination or operation place while advancing time; and

storing, for each of the plurality of operator groups, identifiers of the operations determined to be conducted among the predetermined number of operations or operation places of the operations determined to be conducted, in sequence.

5. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the first determining comprises determining whether or not the scheduled execution order satisfies a priority condition included in the constraint conditions.

6. The computer-readable, non-transitory storage medium as set forth in claim 2, wherein the changing comprises determining whether or not the scheduled execution order after the changing satisfies a priority condition included in the constraint conditions.

7. An information processing method, comprising:

first determining, for each of a plurality of operator groups and by using a computer, scheduled execution order by arranging, for each of the plurality of operator groups, the predetermined number of operations to be conducted while traveling, wherein at least a portion of the predetermined number of operations is allotted to each of the plurality of operator groups;

second determining, for each of the plurality of operator groups and by using the computer, operations to be conducted in the scheduled execution order by determining, for each of the plurality of operator groups, along the scheduled execution order of the operator group and while advancing time, whether movement to an operation place of each operation of the predetermined number of operations and start of the operation satisfy a constraint condition set in advance for the predetermined number of operations; and

calculating, by using the computer, a first evaluation value of orders of the operations determined to be conducted for the plurality of operator groups.

8. An information processing apparatus, comprising:

a memory; and

a processor using the memory and configured to execute a procedure comprising;

first determining, for each of a plurality of operator groups, scheduled execution order by arranging, for each of the plurality of operator groups, the predetermined number of operations to be conducted while traveling, wherein at least a portion of the predetermined number of operations is allotted to each of the plurality of operator groups;

second determining, for each of the plurality of operator groups, operations to be conducted in the scheduled execution order by determining, for each of the plurality of operator groups, along the scheduled execution order of the operator group and while advancing time, whether movement to an operation place of each operation of the predetermined number of operations and start of the operation satisfy a constraint condition set in advance for the predetermined number of operations; and

calculating a first evaluation value of orders of the operations determined to be conducted for the plurality of operator groups.