Rendezvous search on the line with bounded resources: expected time minimization

Article Abstract:

An improvement of the rendezvous search problem yielded an algorithm which optimizes the chance of meeting as well as reducing meeting time. The optimization was done on players constrained by conditions of bounded resources. Analysis of the model generated showed the problem to be the bounded resource version of the Linear Search Problem. The optimization was effected by the formulation of new lemmas.

Operations Research, Models, Usage, Game theory, Mathematical optimization, Optimization theory

---

A goal programming approach to group decision making based on multiplicative preference relations and fuzzy preference relations

Article Abstract:

Group decision making process in fuzzy preference relations and multiple preferences is presented by using goal programming approach.

Europe, Production Management, Methods, Goal setting, Decision-making, Group, Group decision making

---

Similar abstracts:

• Abstracts: Scatter search for the vehicle routing problem with time windows
• Abstracts: An approach for integrated scheduling and lot-sizing. Scheduling with controllable release dates and processing times: total completion time minimization
• Abstracts: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. Iterated local search for the quadratic assignment problem
• Abstracts: A tabu search Hooke and Jeeves algorithm for unconstrained optimization. A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization
• Abstracts: Fleet assignment and routing with schedule synchronization constraints. Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.