𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for optimal shipments with given frequencies

✍ Scribed by M. G. Speranza; W. Ukovich

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
817 KB
Volume
43
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model-shown to be NP-hard-is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented.

πŸ“œ SIMILAR VOLUMES

An optimal migration algorithm for dynam
An optimal migration algorithm for dynamic load balancing
✍ HU, Y. F.; BLAKE, R. J.; EMERSON, D. R. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 2 views

The problem of redistributing the work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The relationship between this algorithm and some existing algorithms is discussed and the convergence of the new

An optimal algorithm for layered wheel f
An optimal algorithm for layered wheel floorplan designs
✍ Kulasinghe, Priyalal D.; Bettayeb, SaοΏ½d πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 2 views

In this paper, we present an efficient algorithm to solve the orientation optimization problem for a layered wheel floorplan. The strategy used is to generate all the nonredundant implementations for the floorplan. The computational complexities of the algorithm depend on the actual dimensions of th

An artificial beehive algorithm for cont
An artificial beehive algorithm for continuous optimization
✍ Mario A. MuΓ±oz; JesΓΊs A. LΓ³pez; Eduardo Caicedo πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

This paper presents an artificial beehive algorithm for optimization in continuous search spaces based on a model aimed at individual bee behavior. The algorithm defines a set of behavioral rules for each agent to determine what kind of actions must be carried out. Also, the algorithm proposed inclu