Capacitated location-routing problem with time windows under uncertainty

Zarandi, Mohammad Hossein Fazel, Hemmati, Ahmad, Davari, Soheil and Turksen, I. Burhan 2013. Capacitated location-routing problem with time windows under uncertainty. Knowledge-Based Systems 37 , pp. 480-489. 10.1016/j.knosys.2012.09.007

Full text not available from this repository.

Abstract

This paper puts forward a location-routing problem with time windows (LRPTW) under uncertainty. It has been assumed that demands of customers and travel times are fuzzy variables. A fuzzy chance constrained programming (CCP) model has been designed using credibility theory and a simulation-embedded simulated annealing (SA) algorithm is presented in order to solve the problem. To initialize solutions of SA, a heuristic method based on fuzzy c-means (FCM) clustering with Mahalanobis distance and sweep method have been employed. The numerical experiments clearly attest that the proposed solution approach is both effective and robust in solving problems with up to 100 demand nodes in reasonable times.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Elsevier
ISSN:	0950-7051
Last Modified:	20 Jul 2017 04:03
URI:	https://orca.cardiff.ac.uk/id/eprint/68529

Citation Data

Cited 75 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item