Fiber-to-object assignment heuristics

Article Abstract:

A series of heuristic algorithms were formulated which effectively address the fiber-to-object assignment problem. The algorithms, which were adapted into a post-optimization process, converge on a maximal solution. Experimental tests reveal that they are 10% better than previously used algorithms. They entail a computing time of about 15 minutes and can be utilized for other combinatorial optimization problems for which a simple greedy algorithm exists.

Operations Research, Analysis, Algorithms, Heuristic, Heuristics (Psychology)

---

Optimization models for quality and cost of modular software systems

Article Abstract:

A study was conducted to characterize a couple of optimization models that can be utilized to determine the best commercial off-the-shelf computer software for each module in the design of modular software systems. It was assumed that there was no cost in designing interface programs to link between modules. The weight assignment of the modules was supported by the Analytic Hierarchy Process based on the access frequency of the modules.

Information Systems & Theory, Evaluation, Software, Design and construction, Information systems

---

Similar abstracts:

• Abstracts: Robust optimization for performance tuning of modern database systems
• Abstracts: A two-echelon allocation model and the value of information under correlated forecasts and demands. Integrated multi-item production-inventory systems
• Abstracts: Relaxation heuristics for a generalized assignment problem. Eliminating redundant columns in continuous tour scheduling problems
• Abstracts: Return to vendor. Creating more value in a competitive market. Sowing the seeds of growth
• Abstracts: Textbooks on CD-ROM: multimedia in education is better for college students than for school tots. Pop culture on CD-ROM: shovelware

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