A Heuristic Based Approach to Solve a Capacitated Location-routing Problem

Abbas Jokar, Rashed Sahraeian

Abstract


In this paper we define a new approach to solve the location routing problem (LRP). LRP is a relatively new research direction within location analysis that takes into account vehicle routing aspects. In this research it is proposed a new heuristic method base on simulated annealing to solve a capacitated location routing problem. At first an initial solution is produced by a greedy approach and then encoding this initial solution to use in optimization language and finally apply neighborhood search method to improve the initial solution. Finally, to verify the quality of our new approach in term of solution quality, one well-known data problem set is selected. The numerical examples show the efficiency of our approach.


Full Text: PDF DOI: 10.5539/jms.v2n2p219

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Management and Sustainability   ISSN 1925-4725 (Print)   ISSN 1925-4733 (Online)

 

Copyright © Canadian Center of Science and Education

 

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.