NEW ALGORITHM FOR OPTIMAL DISTRIBUTION DISTANCE CALCULATION

Authors

  • Petr Nachtigall

Keywords:

algorithm, distribution, combined transport

Abstract

The paper describes new design of algorithm for optimal distribution distance calculation. Goods vehicle is accounted as a constant, which is hired for a lump sum and whose rate per kilometre depends on distribution distance and time of manipulations.

 

Downloads

Download data is not yet available.

References

[1] WIGAN, M., CLARKE, R. Transport and Surveillance Aspects of Location-Based
Services. TRANSPORTATION RESEARCH RECORD. 2009, 2105.
[2] TAKANO, K., ARAI, M. A genetic algorithm for the hub-and-spoke problem applied to
containerized cargo transport. JOURNAL OF MARINE SCIENCE AND TECHNOLOGY.
červen, 2009, Vol. 2, 14.
[3] FRANK A TILLMAN, THOMAS M. CAIN. An upperbound algorithm for the single and
multiple terminal delivery problem. Management science. 1972, Vol. 11, 18.
[4] FRANK, H. A note on a graph theoretic game of Hakimi's. Opperations Research. 1967,
Vol. 3, 15.
[5] GHOSEIRI, KEIVAN, GHANNADPOUR, SEYED FARID. A hybrid genetic algorithm
for multi-depot homogenous locomotive assignment with time windows. Applied soft
computing. 2010, Vol. 1, 10.
[6] SADJADI, S. J., JAFARI, M., AMINI, T. A new mathematical modeling and a genetic
algorithm search for milk run problem (an auto industry supply chain case study).
International Journal of Advanced Manufacturing Technology. 2009, Vols. 1-2, 44.
[7] VOLEK, JOSEF. Operační výzkum I. Pardubice : Dopravní fakulta Jana Pernera, 2002.
ISBN 80-7194-410-6.

Published

2010-04-19

How to Cite

Nachtigall, P. (2010). NEW ALGORITHM FOR OPTIMAL DISTRIBUTION DISTANCE CALCULATION. Perner’s Contacts, 5(1), 186–198. Retrieved from https://pernerscontacts.upce.cz/index.php/perner/article/view/954

Issue

Section

Articles