Algorithms for a multi-level network optimization problem

Article Abstract:

A mathematical programming formulation was developed to solve a multi-level network optimization problem that involves the aspects of discrete facility location, topological network design and network dimensioning. The proposed formulation utilizes a branch-and-bound algorithm derived from Lagrangean relaxation lower bounds. Computation experiments show that the proposed approach is effective for certain sized problem instances but inefficient with exponential worst case time complexity.

Usage, Optimization theory, Branch and bound algorithms, Mathematical programming

---

Further results on the probabilistic traveling salesman problem

Article Abstract:

Theoretical and computational solutions to the probabilistic traveling salesman problem (PTSP) introduced by P. Jaillet were developed. Near-optimal solutions were derived for Euclidean PTSPs using the space-filling curve heuristic and the iterative improvement algorithms. The study was made to test the robustness of optimal solutions to deterministic problems under modified conditions.

Innovations, Traveling-salesman problem

---

Multi-objective tabu search using a multinomial probability mass function

Article Abstract:

A tabu-search method for solving multi-objective combinatorial optimization problems is presented.

United States, Analysis

Similar abstracts:

• Abstracts: New rules for a new world: privatization of the Czech cement industry
• Abstracts: Containment of a single polygon using mathematical programming. Hierarchical mathematical programming for operational planning in a process industry
• Abstracts: Multiobjective transportation network design and routing problems: taxonomy and annotation. Enterprise resource planning: a taxonomy of critical factors

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