Reference Hub2
Metaheuristic Approaches for Vehicle Routing Problems

Metaheuristic Approaches for Vehicle Routing Problems

M. Saravanan, K.A.Sundararaman
Copyright: © 2013 |Volume: 6 |Issue: 2 |Pages: 16
ISSN: 1935-5726|EISSN: 1935-5734|EISBN13: 9781466633032|DOI: 10.4018/jisscm.2013040102
Cite Article Cite Article

MLA

Saravanan, M., and K.A.Sundararaman. "Metaheuristic Approaches for Vehicle Routing Problems." IJISSCM vol.6, no.2 2013: pp.17-32. http://doi.org/10.4018/jisscm.2013040102

APA

Saravanan, M. & K.A.Sundararaman. (2013). Metaheuristic Approaches for Vehicle Routing Problems. International Journal of Information Systems and Supply Chain Management (IJISSCM), 6(2), 17-32. http://doi.org/10.4018/jisscm.2013040102

Chicago

Saravanan, M., and K.A.Sundararaman. "Metaheuristic Approaches for Vehicle Routing Problems," International Journal of Information Systems and Supply Chain Management (IJISSCM) 6, no.2: 17-32. http://doi.org/10.4018/jisscm.2013040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most researchers concentrate on using meta-heuristics for solving real-life problems. In this paper, heuristic methods based on Ant Colony Optimization and Simulated Annealing algorithms are developed and search strategies are investigated. Computational results are reported on randomly generated problems. These methods significantly improve in minimizing the total distances travelled by the vehicles.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.