TITLE

A Minimal Technology Routing System for Meals on Wheels

AUTHOR(S)
Bartholdi, III, John J.; Platzman, Loren K.; Collins, R. Lee; Warden, III, William H.
PUB. DATE
June 1983
SOURCE
Interfaces;Jun83, Vol. 13 Issue 3, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
A novel routing system based on a new travelling salesman heuristic was successfully implemented to handle the efficient daily routing of a varying number of vehicles to more than 200 delivery points whose locations change daily. The system had to be easily mantained by one person and require no re- sources (for example, no computer). Our system achieved these objectives, cost less than $50, and, moreover, shortened average travel times by 13% compared to previous performance.
ACCESSION #
6691618

 

Related Articles

  • BRIGHT SPARK.  // Caterer & Hotelkeeper;4/22/2004, Vol. 193 Issue 4320, p22 

    Focuses on The Pure Package, personalised eating plans delivered to a customer's door. Cost of the personalised meal; Taste of food included in the package.

  • A Heuristic for the Periodic Vehicle Routing Problem. Gaudioso, M.; Paletta, G. // Transportation Science;May92, Vol. 26 Issue 2, p86 

    The paper describes a model for the optimal management of periodic deliveries of a given commodity. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling and routing policies of the vehicles in order to minimize over the...

  • Breaking the time barrier. Gregerson, John // Food Processing (00156523);May2004 Supplement, Vol. 65, p6 

    Comments on home-delivered meals in the U.S. Preference of home-delivered meals by time-strapped consumers; Introduction of home food delivery service netwoks; Range of prices for delivered meals per day.

  • Heuristics for Join Processing Using Nonclustered Indexes. Omiecinski, Edward R. // IEEE Transactions on Software Engineering;Jan89, Vol. 15 Issue 1, p18 

    Finding efficient procedures for implementing relational database operations, such as the join, is an important database problem. In this paper, we examine join processing when the access paths available are nonclustered indexes on the joining attribute(s) for both relations involved in the...

  • A Two-Phase Optimization Algorithm For Mastermind. Shan-Tai Chen; Shun-Shii Lin; Li-Te Huang // Computer Journal;2007, Vol. 50 Issue 4, p435 

    This paper presents a systematic model, two-phase optimization algorithms (TPOA), for Mastermind. TPOA is not only able to efficiently obtain approximate results but also effectively discover results that are getting closer to the optima. This systematic approach could be regarded as a general...

  • Set-Up Coordination between Two Stages of a Supply Chain. Agnetis, A.; Detti, P.; Meloni, C.; Pacciarelli, D. // Annals of Operations Research;2001, Vol. 107 Issue 1-4, p15 

    In the material flow of a plant, parts are processed in batches, each having two distinct attributes, say shape and color. In one department, a set-up occurs every time the shape of the new batch is different from the previous one. In a downstream department, there is a set-up when the color of...

  • Planning Activities in a Network of Logistic Platforms with Shared Resources. Dell'Olmo, Paolo; Lulli, Guglielmo // Annals of Operations Research;Jul2004, Vol. 129 Issue 1-4, p155 

    This paper has been motivated by the study of a real application, the transshipment container terminal of Gioia Tauro in Italy. The activities in a container terminal concern with the movement of containers from/to mother vessels and feeders and with the handling and storage of containers in the...

  • HEURISTIC WAREHOUSE LOCATION--A CASE HISTORY USING A NEW METHOD. Drysdale, J. Keith; Sandiford, Peter J. // CORS Journal;Mar69, Vol. 7 Issue 1, p45 

    This method determines heuristically, for a prescribed distribution network of nodes (one of which is the source of the goods), those nodes which should have warehouses such that the total fixed and variable warehousing, transportation, and inventory costs are minimized. It also determines, for...

  • A Model and Algorithm for the Courier Delivery Problem with Uncertainty. Sungur, Ilgaz; Ren, Yingtao; Ordóñez, Fernando; Dessouky, Maged // Transportation Science;May2010, Vol. 44 Issue 2, p193 

    We consider the courier delivery problem (CDP), a variant of the vehicle routing problem with time windows (VRPTW) in which customers appear probabilistically and their service times are uncertain. We use scenario-based stochastic programming with recourse to model the uncertainty in customers...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics