METHOD FOR ROUTE OPTIMIZATION FOR DEMAND RESPONSIVE TRANSPORTATION
First Claim
1. A method for automatically allocating a plurality of available vehicles to a plurality of original service lines and virtual service lines of a transportation network, the method comprising:
- receiving the virtual lines from a virtual line generator;
approximating a constrained fleet allocation problem with an unconstrained fleet allocation problem that utilizes penalty terms to penalize violation of constraints;
performing a multi-start sequential genetic search using a first population to identify a first solution;
generating, using the first solution, a second population;
performing a second multi-start genetic search using the second population to identify a second solution; and
dispatching vehicles to different routes and lines according to the second solution.
5 Assignments
0 Petitions
Accused Products
Abstract
A method for automatically allocating a plurality of available vehicles to a plurality of original service lines and virtual service lines of a transportation network includes receiving the virtual lines from a virtual line generator; approximating a constrained fleet allocation problem with an unconstrained fleet allocation problem that utilizes penalty terms to penalize violation of constraints; performing a multi-start sequential genetic search using a first population to identify a first solution; generating, using the first solution, a second population; performing a second multi-start genetic search using the second population to identify a second solution; and dispatching vehicles to different routes and lines according to the second solution.
-
Citations
15 Claims
-
1. A method for automatically allocating a plurality of available vehicles to a plurality of original service lines and virtual service lines of a transportation network, the method comprising:
-
receiving the virtual lines from a virtual line generator; approximating a constrained fleet allocation problem with an unconstrained fleet allocation problem that utilizes penalty terms to penalize violation of constraints; performing a multi-start sequential genetic search using a first population to identify a first solution; generating, using the first solution, a second population; performing a second multi-start genetic search using the second population to identify a second solution; and dispatching vehicles to different routes and lines according to the second solution. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A fleet dispatcher for automatically allocating a plurality of available vehicles to a plurality of original service lines and virtual service lines of a transportation network, the system comprising:
a processor configured to execute processor-executable instructions stored at a processor-readable memory for; receiving the virtual service lines; approximating a constrained fleet allocation problem with an unconstrained fleet allocation problem that utilizes penalty terms to penalize violation of constraints; performing a multi-start sequential genetic search using a first population to identify a first solution; generating, using the first solution, a second population; performing a second multi-start genetic search using the second population to identify a second solution; and dispatching vehicles to different routes and lines according to the second solution.
Specification