A Decision Model for Location-Routing Problem with Distance Consideration

  • Joni Mulyasri, Opim Salim Sitompul, Sutarman, Syahril Efendi

Abstract

In a logistic delivery system, it is essential to determine optimally the sites of facilities that will give outcome not only the valuable for a company but also the needs to serve customers suitably. Commonly, this location-routing decision problem is to reduce the total operating costs by choosing a subset of candidate facilities and creating a set of delivery routes that meet some conditions. In this paper there would be non-accessed route in the constraint. We develop an integer programming model to illustrate the problem. A better feasible neighbourhood search is tackled for solving the model. 

Published
2020-06-01
How to Cite
Joni Mulyasri, Opim Salim Sitompul, Sutarman, Syahril Efendi. (2020). A Decision Model for Location-Routing Problem with Distance Consideration. International Journal of Advanced Science and Technology, 29(08), 1120 - 1126. Retrieved from https://sersc.org/journals/index.php/IJAST/article/view/19803
Section
Articles