2018
Time window selection for vehicle routing problem
Michael Katz, Vladimir Lipets, Michael Masin, Dany Moshkovich, Segev E Wasserkrug
US Patent App. 15/344,595
Real-time update of a mobile workforce schedule
Jonathan Bnayahu, Michael Katz, Vladimir Lipets, Michael Masin, Dany Moshkovich, Daniel C Selman, Segev E Wasserkrug
US Patent App. 15/286,577
2017
Reusable modeling for solving problems
Michael Katz, Vladimir Lipets, Michael Masin, Dany Moshkovich, Segev E Wasserkrug
US Patent App. 15/161,303
Abstract
A computer program product comprising a non-transitory computer readable storage medium retaining program instructions configured to cause a processor to perform actions, which program instructions implement: a framework for creating a model of an NP-hard problem, the model comprising at least one entity selected from the group comprising: an objective, a variable, an equation and a constraint, wherein the framework provides methods for automatically transforming the model, comprising: one or more methods for manipulating or changing a status of the entity of the model, the methods comprising a method for imposing or ignoring the constraint; and one or more methods related to operations to be applied to the entity of the model.
Decomposition of multisite heterogeneous workforce scheduling problems
Michael Katz, Vladimir Lipets, Michael Masin, Dany Moshkovich, Segev E Wasserkrug
US Patent App. 15/182,627
Abstract
A computer-implemented method, computerized apparatus and computer program product for decomposing multisite heterogeneous workforce scheduling problems. An instance of a multisite heterogeneous workforce scheduling problem comprising a set of work items and a set of technicians is obtained. A measure of likelihood that a pair of work items belong to the same sub-problem in a decomposition of the problem instance into a plurality of sub-problems, such that a union of solutions to the plurality of sub-problems is a solution to the problem, is calculated. The measure calculation comprises calculating one or more components indicating a relation between the pair of work items and technicians potentially scheduled to execute either of them. A solution to the problem is generated by solving the plurality of sub-problems in the decomposition obtained based on a partitioning of the set of work items induced by the measure and aggregating solutions to the plurality of sub-problems.
Method for assigning time windows for Vehicle Routing problem
Michael Katz, Vladimir Lipets, Michael Masin, Dany Moshkovich, Segev E Wasserkrug
US Patent App. 15/169,751
Abstract
A computer-implemented method, apparatus and computer program product, the method performed by a processor operatively connected to a memory, the method comprising: obtaining a schedule for handling service requests, the schedule planned offline in accordance with expected service requests for a service, the schedule comprising a number of service trips per time slot and per geographic location; receiving a service request, comprising a location in which the service is to be provided; automatically suggesting, during handling the service request, a time slot for providing the service from time slots available in the schedule for providing the service in the location; and upon acceptance of the time slot for providing the service, updating the schedule with the service being provided at the time slot.
Automatic solution to a scheduling problem
Michael Katz, Vladimir Lipets, Michael Masin, Dany Moshkovich, Segev E Wasserkrug
US Patent App. 15/006,133
Abstract
A method comprising obtaining a scheduling problem comprising: a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources. The method comprises automatically generating a plurality of alternative scheduling problems, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem and determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, whereby determining the solution.
Optimizing spatiotemporal computational problems
Bnayahu, Jonathan and Katz, Michael and Moshkovich, Dany
US Patent App. 14/849,718
Abstract
According to one embodiment, a method for solving a plurality of spatiotemporal planning problems. The method may include creating a domain model. The method may also include assigning a solution bound associated with the created domain model to infinity. The method may further include calculating a solution to the created domain model based on the assigned solution bound using at least one of a best-first search algorithm. The method may also include updating the assigned solution bound based on the calculated solution. The …
