Article Abstract:
The vehicle routing problem is considered, emphasizing the fixed route problem type. Routes are designed for delivery vehicles with known capacities, known customer location, and known demand. The fixed routes modeled have daily repetition. The problem is redefined to allow infeasible routes on certain days. Three heuristic solution methods are considered: reduction in a single day problem, an adapted savings algorithm, and an adapter r-optimal algorithm. An adapted algorithm is programmed. Computational results are given.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
Two heuristic methods are developed to deal with allocation and scheduling in the United States Air Force. The resources are planes and crews. Factors involve sequence, starting times and manner in which the tasks are to be performed. The Two-Phase method fixes a sequence of missions for each plane before finding the schedule. The One-Phase method fixes the sequence of operations simultaneously with the simulation of the entire process. Tables and figures are given. An appendix presents data from Brooks Air Force Base.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
Mathematical programming problems with maximization of a concave, separable, piecewise linear objective function subject to linear constraints are of special interest in production planning. They are usually worked with a simpler algorithm. Improvements to this procedure are developed using special structural features of the problems. Special ordered sets control pivoting operations. Tables and a graph are given.
User Contributions:
Comment about this article or add new information about this topic: