## Abstract This article addresses the wellβknown Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of twoβdimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive
An efficient heuristic for the multi-item newsboy problem with a single constraint
β Scribed by Steven Nahmias; Charles P. Schmidt
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 493 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more efficient scheme that requires fewer computations. We provide calculations that compare and contrast four approximation techniques. In particular, we have discovered a method that yields a direct algebraic expression of the problem parameters for allocation and achieves an expected profit within 90% of the optimal in about 90% of the cases tested.
π SIMILAR VOLUMES
In the article, "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints" by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4-18), the last author's name was misspelled. Silvano Martello's name was inadvertently spell
Knowledge of fluid pressure is important to predict the presence of oil and gas in reservoirs. A mathematical model for the prediction of fluid pressures is given by a time-dependent diffusion equation. Application of the finite element method leads to a system of linear equations. A complication is