A simulation framework for real-time management and control of inventory routing decisions
Proceedings of the 38th conference on Winter simulation
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
Transportation Science
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
Journal of Heuristics
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics
Randomized Local Search for Real-Life Inventory Routing
Transportation Science
The biobjective inventory routing problem: problem solution and decision support
INOC'11 Proceedings of the 5th international conference on Network optimization
Find-and-Fetch Search on a Tree
Operations Research
| Hi-index | 0.00 |
The rendezvous search problem is the problem of finding optimal search strategies for two people who are placed randomly on a known search region and want to meet each other in minimal expected time. We focus on initial location distributions that are centrally symmetric and nonincreasing as one moves away from the center, including the discretized and/or truncated Gaussian densities. When the search region is a discrete or a continuous interval, and the interval is labeled so that the searchers know their own location at all times, we prove that the optimal strategy for both searchers is to go directly to the center and wait there. The same result also holds for rendezvous search on the infinite line.