Developing heuristic algorithms for optimisation of location-allocation of fuel-distribution network

Jafar Bagherinejad and Maryam Mirzaei

International Journal of Industrial and Systems Engineering, 2018, vol. 28, issue 1, 99-116

Abstract: The aim of this paper is to determine the optimal locations for the construction of refuelling stations for vehicles in urban distribution networks including paths and intersections. The objective is to maximise the covered demands with certain number of facilities. For this purpose, mathematical modelling of location-allocation based on the maximal coverage is developed. Considering the service capacity constraint for refuelling stations is one of the innovations of this research. Changing the approach from the node-based to path-based for demands and facility location makes a new way to the location problems of this field. The proposed algorithms have been approved by solving a numerical example. The overall findings show that in the maximal covering of demands, the third heuristic algorithm is better than others based on the fewer number of determined stations.

Keywords: refuelling location model; heuristic algorithm; maximal covering; path-based approach; service capacity constraint. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=88562 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:28:y:2018:i:1:p:99-116

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().