Geodesic
Exact solutions of some optimization problems of transport logistics
Matematičeskoe modelirovanie, Tome 25 (2013) no. 11, pp. 121-127 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of constructing of the shortest cyclic route for delivery of homogeneous cargo from producers to consumers using vehicle with given capacity is considered. Formalizations in the boolean quadratic and integer linear programming are offered. Comparative analysis of efficiency of three exact algorithms is made. The problem of finding minimum tolerable vehicle capacity is considered as auxiliary. The relation between length of optimal route and vehicle capacity is empirically analyzed.
Keywords: routing, cycle, integer linear programming, quadratic Boolean programming. 
@article{MM_2013_25_11_a9,
     author = {E. M. Bronshtein and R. V. Gindullin},
     title = {Exact solutions of some optimization problems of transport logistics},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {121--127},
     year = {2013},
     volume = {25},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2013_25_11_a9/}
}
TY  - JOUR
AU  - E. M. Bronshtein
AU  - R. V. Gindullin
TI  - Exact solutions of some optimization problems of transport logistics
JO  - Matematičeskoe modelirovanie
PY  - 2013
SP  - 121
EP  - 127
VL  - 25
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/MM_2013_25_11_a9/
LA  - ru
ID  - MM_2013_25_11_a9
ER  - 
%0 Journal Article
%A E. M. Bronshtein
%A R. V. Gindullin
%T Exact solutions of some optimization problems of transport logistics
%J Matematičeskoe modelirovanie
%D 2013
%P 121-127
%V 25
%N 11
%U http://geodesic.mathdoc.fr/item/MM_2013_25_11_a9/
%G ru
%F MM_2013_25_11_a9
E. M. Bronshtein; R. V. Gindullin. Exact solutions of some optimization problems of transport logistics. Matematičeskoe modelirovanie, Tome 25 (2013) no. 11, pp. 121-127. http://geodesic.mathdoc.fr/item/MM_2013_25_11_a9/

[1] Dantzig G. B., Ramser J. H., “The Truck Dispatching Problem”, Management Science, 6:1 (1959), 80–91 | DOI | MR | Zbl

[2] Bronshtein E. M., Gindullin R. V., “Ob odnom klasse zadach marshrutizatsii”, Matematicheskoe modelirovanie, 23:6 (2011), 123–132

[3] Gavish B., “A note on the formulation of the m-salesman traveling salesman problem”, Management Science, 22:6 (1976), 704–705 | DOI | MR | Zbl

[4] Diaby M., “The salesman traveling problem: a linear programming formulation”, WSEAS Transactions on Mathematics, 6:6 (2007), 745–754 | MR | Zbl