A bi-objective green location-routing model and solving problem using a hybrid metaheuristic algorithm
by Fatemeh Faraji; Behrouz Afshar-Nadjafi
International Journal of Logistics Systems and Management (IJLSM), Vol. 30, No. 3, 2018

Abstract: In the field of operations research, vehicle routing problems (VRP) have a great deal of importance because of its applications in transportation of goods and services. Until now many studies have been done about VRP, but there are few studies which have considered environmental perspective towards the problem. Besides, most of the bygone studies usually have considered only one objective which is minimisation of total travelling cost. In this paper, we try to tackle some flaws of the previous works in the proposed models for green routing problems by considering multiple depots, constraints of hard and soft time windows, heterogeneous vehicles, multiple periods and products. Since the aforementioned problem is considered to be NP-hard, metaheuristic algorithms are needed for solving it. Therefore, to tackle NP-hardness of the proposed model a combined algorithm of genetics algorithms (GA) and simulated annealing (SA) algorithms is proposed. Finally, for demonstrating the efficiency of the proposed algorithm, the solutions provided by the algorithm is compared to the solutions obtained from exact solving method in Gams software. The results demonstrate the efficiency of the proposed method.

Online publication date: Tue, 26-Jun-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 Logistics Systems and Management (IJLSM):
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