Logistics Applied to Improve Bottling Water Distribution

Programación matemática y software

Hoy en día la cuestión logística es muy importante dentro de las empresas en la medida algunas de ellas cuentan con departamentos exclusivamente dedicados a dicha área. Esto ha ido evolucionando con el tiempo, de modo que hoy es un aspecto fundamental de los negocios en la lucha por consolidarse o seguir siendo líderes en su campo. De acuerdo a lo anterior, sabemos que la logística puede ser dividida en diferentes clases, sin embargo, en este sentido nuestro estudio se basa en la distribución oportuna de los clientes con el menor costo, mayores ventas y mejor utilización del espacio resultando en un excelente servicio. Por último, se prepara un análisis comparativo de los resultados con respecto a otro método de optimización del espacio de soluciones.

American Journal of Applied Mathematics and Statistics, 2014

This study is focused on the Application of Transportation Algorithm with volume Discount on distribution cost using Nigerian Bottling Company Plc Owerri Plant. This paper is intended to determine the quantity of Fanta (in crates), Coke (in crates) and Sprite (also in crates) that the Company should distribute in a month in order to minimize transportation cost and maximize profit. A problem of this nature was identified as a Nonlinear Transportation Problem (NTP), formulated in mathematical terms and solved by the Karush-Kuhn-Tucker (KKT) optimality condition for the NTP. A statistical software package was used to obtain the initial basic feasible solution using the Least Cost Method. Thus, analysis revealed that the optimal solution that gave minimum achievable cost of supply was the supply of 5000 crates of Fanta and 6000 crates of the same product to Umuahia market zone and Afikpo respectively. 7000 crates of Coke, 9000 crates and 1000 crates of the same product should be supplied to Orlu, Mbaise, and Afikpo market zones respectively. 6000, and 5000 crates of Sprite should be allocated to Mbaise and Umuahia market zones respectively, at a total cost of N377, 000.

Classical search procedures by forward or backward reasoning are memory and time consuming because they are uninformed procedures that don't take into account domain knowledge. In this paper a heuristic solution is presented for the generalized water jugs problem, which finds the optimal solution linearly, with no additional memory requirements.

Studies in Informatics and Control, 2017

At each port of destination, some containers are unloaded from a vessel and stored in the terminal to be delivered to their customers. One of the strategies used to arrange the containers in a terminal is residence time strategy: based on their delivery deadlines, each incoming container being assigned to a priority class. The aim of this study is to determine a valid arrangement of incoming containers in a block (part) of the terminal, in the shortest amount of time, with higher priority containers located above lower priority ones. In this way, some of the main objectives of a container terminal may be achieved: avoiding further reshuffles (number of relocations) and reducing the vessel berthing time. We developed a genetic algorithm and its performance is evaluated against a random stacking strategy used as benchmark for the experiments, and through several sets of tests on control parameters. All the tests showed that, if a reliable estimation of the delivery time can be assigned to every incoming container, the proposed method may be a useful tool for container terminal operators.

International journal of computer applications, 2017

Space optimization is a common problem in packaging, including cargo space optimization. Cargo planning and loading is the most essential factor in transportation like railways, airlines , trucks and buses. It is the proper arrangement of goods, items or cargo into the available space of container. Due to improper arrangement of cargo and unavailability of proper optimization techniques the space gets wasted and damage of goods occurs in container. The proper arrangement and placement of the cargo is very difficult task today. To utilize the maximum occupancy of the container the optimization algorithms are required to design. So the paper presents the optimization models for different systems and various optimization techniques.

This paper deals with the resolution of combinatorial optimization problems, particularly those concerning the maritime transport scheduling. We are interested in the management platforms in a river port and more specifically in container organisation operations with a view to minimizing the number of container rehandlings. Subsequently, we rmeet customers' delivery deadlines and we reduce ship stoppage time In this paper, we propose a genetic algorithm to solve this problem and we present some experiments and results.

Computers & Industrial Engineering, 2009

In this paper, an efficient genetic algorithm (GA) is presented to solve an extended storage space allocation problem (SSAP) in a container terminal. The SSAP is defined as the temporary allocation of the inbound/outbound containers to the storage blocks at each time period with aim of balancing the workload between blocks in order to minimize the storage/retrieval times of containers. An extended version of a SSAP proposed in the literature is considered in this paper in which the type of container affects on making the decision on the allocation of containers to the blocks. In real-world cases, there are different types (as well as different sizes) of containers consisting of several different goods such as regular, empty and refrigerated containers. The extended SSAP is solved by an efficient GA for real-sized instances. Because of existing the several equality constraints in the extended model, the implementation of the GA in order to quick and facilitate achieve to the feasible solutions is one of the outstanding advantages of this paper. The performance of the extended model and proposed GA is verified by a number of numerical examples.

2018

Distribution is an important activity in any supply chain and the need to explore a smooth and cost-effective way of doing it is always welcome by any organization. This is the same in the brewery industry where a lot distribution is done to satisfy the ever-growing customer needs. Vehicle Routing Problem is a method that can be used to ensure the smooth and costeffective way of distribution and therefore, when the idea was presented to the GGBL logistics team, they welcomed the idea to find a way to improve the current operation of their ARTC team. The aim of this thesis was to find out the current cost and routing being used being used by the ARTC team. Also, the number of vehicles being used and a scientific way of improving their cost and travel time through VRP. In this thesis, we present the use of an Asymmetric Capacitated Vehicle Routing Problem with Pickup and Delivery(VRPPD), an Asymmetric Capacitated Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW) and a sweep algorithm using a sample of 25 customers. The results obtained from the data used suggested that a combination of optimal solutions from the VRPPDTW and VRPPD was the best among the rest. The results had to be combined because AMPL could not compute a result for the 25 customers, hence, the customers had to be divided between 17 key customers with VRPPDTW and 8 regular customers with VRPPD. This gave a travel time reduction of 5.97% and cost reduction of

Water, 2018

This research proposes a genetic algorithm that provides a solution to the problem of deficient distribution of drinking water via the current hydraulic network in the neighborhood “Fraccionamiento Real Montecasino” (FRM), in Huitzilac, Morelos, Mexico. The proposed solution is the addition of new elements to the FRM network. The new elements include storage tanks, pipes, and pressure-reducing valves. To evaluate the constraint satisfaction model of mass and energy conservation, the hydraulic EPANET solver (HES) is used with an optimization model to minimize the total cost of changes in the network (new pipes, tanks, and valves). A genetic algorithm was used to evaluate the optimization model. The analysis of the results obtained by the genetic algorithm for the FRM network shows that adequate and balanced pressures were obtained by means of small modifications to the existing network, which entailed minimal costs. Simulations were performed for an extended period, which means that ...

2024

The talk intends to offer a preliminary clarification regarding the topic of freedom in music, focusing more specifically on the case of musical works.