Cost optimal allocation or rail passenger lines

Article Abstract:

An alternative approach that takes operating cost factors into account was transformed into a mathematical programming model that maximizes on lines, line types, routes, frequencies and train lengths. A Branch and Bound method was used to handle the problem and the solution procedure was employed to a part of the Dutch railway network. The approach, which realized the importance of reduction in costs, can also be utilized to generate a cost optimal line system and to identify the costs of an existing line system.

Integer programming, Time perspective

---

A translated renewal model with cost optimization applications

Article Abstract:

A study makes an optimization analysis to examine cost accumulation in industries such as insurance. The dynamic behavior of the systems is examined.

Greece, Forecasts, trends, outlooks, Forecasts and trends, Market trend/market analysis, Cost behavior

---

Enriched workflow modelling and stochastic branch-and-bound

Article Abstract:

Discrete optimization of workflow systems to enhance modelling and evaluation techniques, using Stochastic Branch-and-Bound, is analyzed.

Austria, Stochastic processes, Workflow software

Similar abstracts:

• Abstracts: Estimation and determination of shortest path length in a road network with obstacles. Ambulance location and relocation models
• Abstracts: Tool allocation and machining conditions optimization for CNC machines. Scheduling with tool changes to minimize total completion time: basic results and SPT performance
• Abstracts: Solving the combinatorial double auction problem. Fluid dynamics models and their applications in transportation and pricing
• Abstracts: Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• Abstracts: A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints

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