A novel genetic algorithm for the maximum coverage problem in the three-level supply chain network
by Omid Rahmani; Bahman Naderi; Mohammad Mohammadi; Mehrdad Nouri Koupaei
International Journal of Industrial and Systems Engineering (IJISE), Vol. 30, No. 2, 2018

Abstract: The maximum coverage problem is one of the most functional location issues. Nowadays, organisations are seeking to increase profits and one of the competitive advantages for organisations is efficient and effective designing of supply chain network. On the other hand, given the importance of distribution planning among the levels of supply chain, vehicle routing problem needs to be explored which leads to a significant reduction in costs of supply chain network. The purpose of this research is designing a supply chain network that includes the supply, distribution centres and retailers. It should be noted that the coverage radius is defined for all distribution centres and distribution centres gives any services to retailers that is within the actual coverage. Also, this service is done on routing. Since that the classical vehicle routing problem is NP-hard, to solve the problem in small and medium sizes, we used the GAMS software. Next, genetic algorithms and simulated annealing is used to solve the problem in large size. Finally, the results have been evaluated.

Online publication date: Tue, 25-Sep-2018

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