منابع مشابه
A Simultaneous Search Problem 1
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y ∈ [0, 1] with as little uncertainty as possible, using some given number k of probes. Each probe is specified by a real number r ∈ [0, 1]. After a probe at r , we are told whether x ≤ r or x ≥ r , and whether y ≤ r or y ≥ r . We derive the optimal s...
متن کاملSimultaneous Search Simultaneous Search *
We introduce and solve a new class of “downward-recursive” static portfolio choice problems. An individual simultaneously chooses among ranked stochastic options, and each choice is costly. In the motivational application, just one may be exercised from those that succeed. This often emerges in practice, such as when a student applies to many colleges. We show that a greedy algorithm finds the ...
متن کاملSimultaneous Search∗
We introduce and solve a new class of static portfolio choice problems, where only the best realized alternative matters. A decision maker must simultaneously choose among independent ranked options, and the better alternatives have a lower chance of panning out. Each choice is costly, and just one option may be exercised. This often emerges in practice: • A student must make a costly and simul...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2000
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s004539910012