Adaptation of simulated annealing to an integrated municipal solid waste location-routing problem
by Hossein Asefi; Samsung Lim; Mojtaba Maghrebi
International Journal of Logistics Systems and Management (IJLSM), Vol. 28, No. 2, 2017

Abstract: This paper aims to propose an integrated municipal solid waste management network covering multiple types of wastes concurrently and utilise a location-routing problem framework to minimise the establishment cost of interrelated facilities (i.e., transfer stations; treatment, recycling and disposal centres) in the network and the transportation cost of wastes in the entire network. The defined problem consists of the concurrent site selection of the locations of the system's all facilities among the candidate locations and the determination of routes and amount of shipments among the selected facilities to minimise the total cost of transportation and facility establishment. As the addressed problem exhibits the non-deterministic polynomial-time hardness (NP-hardness), an adaptation of the simulated annealing algorithm is proposed in this paper. The experiment results, when compared with the exact solutions obtained by mixed-integer programming in terms of solution fitness and computing time, imply that the employed algorithm works effectively and efficiently.

Online publication date: Mon, 04-Sep-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 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