Patent US5974355A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5974355A Expired / Lapsed US ⏱️ 0.0 years remaining

Automatic time series pattern creating method

Assignee: Fujitsu Ltd
•
Filing: 1997-03-31
•
Granted: 1999-10-26
•
Expires: 2017-03-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention relates to the creating of an aircrew flight scheduling pattern as a time series pattern, and aims at facilitating the effective crew flight scheduling pattern creation by applying a genetic algorithm. A plurality of flight strings are created based on link relations among flights regarded as elements for one day which is defined as a first time span. A genetic algorithm is executed for each flight string, and daily crew flight scheduling patterns are created based on the most suitable evaluation value flight strings. For one month which is defined as a second time span, a monthly crew flight scheduling pattern is created based on the most suitable evaluation value daily pattern strings in the same way by regarding the daily crew flight patterns for 30 days as elements.

Inventors

  • 👤 Shunji Matsumoto
  • 👤 Yutaka Miyahara

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 04:30
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/10; G06Q10/109; G06Q10/02

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 194 words
An automatic time series pattern creation method for creating a plurality of time series patterns by sequencing elements which should be arranged in time series order, comprising the steps of: obtaining first time series patterns for a first time span based on contents of an element string with a suitable evaluation value among element strings which are created based on link relations generated by successively linking an element with an earliest starting time to other elements with a starting time later than an end time of the element with the earliest starting time; and creating second time series patterns for a second time span longer than said first time span based on the contents of a string of first time series patterns with a suitable evaluation value among strings of first time series patterns which are created based on link relations generated by successively linking the first time series pattern with an earliest starting time to other first time series patterns with a starting time later than an end time of the first time series pattern with the earliest starting time by using said first time series patterns obtained for said first time span.
Claim 2
Dependent Claim 194 words
An automatic time series pattern creation method for creating a plurality of time series patterns by sequencing elements which should be arranged in time series order, comprising the steps of: obtaining first time series patterns for a first time span based on contents of an element string with a suitable evaluation value among element strings which are created based on link relations generated by successively linking an element with an earliest starting time to other elements with a starting time later than an end time of the element with the earliest starting time; and creating second time series patterns for a second time span longer than said first time span based on the contents of a string of first time series patterns with a suitable evaluation value among strings of first time series patterns which are created based on link relations generated by successively linking the first time series pattern with an earliest starting time to other first time series patterns with a starting time later than an end time of the first time series pattern with the earliest starting time by using said first time series patterns obtained for said first time span.
Claim 3
Dependent Claim 60 words
The automatic time series pattern creation method according to claim 1, wherein a genetic algorithm is applied using the element strings which are used in creating said first time series pattern for said first time span and using said first time series patterns as chromosomes, which are used in creating said second time series patterns for said second time span.
Claim 4
Dependent Claim 69 words
The automatic time series pattern creation method according to claim 2, wherein in a process of said genetic algorithm, a one-point crossover between arbitrary elements of said element strings or between said first time series patterns of the string of first time series patterns, and a mutation which targets element strings or said string of first time series patterns created as a result of the one-point crossover, are executed.
Claim 5
Dependent Claim 34 words
The automatic time series pattern creation method according to claim 1, wherein said elements are airplane flights, and said first time series patterns and said second time series patterns are crew flight scheduling patterns.
Claim 6
Dependent Claim 44 words
The automatic time series pattern creation method according to claim 4, wherein said elements are flights in one day, and a plurality of most suitable daily crew flight scheduling patterns are created for a plurality of air crews as said first time series patterns.
Claim 7
Dependent Claim 86 words
The automatic time series pattern creation method according to claim 4, wherein a plurality of most suitable daily crew flight scheduling patterns for a plurality of air crews are created for successive days using all airplane flights in one day as elements as the first time series patterns, and a most suitable crew flight scheduling pattern for said successive days is created as the second time series pattern based on link relations created by successively linking the daily crew flight scheduling patterns for said successive days.
Claim 8
Dependent Claim 272 words
The automatic time series pattern creation method according to claim 6, further comprising the steps of: creating a plurality of daily crew flight scheduling patterns for a plurality of air crews for successive days; successively linking each of said daily crew flight scheduling patterns starting at an earliest starting time for a first flight pattern to each of connectable daily crew flight patterns starting after an arriving time of a last flight of said daily crew flight scheduling patterns, and creating a plurality of link relations with allowing for including duplicated daily crew flight patterns among different link relations; designating a position in strings of daily crew flight scheduling patterns in which daily crew flight patterns should be arranged by corresponding to each daily crew flight scheduling pattern at beginning of a link relation for a plurality of said link relations; creating a plurality of strings of daily crew flight scheduling patterns by allocating each selected daily crew flight scheduling pattern in each corresponding position after each daily crew flight scheduling pattern starting said link relation by selecting each daily crew flight pattern from one or more connectable daily crew flight patterns; executing predetermined processing after obtaining an evaluation value with a predetermined format for a plurality of strings of said daily crew flight scheduling patterns; obtaining an evaluation value with said predetermined format for a new string of daily crew flight scheduling pattern created as a result of said predetermined processing; and creating a most suitable crew flight scheduling pattern for said successive days based on contents of a string of daily crew flight scheduling patterns with a best evaluation value.
Claim 9
Dependent Claim 203 words
An automatic time series pattern creation apparatus for creating a plurality of time series patterns by sequencing elements which should be arranged in a time series order, comprising: first time series pattern creation means for creating first time series patterns for a first time span based on contents of an element string with a suitable evaluation value among element strings created based on link relations generated by successively linking an element with an earliest starting time to other elements with a starting time later than an end time of the element with the earliest starting time; and second time series pattern creation means for creating second time series patterns for a second time span longer than said first time span based on contents of a string of first time series patterns with a suitable evaluation value among strings of first time series patterns which are created based on link relations generated by successively linking said first time series patterns with an earliest starting time to other first time series patterns with a starting time later than an end time of the first time series pattern with the earliest starting time by using said first time series patterns created for said first time span.
Claim 10
Dependent Claim 203 words
An automatic time series pattern creation apparatus for creating a plurality of time series patterns by sequencing elements which should be arranged in a time series order, comprising: first time series pattern creation means for creating first time series patterns for a first time span based on contents of an element string with a suitable evaluation value among element strings created based on link relations generated by successively linking an element with an earliest starting time to other elements with a starting time later than an end time of the element with the earliest starting time; and second time series pattern creation means for creating second time series patterns for a second time span longer than said first time span based on contents of a string of first time series patterns with a suitable evaluation value among strings of first time series patterns which are created based on link relations generated by successively linking said first time series patterns with an earliest starting time to other first time series patterns with a starting time later than an end time of the first time series pattern with the earliest starting time by using said first time series patterns created for said first time span.
Claim 11
Dependent Claim 125 words
The automatic time series pattern creation apparatus according to claim 8, wherein: said first time series pattern creation means creates a plurality of most suitable daily crew flight scheduling patterns corresponding to a plurality of air crews as said first time series patterns and by regarding flights in one day as said element; and said second time series pattern creation means creates a most suitable crew flight pattern for successive days as said second time series pattern based on the contents of a string of daily patterns with a suitable evaluation value among strings of daily patterns created based on link relations generated by successively linking daily crew flight scheduling patterns by regarding said daily crew flight scheduling patterns as said first time series patterns.
Claim 12
Dependent Claim 198 words
A computer-readable recording medium used to direct a computer to function in a particular manner when used by the computer, comprising the records of: first time series pattern obtaining procedure for obtaining first time series patterns for a first time span based on contents of an element string with a suitable evaluation value among element strings created based on link relations generated by successively linking an element with an earliest starting time to other elements with a starting time later than an end time of the element with the earliest starting time; and second time series pattern obtaining procedure for obtaining second time series patterns for a second time span longer than said first time span based on contents of a string of the first time series patterns with a suitable evaluation value among strings of first time series patterns created based on link relations generated by successively linking said first time series pattern with an earliest starting time to other first time series patterns with a starting time later than an end time of said first time series pattern with the earliest starting time by using said first time series patterns obtained for said first time span.
Claim 13
Dependent Claim 198 words
A computer-readable recording medium used to direct a computer to function in a particular manner when used by the computer, comprising the records of: first time series pattern obtaining procedure for obtaining first time series patterns for a first time span based on contents of an element string with a suitable evaluation value among element strings created based on link relations generated by successively linking an element with an earliest starting time to other elements with a starting time later than an end time of the element with the earliest starting time; and second time series pattern obtaining procedure for obtaining second time series patterns for a second time span longer than said first time span based on contents of a string of the first time series patterns with a suitable evaluation value among strings of first time series patterns created based on link relations generated by successively linking said first time series pattern with an earliest starting time to other first time series patterns with a starting time later than an end time of said first time series pattern with the earliest starting time by using said first time series patterns obtained for said first time span.
Claim 14
Dependent Claim 129 words
The computer-readable recording medium according to claim 10, wherein: said first time series pattern obtaining procedure creates a plurality of most suitable daily crew flight scheduling patterns corresponding to a plurality of air crews as said first time series patterns by regarding flights in one day as elements; and said second time series pattern obtaining procedure creates a most suitable crew flight scheduling pattern for successive days as second time series patterns based on contents of a string of daily crew flight scheduling patterns with a suitable evaluation value among strings of daily crew flight scheduling patterns created based on link relations generated by successively linking said daily crew flight scheduling patterns by regarding said daily crew flight scheduling patterns for successive days as said first time series patterns.
Claim 15
Dependent Claim 106 words
An automated scheduling method, comprising: generating a plurality of first strings each comprising a time-ordered sequence of nonoverlapping event elements selected from a plurality of predetermined event elements each having a specified start time and a specified end time, each of the first strings being selected to generate from a first predetermined evaluation procedure an evaluation value satisfying a first quantitative condition; and generating a plurality of second strings each comprising a time-ordered sequence of nonoverlapping ones of the plurality of first strings, each of the second strings being selected to generate from a second predetermined evaluation procedure an evaluation value satisfying a second quantitative condition.
Claim 16
Dependent Claim 106 words
An automated scheduling method, comprising: generating a plurality of first strings each comprising a time-ordered sequence of nonoverlapping event elements selected from a plurality of predetermined event elements each having a specified start time and a specified end time, each of the first strings being selected to generate from a first predetermined evaluation procedure an evaluation value satisfying a first quantitative condition; and generating a plurality of second strings each comprising a time-ordered sequence of nonoverlapping ones of the plurality of first strings, each of the second strings being selected to generate from a second predetermined evaluation procedure an evaluation value satisfying a second quantitative condition.
Claim 17
Dependent Claim 110 words
An automated scheduling apparatus, comprising: means for generating a plurality of first strings each comprising a time-ordered sequence of nonoverlapping event elements selected from a plurality of predetermined event elements each having a specified start time and a specified end time, each of the first strings being selected to generate from a first predetermined evaluation procedure an evaluation value satisfying a first quantitative condition; and means for generating a plurality of second strings each comprising a time-ordered sequence of nonoverlapping ones of the plurality of first strings, each of the second strings being selected to generate from a second predetermined evaluation procedure an evaluation value satisfying a second quantitative condition.
Claim 18
Dependent Claim 110 words
An automated scheduling apparatus, comprising: means for generating a plurality of first strings each comprising a time-ordered sequence of nonoverlapping event elements selected from a plurality of predetermined event elements each having a specified start time and a specified end time, each of the first strings being selected to generate from a first predetermined evaluation procedure an evaluation value satisfying a first quantitative condition; and means for generating a plurality of second strings each comprising a time-ordered sequence of nonoverlapping ones of the plurality of first strings, each of the second strings being selected to generate from a second predetermined evaluation procedure an evaluation value satisfying a second quantitative condition.
Claim 19
Dependent Claim 116 words
A computer-readable medium encoded with a program for automatic scheduling, the program comprising procedures for: generating a plurality of first strings each comprising a time-ordered sequence of nonoverlapping event elements selected from a plurality of predetermined event elements each having a specified start time and a specified end time, each of the first strings being selected to generate from a first predetermined evaluation procedure an evaluation value satisfying a first quantitative condition; and generating a plurality of second strings each comprising a time-ordered sequence of nonoverlapping ones of the plurality of first strings, each of the second strings being selected to generate from a second predetermined evaluation procedure an evaluation value satisfying a second quantitative condition.
Claim 20
Dependent Claim 116 words
A computer-readable medium encoded with a program for automatic scheduling, the program comprising procedures for: generating a plurality of first strings each comprising a time-ordered sequence of nonoverlapping event elements selected from a plurality of predetermined event elements each having a specified start time and a specified end time, each of the first strings being selected to generate from a first predetermined evaluation procedure an evaluation value satisfying a first quantitative condition; and generating a plurality of second strings each comprising a time-ordered sequence of nonoverlapping ones of the plurality of first strings, each of the second strings being selected to generate from a second predetermined evaluation procedure an evaluation value satisfying a second quantitative condition.

References Cited (Backward Citations)

US3787665A Cited
US4706198A Cited
US5265023A Cited
US5270920A Cited
US5428547A Cited
US5247438A Cited
US5732384A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-10-25 2003-04-26 2003-10-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-10-25 2007-04-26 2007-10-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-10-25 2011-04-26 2011-10-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag