Abstract:
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.
Citation:
E. M. Bronshtein, R. V. Gindullin, “Exact solutions of some optimization problems of transport logistics”, Mat. Model., 25:11 (2013), 121–127; Math. Models Comput. Simul., 6:3 (2014), 332–336
This publication is cited in the following 2 articles:
Marharyta Lyshenko, Alvina Oriekhova, Larysa Polyatykina, Lyudmyla Khromushyna, Vitalii Poliatykin, “MATHEMATICAL APPROACH TO THE FORMATION OF A METHODOLOGICAL BASIS OF ECONOMIC RATIONALITY OF INTERACTION OF ELEMENTS OF THE SYSTEM OF LOGISTICS MANAGEMENT IN AGRICULTURE”, FKDPTP, 3:50 (2023), 185
Remondino M., Zanin A., “Logistics and Agri-Food: Digitization to Increase Competitive Advantage and Sustainability. Literature Review and the Case of Italy”, Sustainability, 14:2 (2022), 787