DELIVERY ROUTE OPTIMIZATIONMODEL
DOI:
https://doi.org/10.15381/idata.v8i1.6169Keywords:
Delivery mathematic model, Travel salesman problem, Interface with MS Excel, Rucksack problem.Abstract
The article proposes one model for the delivery problem. We decided to make a model of mathematic programming that can answer questions on how to realize the delivery of articles from one point named warehouse, to destiny places; looking to minimizing costs when translating or transporting goods or articles. The results obtained for the model, to fulfill an average demand of 80 boxes to deliver, require of 5 small lorries for an optimal delivery; it means only 5 routes or tours are needed to fulfill all delivery to customers.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2005 Eduardo Raffo Lecca, Edgar Ruiz Lizama
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the INDUSTRIAL DATA.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating the source of publication (the originator of the work, journal, volume, number and date).
