International Business Machines Corporation

Donna Leigh Gresh

Olivier Verscheure

Adi Ionel Botea

Eric P Bouillet

Michele Berlingerio

Francesco Calabrese

Lea A Deleris

Yehuda Naveh

Daniel Patrick Connors

Yossi Richter

Embodiments of the disclosure include a method for journey planning including receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

Hedging risk in journey planning

Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

A computer-implemented method for resource management includes storing in a memory a set of resource consumers, resources for allocation to the resource consumers, and initial binary constraints applying to the allocation of the resources. Respective variables are associated with the resource consumers, and the resources are identified as values applicable to the variables. A non-binary scoring criterion is applied to generate scores on a graded scale for proposed assignments of one or more of the resources to respective ones of the resource consumers. One or more additional binary constraints are defined based on the graded scale of the scores. An assignment is found of the values to the variables that satisfies the initial and additional binary constraints using a constraint satisfaction problem (CSP) solver running on a processor that is coupled to the memory. The resources are assigned to the resource consumers responsively to the assignment of the values to the variables.

Extending constraint satisfaction problem solving

Growing community of inventors

Cortlandt Manor, NY, United States of America

Donna Leigh Gresh