Open AccessModel Integer Linear Programming pada Optimisasi Distribusi Logistik di Daerah Bencana
Author(s) -
Miranti H. Kasim,
Ismail Djakaria,
Lailany Yahya
Publication year - 2022
Publication title -
research in the mathematical and natural sciences
Language(s) - English
Resource type - Journals
ISSN - 2828-6804
DOI - 10.55657/rmns.v1i1.3
Subject(s) - integer programming , linear programming , branch and price , operations research , integer (computer science) , point (geometry) , mathematical optimization , computer science , clothing , distribution (mathematics) , variable (mathematics) , mathematics , geography , operating system , mathematical analysis , geometry , archaeology
Logistics distribution in disaster-affected areas includes the delivery of relief goods (food, medicine, and clothing) using three types of vehicles with different carrying capacities for each vehicle. In distributing relief goods, unfulfilled requests can occur in disaster-affected areas. This problem can be modeled in the form of integer linear programming because there is a variable that must be an integer value to minimize unfulfilled demand for all types of relief goods at each point of demand. The branch and bound method can solve this problem's integer linear programming model. The next model is simulated using the LINGO 11.0 programming language. The simulation results show that the system can be considered feasible to use. Thus, the vehicle allocation is also obtained in each period with distribution costs from the point of supply to the point of demand. This distribution process lasts for four periods by showing a change in the number of unfulfilled requests. In the last period, there was no more unfulfilled demand for aid to obtain optimal results.