DETAILED ACTION
Status of the Application
This Final Office Action is in response to Application Serial 18/681,976. In response to Examiner’s action mail dated May 22, 2026, Applicant submitted amendments and arguments. The Applicant amended claim 1, cancelled claim 2-19, and added claims 20-25. Claims 1, 21-25 are pending in this application.
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
Information Disclosure Statement
Applicant did not submit an Information Disclosure Statement for consideration.
Response to Arguments
Applicant's arguments filed May 22, 2026, have been fully considered but they are not persuasive. The amendments do not overcome the pending rejection.
Response to Claim Rejections- 35 U.S.C. 101
On pages 9-12 of the Applicant’s 35 U.S.C. 101 arguments, the Applicant submits, the method claim recites a coordinated and optimized dispatching method for electric buses. Applicant submits, the amended claim 1 meets patent eligibility requirements.
Applicant submits, step one relates to process.
At step 2A, Applicant submits the claim is not directed to any judicial exception. Applicants submits, the amended claim limitations does not describe an abstract concept, or a concept similar to those found by the Examiner to be abstract, such as, a method of organizing human activity, or mathematical relationship. The Applicant deleted the mathematical equation previously defined in claim 1. Applicant submits, the technical solution defined in the present application cannot be realized only through the human brain or organizing human activities. Accordingly, Applicant submits, the claimed steps do not recite an abstract idea.
Applicant refers to the “2024 Guidance Update on Patent Subject Matter Eligibility, Including on Artificial Intelligence”, limitations that are indicative of an inventive concept (aka “significantly more”), then lists MPEP 2106.05(a), MPEP 2106.05(c), MPEP 2106.04(d)(2) and 2106.05 (e ), and MPEP 2106.05(d). The Applicant states, even if the amended claim 1 is still regarded as an abstract idea, the amended claim 1 achieves an improvement to the existing technology, and uses the judicial exception in some other meaningful way, thus the amended claim 1 recites additional elements that amount to significantly more than the judicial exception.
In summary, Applicant submits, the amended claim 1 is eligible. Applicant has requested withdrawal of the 101 rejections.
Examiner respectfully disagrees with the Applicant’s 35 U.S.C 101 arguments. Examiner submits, the claims recite an abstract idea, and thus, the claims are directed to a judicial exception. The claims recite a method, and therefore, the claims do not proceed to the evaluation at Step 2B for significantly more.
Examiner submits, the Applicant’s claims recite variables and mathematical equations including a bi-level programming model, and therefore, the claims recite a mathematical concept and therefore are a directed to a judicial exception.
Since the claims recite limitations that are grouped as a mathematical concept, the claims are directed to a judicial exception. Although the Applicant removed the equation, the limitations recite mathematical functions that are calculations for optimization. The Applicant’s claims recite mathematical functions such as bi-level programming model, genetic algorithm, variables meeting constraint conditions then proceeding to a calculation and selection step, and generation of optimal solutions. The claims recite a mathematical concept.
The claims are related to optimizing bus service, which is a commercial activity. The objective function of the claims is to optimize the bus schedule and consider constraints such as battery replacement, and real passenger demand. Optimizing a commercial activity is a concept that is certain method of organizing human activity.
The claims recite an improvement to the data variables (e.g., bus departure, passenger flow). Although the claims recite bi-level programming model is solved according to a genetic algorithm to acquire an optimal bus dispatching plan, the genetic algorithm that is an optimization technique, and therefore is a mathematical algorithm. The Applicant’s claims do not recite additional elements, so the judicial exception is not integrated into a practical application. Therefore, the Subject Matter Eligibility analysis stops at Step 2A. Since the 35 U.S.C. 101 analysis stops at Step 2A, the claims are not patent eligible.
In response the Applicant listing the guidance that is related to the Step 2B (aka significantly more) and the “2024 Guidance Update on Patent Subject Matter Eligibility, Including on Artificial Intelligence” the 35 U.S.C. 101 analysis stops at Step 2A. The claims are not patent eligible.
Response to Amendment
The Applicant amended claim 1, cancelled claim 2-19, and added claims 20-25. Claims 1, 21-25 are pending in this application.
Regarding 35 U.S.C. 101, the Applicant’s amendments are not persuasive.
Regarding prior art, in the previous office action the claims were found to be allowable. Because of the amendments and new claims, Examiner completed an updated prior art search. Claims 1, 21-25 are allowable.
The following is a statement of reasons for the indication of allowable subject matter:
“ A coordinated and optimized dispatching method for electric buses, comprising: Si, cleaning and preprocessing bus operation data, line data, and passenger flow data of electric buses in a road network, and further collecting passenger flow OD (origin and destination) data in the road network, based on integrated circuit (IC) card data; S2, designing expression forms of variables to establish a bi-level programming model; S3, establishing an upper-level model in the bi-level programming model based on the data in Si and the expression forms of the variables designed in S2, wherein the upper-level model is used to optimize a bus stop schedule plan to minimize service time of all buses and an operation energy consumption cost; S4, establishing a lower-level model in the bi-level programming model based on the data in Si and the expression forms of the variables designed in S2, wherein the lower-level model is used to optimize a bus departure interval, and regulate and a number of departures in a peak period to reduce a total waiting time of a passenger; S5, initializing algorithm parameters, and based on the bi-level programming model established in S3 and S4, designing a genetic algorithm to solve the model to finally acquire an optimal bus dispatching plan; and S6, acquiring an optimal bus departure interval and an optimal bus stop schedule plan from the optimal bus dispatching plan, and dispatching the electric buses in the road network based on the optimal bus departure interval and the optimal bus stop schedule plan; programming model established in S3 and S4, designing the genetic algorithm to solve the model to finally acquire the optimal bus dispatching plan comprises: a parameter initializing step: setting a maximum quantity pop of a population size and randomly generating individuals of the bus departure interval and the bus stop schedule plan, and then setting a maximum number max of generations and setting a generation counter to 1;an encoding and initial solving step: encoding variables departure interval and stop schedule plan and forming genes of chromosomes with random initial values; if the variables meet the constraint conditions, proceeding to a calculation and selection step; if the variables do not meet the constraint conditions, regenerating initial solutions; the calculation and selection step: calculating fitness values of all chromosomes; selecting chromosomes by roulette wheel selection; if a fitness of a current generation of chromosomes is higher than a fitness of a previous generation, maintaining the current generation of chromosomes as current optimal solutions; and if the fitness of the current generation of chromosomes is lower than the fitness of the previous generation, not selecting the current generation of chromosomes; a reproduction step: generating next generation of individuals by the current chromosomes through crossover and mutation behaviors; if each individual meets the constraint conditions, proceeding to an ending step; and if each individual does not meet the constraint conditions, reproducing new individuals; and the ending step: if a current number of generations is equal to max, ending circulation to obtain optimal solutions; and if the current number of generations does not reach max, returning to the calculation and selection step.”
Examiner considered prior art that is related to passenger flow, bus networking, genetic algorithm, chromosomes, and using bi-level programming, in light of the Applicant’s amendments. In previous actions, Examiner considered the combination of Lou, Fu, Zheng, Ming, Wang and Liu. In light of the amended claims, Examiner considered Yang and Cheng. See pertinent prior art list. The listed pertinent prior art that was considered by the Examiner are before the effective filing date; however, the specific ordered combined sequence of mathematical steps and variables used in the Applicant’s application cannot be found in the cited prior art, and can only be found as recited in Applicant’s Specification. Any combination of the cited references and/or additional references(s) to teach all the claim elements, including the features identified by Applicant that are not taught by the cited prior art, would be the result of impermissible hindsight reconstruction. Accordingly, any combination of Cheng, Lou, Fu, Zheng, Ming, Wang and Liu and/or any other additional reference(s) would be improper to teach the claimed invention. The claims 1, 21-25 are allowable.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1, 20-25 are process. Claims 2-19 are cancelled.
Claims 1, 20-25 are rejected under 35 U.S.C. 101 because the claimed invention is directed to judicial exception without significantly more.
The claim 1 recites:
PNG
media_image1.png
799
699
media_image1.png
Greyscale
PNG
media_image2.png
831
690
media_image2.png
Greyscale
PNG
media_image3.png
789
616
media_image3.png
Greyscale
These claims describe mathematical calculations. Specifically, the claims recite a method that includes bi-level programming, designing the genetic algorithm, solving steps, calculating fitness values, and calculating a bus dispatch plan. The pending claims are mathematical concepts at Step 2A prong one.
Furthermore, the claims recite the objective function of developing a bus dispatch plan. This is a commercial activity, and thus, the claims recite a certain method of organizing human activity.
The claims recite abstract concepts that are mathematical and certain methods of organizing human activity, therefore, the claims are directed to a judicial exception at step 2A prong one.
The claims do NOT recite additional elements. Therefore, the judicial exception is/are not integrated into a practical application under the second prong of Step 2A.
Step 2B, significantly more, analysis is not required.
Dependent claims 20-25 further narrow the abstract idea of independent claim 1. The claims 1, 20-25 are not patent eligible.
Since there are no limitations in these claims that transform the exception into a patent eligible application such that these claims amount to significantly more than the exception itself, claims 1, 20-25 are rejected under 35 U.S.C. 101 as being directed to non-statutory subject matter.
Conclusion
The prior art made of record and are considered pertinent to applicant's disclosure.
Yang (CN 108470444 A) discuss method based on genetic algorithm optimization and chromosomes.
Cheng (2019, A Bi-level Programming Model for Optimal Bus Stop Spacing of a Bus Rapid Transit System) discloses bi-level programming for optimal bus stop spacing, development of a mathematical model, and genetic algorithm.
Lou (CN 110119835A) discloses dynamic bus departure scheduling optimization and models’ flexibility to obtain the passenger total waiting time.
Fu (US 11615368 B) considers vehicle energy consumption and route assignments.
Zheng (CN 104504229 A) discloses intelligent bus dispatching method based on mixed heuristic algorithm and passenger wait and passenger get off.
Wei (2017, Bilevel programming model for multi-model regional bus timetable and vehicle dispatch).
Chen (CN 113743685 B) discloses travel time, traffic, bus departure, bus capacity, and travel route.
Wang (CN 114036749 B) discloses genetic algorithms, demand orders e.g., taxi scheduling, and electric consumption.
Liu (CN 111754039 A) discloses the number of times of transportation service that can be executed after the first time of charging or finishing charging for the operation bus, average departure frequency, passenger flow, total operations cost.
THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to THEA LABOGIN whose telephone number is (571)272-9149. The examiner can normally be reached Monday -Friday, 8am-5pm.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Patricia Munson can be reached at 571-270- 5396. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/THEA LABOGIN/Examiner, Art Unit 3624