Developing heuristic algorithms for optimisation of location-allocation of fuel-distribution network
by Jafar Bagherinejad; Maryam Mirzaei
International Journal of Industrial and Systems Engineering (IJISE), Vol. 28, No. 1, 2018

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.

Online publication date: Tue, 12-Dec-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com