METHOD AND APPARATUS FOR ROUTE PLANNING

The technology disclosed relates to a method for demand-response scheduling that resolves the most undesirable issues intrinsic to the paradigm of the prior art, namely constructing schedules by "Trip by Trip Insertion" onto service vehicles called routes. These issues are classified into...

Full description

Saved in:
Bibliographic Details
Main Author Ho, William P.C
Format Patent
LanguageEnglish
French
German
Published 23.09.2020
Subjects
CONTROLLING
PHYSICS
REGULATING
SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
Online AccessGet full text

Cover

More Information
Summary:The technology disclosed relates to a method for demand-response scheduling that resolves the most undesirable issues intrinsic to the paradigm of the prior art, namely constructing schedules by "Trip by Trip Insertion" onto service vehicles called routes. These issues are classified into Customer Service, On-time Performance, and Efficiency categories. The first step of the 2-step process is to globally build packets to patterns in a library that provide good Customer Service, On-time Performance protection, and Positive Ridesharing Efficiency. The packets are "Mini-Manifests" that meet all constraints, and once formed, are locked from modification by any subsequent scheduling action. The second step is to globally build routes by chaining packets together, controlled by configurable heuristic strategy. The routes that are built directly resolve the undesirable issues.
Bibliography:Application Number: EP20190735856