A simulated annealing heuristic for the capacitated location routing problem

A simulated annealing heuristic for the capacitated location routing problem

0.00 Avg rating0 Votes
Article ID: iaor20101808
Volume: 58
Issue: 2
Start Page Number: 288
End Page Number: 299
Publication Date: Mar 2010
Journal: Computers and Industrial Engineering
Authors: , , ,
Keywords: heuristics
Abstract:

The location routing problem (LRP) is a relatively new research direction within location analysis that takes into account vehicle routing aspects. The goal of LRP is to solve a facility location problem and a vehicle routing problem simultaneously. We propose a simulated annealing (SA) based heuristic for solving the LRP. The proposed SALRP heuristic is tested on three sets of well-known benchmark instances and the results are compared with other heuristics in the literature. The computational study indicates that the proposed SALRP heuristic is competitive with other well-known algorithms.

Reviews

Required fields are marked *. Your email address will not be published.