<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">ast</journal-id><journal-title-group><journal-title xml:lang="ru">Архитектура, строительство, транспорт</journal-title><trans-title-group xml:lang="en"><trans-title>Architecture, Construction, Transport</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-232X</issn><issn pub-type="epub">2713-0770</issn><publisher><publisher-name>Industrial University of Tyumen</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.31660/2782-232X-2023-4-80-89</article-id><article-id custom-type="elpub" pub-id-type="custom">ast-61</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ТРАНСПОРТ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>TRANSPORT</subject></subj-group></article-categories><title-group><article-title>Распределение еженедельного рабочего времени водителей грузовых автомобилей в городской логистике</article-title><trans-title-group xml:lang="en"><trans-title>Distribution of weekly working hours of truck drivers in urban logistics</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Асенов</surname><given-names>А.</given-names></name><name name-style="western" xml:lang="en"><surname>Asenov</surname><given-names>A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Асенов Асен, д-р техн. наук, доцент, декан транспортного факультета</p></bio><bio xml:lang="en"><p>Asen Asenov, PhD, Associate Professor, Dean of the Faculty of Transport</p></bio><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Пенчева</surname><given-names>В.</given-names></name><name name-style="western" xml:lang="en"><surname>Pencheva</surname><given-names>V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Пенчева Велизара, д-р техн. наук., профессор кафедры транспорта</p></bio><bio xml:lang="en"><p>Velizara Pencheva, PhD, Professor at the Department of Transport</p></bio><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Георгиев</surname><given-names>И.</given-names></name><name name-style="western" xml:lang="en"><surname>Georgiev</surname><given-names>I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Георгиев Иван, доцент кафедры прикладной математики и статистики</p></bio><bio xml:lang="en"><p>Ivan Georgiev, Associate Professor at the Applied Mathematics and Statistics Department</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Русенский университет имени Ангела Кынчева</institution><country>Болгария</country></aff><aff xml:lang="en"><institution>"Angel Kanchev" University of Ruse</institution><country>Bulgaria</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>28</day><month>12</month><year>2023</year></pub-date><volume>0</volume><issue>4</issue><fpage>80</fpage><lpage>89</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Асенов А., Пенчева В., Георгиев И., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Асенов А., Пенчева В., Георгиев И.</copyright-holder><copyright-holder xml:lang="en">Asenov A., Pencheva V., Georgiev I.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://ast.tyuiu.ru/jour/article/view/61">https://ast.tyuiu.ru/jour/article/view/61</self-uri><abstract><p>Рассматриваются перевозки грузов небольшими партиями в городских условиях. Выявлено, что недельная нагрузка водителей грузовых автомобилей не всегда распределяется равномерно. Это становится причиной неудовлетворенности среди водителей, а также может привести к совершению ошибок или возникновению проблем со здоровьем. Для решения проблемы предлагается частично целочисленная нелинейная математическая модель. Ее применение позволяет сделать разницу между временем, затраченным водителем, проработавшим больше всех, и водителем, проработавшим меньше всех, минимальной, а нагрузку на водителей – равномерной. Предлагается два возможных варианта решения этой задачи (пример основан на реальной ситуации из практики). В первом случае это принцип ротации, при котором трое взаимозаменяемых рабочих в течение трех дней меняют виды работ. Во втором случае семь рабочих выполняют шесть видов работ в течение одной недели, при этом точно определено, кто из рабочих какой вид работ должен выполнять. В результате расчетов было найдено решение, при котором разница между минимальным и максимальным временем составляет 1.7 часа за пять рабочих дней (время работы варьируется от 33.7 до 35.4 ч). Здесь также может быть применен принцип ротации, чтобы рабочие были загружены равномерно. Эти варианты не исключают поиска других решений, удовлетворяющих поставленной задаче. </p></abstract><trans-abstract xml:lang="en"><p>The work deals with the transportation of cargo in small batches in an urban environment. It was found that the weekly workload of truck drivers is not always evenly distributed. This is a prerequisite for dissatisfaction among them, as well as a reason for making mistakes or the occurrence of health problems. A partial integer nonlinear mathematical model is proposed to solve the problem. The solution of the task allows the difference between the driver who has worked the longest and the one who has worked the least to be minimal and the workload of the drivers even. We offer two possible solutions of this task (the example is based on a real situation from practice). In the first case it is the rotation principle, when three interchangeable workers working three days on three different activities. In the second case, seven workers performing six activities in one week, it is precisely determined which worker must perform activities. As a result of the calculations, the option, where the difference between the minimum and maximum time is 1.7 hours for the five working days, because it varies from 33.7 hours to 35.4 hours. In this variant, the rotation principle can also be applied in order for workers to be loaded equally. These options do not exclude the search for other solutions satisfying the problem.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>водитель грузовика</kwd><kwd>нелинейная математическая модель</kwd><kwd>оптимизация перевозок</kwd></kwd-group><kwd-group xml:lang="en"><kwd>truck driver</kwd><kwd>nonlinear mathematical model</kwd><kwd>transport optimization</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование профинансировано Министерством образования и науки в рамках национальной научной программы «Интеллектуальное животноводство», соглашение о гранте № Д01-62/18.03.2021.</funding-statement><funding-statement xml:lang="en">The research leading to these results has received funding from the Ministry of education and science under the National science program "Intelligent animal husbandry", grant agreement No Д01-62/18.03.2021.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">United Nations. (2012). World Urbanization Prospects. The 2011 Revision. New York, 318 p. Availabe at: https://www.un.org/en/development/desa/population/publications/pdf/urbanization/WUP2011_Report.pdf (accessed 01.02.2022). (In English).</mixed-citation><mixed-citation xml:lang="en">United Nations. (2012). World Urbanization Prospects. The 2011 Revision. New York, 318 p. Availabe at: https://www.un.org/en/development/desa/population/publications/pdf/urbanization/WUP2011_Report.pdf (accessed 01.02.2022). (In English).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Hasle, G., Lie, K.-A., &amp; Quak, E. (2007). Geometric modelling, numerical simulation, and optimization: Applied Mathematics at SINTEF. Springer, 558 p. (In English). ISBN 978-3-540-68783-2.</mixed-citation><mixed-citation xml:lang="en">Hasle, G., Lie, K.-A., &amp; Quak, E. (2007). Geometric modelling, numerical simulation, and optimization: Applied Mathematics at SINTEF. Springer, 558 p. (In English). ISBN 978-3-540-68783-2.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Cirovic, G., Pamucar, D., &amp; Božanić, D. (2014). Green logistic vehicle routing problem: Routing light delivery vehicles in urban areas using a neuro-fuzzy model. Expert Systems with Applications, 41(9), 4245–4258 p. (In English). DOI 10.1016/j.eswa.2014.01.005.</mixed-citation><mixed-citation xml:lang="en">Cirovic, G., Pamucar, D., &amp; Božanić, D. (2014). Green logistic vehicle routing problem: Routing light delivery vehicles in urban areas using a neuro-fuzzy model. Expert Systems with Applications, 41(9), 4245–4258 p. (In English). DOI 10.1016/j.eswa.2014.01.005.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Cattaruzza, D., Absi, N., Feillet, D., &amp; Gonzalez-Feliu, J. (2017). Vehicle routing problems for city logistics. EURO Journal on Transportation and Logistics, 6(1), pp. 51-79. (In English). DOI 10.1007/s13676-014-0074-0.</mixed-citation><mixed-citation xml:lang="en">Cattaruzza, D., Absi, N., Feillet, D., &amp; Gonzalez-Feliu, J. (2017). Vehicle routing problems for city logistics. EURO Journal on Transportation and Logistics, 6(1), pp. 51-79. (In English). DOI 10.1007/s13676-014-0074-0.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Friswell, R., &amp; Williamson, A. (2019). Management of heavy truck driver queuing and waiting for loading and unloading at road transport customers’ depots. Safety Science, (120), pp. 194-205. (In English). DOI 10.1016/j. ssci.2019.06.039.</mixed-citation><mixed-citation xml:lang="en">Friswell, R., &amp; Williamson, A. (2019). Management of heavy truck driver queuing and waiting for loading and unloading at road transport customers’ depots. Safety Science, (120), pp. 194-205. (In English). DOI 10.1016/j. ssci.2019.06.039.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Friswell, R., &amp; Williamson, A. (2010). Work characteristics associated with injury among light/short-haul transport drivers. Accident Analysis &amp; Prevention, 42(6), pp. 2068-2074. (In English). DOI 10.1016/j.aap.2010.06.019.</mixed-citation><mixed-citation xml:lang="en">Friswell, R., &amp; Williamson, A. (2010). Work characteristics associated with injury among light/short-haul transport drivers. Accident Analysis &amp; Prevention, 42(6), pp. 2068-2074. (In English). DOI 10.1016/j.aap.2010.06.019.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Steinbakk, R. T., Ulleberg, P., Sagberg, F., &amp; Fostervold, K. I. (2017). Analysing the influence of visible roadwork activity on drivers’ speed choice at work zones using a video-based experiment. Transportation Research Part F: Traffic Psychology and Behaviour, 44, pp. 53-62. (In English). DOI 10.1016/j.trf.2016.10.003.</mixed-citation><mixed-citation xml:lang="en">Steinbakk, R. T., Ulleberg, P., Sagberg, F., &amp; Fostervold, K. I. (2017). Analysing the influence of visible roadwork activity on drivers’ speed choice at work zones using a video-based experiment. Transportation Research Part F: Traffic Psychology and Behaviour, 44, pp. 53-62. (In English). DOI 10.1016/j.trf.2016.10.003.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Gatta, V., Marcucci, E., Nigro, M., &amp; Serafini, S. (2019). Sustainable urban freight transport adopting public transport-based crowdshipping for B2C deliveries. European Transport Research Review, 11(1), 14 p. (In English). DOI 10.1186/s12544-019-0352-x.</mixed-citation><mixed-citation xml:lang="en">Gatta, V., Marcucci, E., Nigro, M., &amp; Serafini, S. (2019). Sustainable urban freight transport adopting public transport-based crowdshipping for B2C deliveries. European Transport Research Review, 11(1), 14 p. (In English). DOI 10.1186/s12544-019-0352-x.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Mak, Ho-Yin (2018). Peer-to-peer crowdshipping as an omnichannel retail strategy. Available at: https://www.readcube.com/articles/10.2139/ssrn.3119687. (In English). DOI 10.2139/ssrn.3119687.</mixed-citation><mixed-citation xml:lang="en">Mak, Ho-Yin (2018). Peer-to-peer crowdshipping as an omnichannel retail strategy. Available at: https://www.readcube.com/articles/10.2139/ssrn.3119687. (In English). DOI 10.2139/ssrn.3119687.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Simeonov, D., &amp; Pencheva, V. (2001). Interaction between modes of transport [Взаимодействие между видовете транспорт]. Ruse, Publ. Printing base of "Angel Kanchev" University of Ruse, 308 p. (In Bulgarian). ISBN 954-712145-6.</mixed-citation><mixed-citation xml:lang="en">Simeonov, D., &amp; Pencheva, V. (2001). Interaction between modes of transport [Взаимодействие между видовете транспорт]. Ruse, Publ. Printing base of "Angel Kanchev" University of Ruse, 308 p. (In Bulgarian). ISBN 954-712145-6.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Conn, A. R., Gould, N. I. M., &amp; Toint, Ph. L. (1991). A globally convergent augmented lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal on Numerical Analysis, 28(2), pp. 545572. DOI 10.1137/0728030.</mixed-citation><mixed-citation xml:lang="en">Conn, A. R., Gould, N. I. M., &amp; Toint, Ph. L. (1991). A globally convergent augmented lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal on Numerical Analysis, 28(2), pp. 545572. DOI 10.1137/0728030.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Conn, A. R., Gould, N., &amp; Toint, Ph. L. (1997). A globally convergent augmented lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Mathematics of Computation, 66(217), pp. 261-288. (In English). DOI 10.1090/S0025-5718-97-00777-1.</mixed-citation><mixed-citation xml:lang="en">Conn, A. R., Gould, N., &amp; Toint, Ph. L. (1997). A globally convergent augmented lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Mathematics of Computation, 66(217), pp. 261-288. (In English). DOI 10.1090/S0025-5718-97-00777-1.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Tonchev, J., &amp; Vitliemov, V. (2013). Optimization with MATLAB. Pragmatic approach [Оптимизация с MATLAB. Прагматичен подход]. Ruse, Publ. Printing base of "Angel Kanchev" University of Ruse, 250 p. (In Bulgarian). ISBN 978-954-712-593-3.</mixed-citation><mixed-citation xml:lang="en">Tonchev, J., &amp; Vitliemov, V. (2013). Optimization with MATLAB. Pragmatic approach [Оптимизация с MATLAB. Прагматичен подход]. Ruse, Publ. Printing base of "Angel Kanchev" University of Ruse, 250 p. (In Bulgarian). ISBN 978-954-712-593-3.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Dimov, I., &amp; Todorov, V. (2016). Error analysis of biased stochastic algorithms for the second kind fredholm integral equation. In: Margenov, S., Angelova, G., Agre, G. (eds.) Innovative Approaches and Solutions in Advanced Intelligent Systems. Studies in Computational Intelligence, Vol. 648. Publ. Springer, pp. 3-16. (In English). DOI 10.1007/978-3-319-32207-0.</mixed-citation><mixed-citation xml:lang="en">Dimov, I., &amp; Todorov, V. (2016). Error analysis of biased stochastic algorithms for the second kind fredholm integral equation. In: Margenov, S., Angelova, G., Agre, G. (eds.) Innovative Approaches and Solutions in Advanced Intelligent Systems. Studies in Computational Intelligence, Vol. 648. Publ. Springer, pp. 3-16. (In English). DOI 10.1007/978-3-319-32207-0.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Dimitrov, Yu., Miryanov, R., &amp; Todorov, V. (2018). Asymptotic expansions and approximations for the Caputo derivative. Computational and Applied Mathematics, 37(5), 5476-5499. (In English). DOI 10.1007/s40314-0180641-3.</mixed-citation><mixed-citation xml:lang="en">Dimitrov, Yu., Miryanov, R., &amp; Todorov, V. (2018). Asymptotic expansions and approximations for the Caputo derivative. Computational and Applied Mathematics, 37(5), 5476-5499. (In English). DOI 10.1007/s40314-0180641-3.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Pillay, N., &amp; Qu, R. (2018). Hyper-heuristics: theory and applications. Cham, Switzerland, Publ. Springer, 134 p. (In English). DOI 10.1007/978-3-319-96514-7.</mixed-citation><mixed-citation xml:lang="en">Pillay, N., &amp; Qu, R. (2018). Hyper-heuristics: theory and applications. Cham, Switzerland, Publ. Springer, 134 p. (In English). DOI 10.1007/978-3-319-96514-7.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Thampi, S. M., Piramuthu, S., Li, K., Berretti, S., Wozniak, M., &amp; Singh, D. (2021). Machine learning and metaheuristics algorithms, and applications second symposium, SoMMA 2020, Chennai, India, October 14-17. Revised Selected Papers, 256 p. (In English). DOI 10.1007/978-981-16-0419-5.</mixed-citation><mixed-citation xml:lang="en">Thampi, S. M., Piramuthu, S., Li, K., Berretti, S., Wozniak, M., &amp; Singh, D. (2021). Machine learning and metaheuristics algorithms, and applications second symposium, SoMMA 2020, Chennai, India, October 14-17. Revised Selected Papers, 256 p. (In English). DOI 10.1007/978-981-16-0419-5.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Web page of the Mathworks. Help for function ga. Availabe at: https://www.mathworks.com/help/gads/ga.html#mw_4a8bfdb9-7c4c-4302-8f47-d260b7a43e26 (accessed 01.02.2022). (In English).</mixed-citation><mixed-citation xml:lang="en">Web page of the Mathworks. Help for function ga. Availabe at: https://www.mathworks.com/help/gads/ga.html#mw_4a8bfdb9-7c4c-4302-8f47-d260b7a43e26 (accessed 01.02.2022). (In English).</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Goldberg, D. E. (1989). Genetic algorithms in search, optimization &amp; machine learning. Publ. Addison-Wesley publishing company, Inc., 412 p. (In English). ISBN: 9780201157673.</mixed-citation><mixed-citation xml:lang="en">Goldberg, D. E. (1989). Genetic algorithms in search, optimization &amp; machine learning. Publ. Addison-Wesley publishing company, Inc., 412 p. (In English). ISBN: 9780201157673.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Sivanandam, S. N., &amp; Deepa, S. N. (2008). Introduction to genetic algorithms. Berlin, Heidelberg, Publ. Springer, 442 p. (In English). DOI 10.1007/978-3-540-73190-0.</mixed-citation><mixed-citation xml:lang="en">Sivanandam, S. N., &amp; Deepa, S. N. (2008). Introduction to genetic algorithms. Berlin, Heidelberg, Publ. Springer, 442 p. (In English). DOI 10.1007/978-3-540-73190-0.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
