TRANSPORT

Across

6. Flow of data supporting logistics decisions
8. Hypothesis that people maintain roughly constant daily travel time
9. Complexity class with no known polynomial-time solution
10. Combined measure of travel time, cost and other attributes used in choice models
12. Capacitated plant location problem
13. Location model allowing facilities anywhere in space
15. State where no traveller can reduce travel time by changing route unilaterally
16. Assignment where flows and travel times vary over time
19. Assumption that travellers have perfect information
20. Step that loads trips onto the transport network
21. Maximum flow a link or facility can handle
24. Assignment that minimises total system travel time
25. Public transport assignment based on service frequencies
27. Time spent waiting for public transport vehicles
28. Situation where adding a link increases congestion
31. Demand responsive transport service
32. Trip type such as work or education that is difficult to reschedule
35. Matrix of shortest-path travel times or costs between zones
36. Discrete choice model based on exponential utilities
38. Set of nodes and links used for transport modelling
40. Iterative algorithm for finding the weighted geometric median
41. Binary optimisation problem selecting items under a capacity constraint
44. Algorithm for finding shortest paths in a network
46. Problem selecting minimum facilities to cover all demand points
47. Model describing traveller decision-making behaviour
48. Step allocating trips between origins and destinations
50. Cost independent of flow or activity level
54. Metaheuristic allowing acceptance of worse solutions to escape local optima
55. Widely used congestion function in road traffic assignment
59. Function describing decreasing trip likelihood with increasing cost or distance
60. Expected return from a state–action pair
61. Function relating link travel time to traffic flow
62. Problem of assigning agents to tasks at minimum total cost
63. Decision problem of where to locate depots or service centres

Down

1. Algorithm for solving integer programs by partitioning the solution space
2. Matrix representing trips from each origin zone to each destination zone
3. Logistics flow handling returns and recycling
4. Distribution of trips across transport modes
5. Fixed line and schedule public transport system
7. Optimisation problem with integer decision variables
11. Branch-and-bound pruning when constraints cannot be satisfied
14. ILP version where integrality constraints are removed
17. PT assignment assuming passengers board first arriving attractive service
18. Parameter controlling acceptance probability in simulated annealing
22. Adaptive large neighbourhood search metaheuristic
23. Decision of when to travel to reduce congestion or delay
26. Branch-and-bound pruning using objective value limits
29. Measure of customer satisfaction or accessibility
30. Step estimating number of trips produced and attracted
31. Location model choosing from predefined candidate sites
33. Assignment approach accounting for randomness in route choice
34. Physical movement of goods in a supply chain
37. Decision-making framework based on states, actions and transitions
39. Learning framework using agent, state, action and reward
42. Assignment method where all demand uses shortest paths with fixed travel times
43. Classic transport modelling framework with generation, distribution, mode choice and assignment
45. Structure containing shortest paths from one origin to all nodes
49. Location model minimising distance with a fixed number of facilities
51. Variable neighbourhood search method
52. Expected cumulative reward from a state
53. Choice option where passenger rejects offered services
56. Smallest convex set containing all integer feasible solutions
57. Cost that varies with transported quantity or activity
58. Numerical representation of attractiveness of an alternative