Factoring in vehicle capacity in multi-nomenclature EOQ-models

Author(s):  
Victoria Gerami ◽  
Ivan Shidlovskiy
Keyword(s):  
2020 ◽  
pp. 77-90
Author(s):  
V.D. Gerami ◽  
I.G. Shidlovskii

The article presents a special modification of the EOQ formula and its application to the accounting of the cargo capacity factor for the relevant procedures for optimizing deliveries when renting storage facilities. The specified development will allow managers to take into account the following process specifics in the format of a simulated supply chain when managing inventory. First of all, it will allow considering the most important factor of cargo capacity when optimizing stocks. Moreover, this formula will make it possible to find the optimal strategy for the supply of goods if, also, it is necessary to take into account the combined effect of several factors necessary for practice, which will undoubtedly affect decision-making procedures. Here we are talking about the need for additional consideration of the following essential attributes of the simulated cash flow of the supply chain: 1) time value of money; 2) deferral of payment of the cost of the order; 3) pre-agreed allowable delays in the receipt of revenue from goods sold. Developed analysis and optimization procedures have been implemented to models of this type that are interesting and important for a business. This — inventory management systems, the format of which is related to the special concept of efficient supply. We are talking about models where the presence of the specified delays for the outgoing cash flows allows you to pay for the order and the corresponding costs of the supply chain from the corresponding revenue on the re-order interval. Accordingly, the necessary and sufficient conditions are established based on which managers will be able to identify models of the specified type. The purpose of the article is to draw the attention of managers to real opportunities to improve the efficiency of inventory management systems by taking into account these factors for a simulated supply chain.


Author(s):  
Evgen Kush ◽  
Andrii Galkin ◽  
Vitaliy Voronko ◽  
Denis Ponkratov ◽  
Serhii Ostashevskyi ◽  
...  

2021 ◽  
Vol 10 ◽  
pp. 100398
Author(s):  
Camille Kamga ◽  
Rodrigue Tchamna ◽  
Patricio Vicuna ◽  
Sandeep Mudigonda ◽  
Bahman Moghimi

1974 ◽  
Vol 11 (01) ◽  
pp. 145-158 ◽  
Author(s):  
Michael A. Crane

We consider a transportation system consisting of a linear network of N + 1 terminals served by S vehicles of fixed capacity. Customers arrive stochastically at terminal i, 1 ≦ i ≦ N, seeking transportation to some terminal j, 0 ≦ j ≦ i − 1, and are served as empty units of vehicle capacity become available at i. The vehicle fleet is partitioned into N service groups, with vehicles in the ith group stopping at terminals i, i − 1,···,0. Travel times between terminals and idle times at terminals are stochastic and are independent of the customer arrival processes. Functional central limit theorems are proved for random functions induced by processes of interest, including customer queue size processes. The results are of most interest in cases where the system is unstable. This occurs whenever, at some terminal, the rate of customer arrivals is at least as great as the rate at which vehicle capacity is made available.


2021 ◽  
Vol 64 (11) ◽  
pp. 121-129
Author(s):  
Alexandru Cristian ◽  
Luke Marshall ◽  
Mihai Negrea ◽  
Flavius Stoichescu ◽  
Peiwei Cao ◽  
...  

In this paper, we describe multi-itinerary optimization (MIO)---a novel Bing Maps service that automates the process of building itineraries for multiple agents while optimizing their routes to minimize travel time or distance. MIO can be used by organizations with a fleet of vehicles and drivers, mobile salesforce, or a team of personnel in the field, to maximize workforce efficiency. It supports a variety of constraints, such as service time windows, duration, priority, pickup and delivery dependencies, and vehicle capacity. MIO also considers traffic conditions between locations, resulting in algorithmic challenges at multiple levels (e.g., calculating time-dependent travel-time distance matrices at scale and scheduling services for multiple agents). To support an end-to-end cloud service with turnaround times of a few seconds, our algorithm design targets a sweet spot between accuracy and performance. Toward that end, we build a scalable approach based on the ALNS metaheuristic. Our experiments show that accounting for traffic significantly improves solution quality: MIO finds efficient routes that avoid late arrivals, whereas traffic-agnostic approaches result in a 15% increase in the combined travel time and the lateness of an arrival. Furthermore, our approach generates itineraries with substantially higher quality than a cutting-edge heuristic (LKH), with faster running times for large instances.


Sign in / Sign up

Export Citation Format

Share Document