Optimal expansion of capacitated transshipment networks

Article Abstract:

A solution to the problem of allocating a given budget to increase the capacities of arcs in a transshipment network to minimize the cost of flow in the network is presented. The capacity expansion costs of arcs are assumed to behave in a piecewise linear convex manner. The characteristics of the optimum solution is used to transform the problem into a parametric network flow problem and the principle of optimum basis structure is employed to consider piecewise linear convex functions without introducing additional arcs.

Usage, Simplex method, Simplexes (Mathematics), Parameter estimation

---

Unconstrained Quadatric Bivalent Programming Problem

Article Abstract:

A branch and prone algorithm is promulated to decrease the unconstrained quadatic action of zero-one factors and essential conditions for its existence are analyzed. The algorithm can furnish every local focus of minimization. The algorithm is illustrated with numerical examples. Tables of the minimum, maximum and average amount of local solution data are included. Heuristics founded on the printing test methodology may be the best approach to the solution of large problems.

Research, Management science, Analysis, Europe, Computer programming, Artificial intelligence, Operations Research

---

A stochastic and dynamic model for the single-vehicle pick-up and delivery problem

Article Abstract:

A model for the Dynamic Pick-up and Delivery Problem was analyzed for both unit-capacity service vehicle and multiple-capacity service vehicle. The analysis for unit-capacity system in heavy traffic conditions resulted in the development of three routing policies, the Sectoring Policy, the Nearest Neighbor Policy and the Stacker Crane Policy. The 'Dual Travelling Salesman' Policy was also developed for multi-capacity vehicle during heavy traffic conditions.

Transit and Ground Passenger Transportation, Local and Suburban Transportation, Van & Light Truck Operation, Motor vehicle driving, Freight, Delivery of goods, Deliveries (Transportation)

Similar abstracts:

• Abstracts: The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems. An LP-based approach to a two-stage cutting stock problem
• Abstracts: Reshaping of Japan creates opportunities. Investors find value in Japan's "emerging market."(Column) ... No, mergers and acquisitions count more
• Abstracts: Death and the era of safety first. A lifetime's work made legible. Luder looks to a new future despite problems of the past
• Abstracts: Approximating the noninferior set in multiobjective linear programming problems. An interactive method for the optimal selection problem with two decision makers
• Abstracts: Project selection with discounted returns and multiple constraints. Stock cutting to minimize cutting length

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