Abstract
An essential element of the newspaper logistics system is the allocation and routing of vehicles for the purpose of delivering newspapers on a daily basis. In this paper, the author presents various vehicle routing problems. Formulations defining the mathematical models are discussed in conjunction with several widely-used heuristic solution techniques. The focus is on providing a unified framework for these very difficult combinatorial programming problems.

This publication has 0 references indexed in Scilit: