Estimation and determination of shortest path length in a road network with obstacles

Article Abstract:

The obstacles in the Swiss road network are characterized to enhance the lower bound on the measure used to approximate the shortest path length between two towns or cities, the Euclidean distance. Two applications of the lower bound are also demonstrated. The first pertains to distance estimation while the second involves the Dijkstra algorithm. Both cases yielded better numerical results than previous numerical analyses.

Operations research, Management science, Traffic engineering, Regression analysis

---

A generalized linear programming model for nurse scheduling

Article Abstract:

A generalized 0-1 linear programming model was employed to address a complex nurse scheduling problem. The model utilizes column generation and branch-and-bound to produce numerous solutions to particular coverage and collective agreement constraints. Unlike a heuristic method, the generalized programming model is capable of adapting to changes in the scheduling environment.

Offices of All Other Miscellaneous Health Practitioners, Offices of health practitioners, not elsewhere classified, Nurses, Models, Network analysis (Planning), Linear programming, Scheduling (Management)

---

Ambulance location and relocation models

Article Abstract:

Details of deterministic models and probabilistic models with relation to ambulance location and relocation are presented.

Canada, Motor vehicles and car bodies, France, Organizational history, Motor Vehicle Body Manufacturing, Ambulances, Usage, Mathematical models, Location

Similar abstracts:

• Abstracts: Compatibility and competition on airlines: demand side network effects. Entry preventing locations under incomplete information
• Abstracts: A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network. A new structural mechanism for reducibility of stochastic PERT networks

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