**Mark Sh. Levin**

*Trajectory Decision Making Framework *

The paper
addresses a general view to trajectory (route) decision making framework (i.e.,
designing a trajectory). The view is based on four-part morphological scheme:
(a) routing combinatorial problems (e.g., shortest path problem, minimum
spanning tree problems, TSP), (b) assessment scales (i.e., quantitative,
ordinal, poset-like), (c) graph/network based models as
“solving space” (e.g., k-partite graph), and (d) node/vertex models/types. The
following issues are considered: (i) structuring the
“design/solving space”, (ii) problem statement, (iii) heuristics. A realistic
university student trajectory problem (route from BS degree to PostDoc position) is examined.

**КЛЮЧЕВЫЕ**** СЛОВА****:** decision
making, combinatorial optimization, routing, trajectory design, heuristic,
student trajectory