The one-period bus touring problem: solved by an effective heuristic for the orienteering tour problem and improvement algorithm

Article Abstract:

Research is presented concerning the use of an effective heuristic for the optimization of bus-tour routes for the tourist industry. Eleven bus touring problems are analyzed and discussed.

Research, Linear programming, Usage, Heuristic programming, Bus travel

---

On estimating the common point of intersection of curves

Article Abstract:

An aparametric approximation method is proposed for estimating the point of intersection of antagonistic curves.

Curves, Curves (Geometry)

---

Explicit results for a class of asset-selling problems

Article Abstract:

An explicit formulae for n identical assets which are to be sold, one by one to coming bidders were more efficient in sensitivity analysis to the parameters, in comprehending the origin of the problem and in optimization. If the discount on revenues is exponential, if the bid arrivals are controlled by a renewal process in time, and if the bids may take on only two values, then the problem markedly simplifies and precise expressions for the controls and for the problem value functions are achievable.

Asset Sale Accounting, Analysis, Management, Pricing, Assets (Accounting), Dynamic programming

Similar abstracts:

• Abstracts: Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects
• Abstracts: Using objective values to start multiple objective linear programming algorithms. A study of simple rules for subcontracting in make-to-order manufacturing
• Abstracts: On the flexibility of constraint programming models: from single to multiple time windows for the traveling salesman problem
• Abstracts: The infinite horizon non-stationary stochastic inventory problem: near myopic policies and weak ergodicity. The infinite horizon non-stationary stochastic multi-echelon inventory problem and near-myopic policies
• Abstracts: A model to optimize project resource allocation by construction of a balanced histogram. Sensitivity analysis of scheduling algorithms

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