Reference Hub3
Solving the Mixed Backhauling Vehicle Routing: Problem with Ants

Solving the Mixed Backhauling Vehicle Routing: Problem with Ants

Niaz A. Wassan, Said Salhi, Gábor Nagy, Naveed Wassan, Anne C. Wade
Copyright: © 2013 |Volume: 2 |Issue: 2 |Pages: 16
ISSN: 2160-9500|EISSN: 2160-9543|EISBN13: 9781466633070|DOI: 10.4018/ijeoe.2013040105
Cite Article Cite Article

MLA

Wassan, Niaz A., et al. "Solving the Mixed Backhauling Vehicle Routing: Problem with Ants." IJEOE vol.2, no.2 2013: pp.62-77. http://doi.org/10.4018/ijeoe.2013040105

APA

Wassan, N. A., Salhi, S., Nagy, G., Wassan, N., & Wade, A. C. (2013). Solving the Mixed Backhauling Vehicle Routing: Problem with Ants. International Journal of Energy Optimization and Engineering (IJEOE), 2(2), 62-77. http://doi.org/10.4018/ijeoe.2013040105

Chicago

Wassan, Niaz A., et al. "Solving the Mixed Backhauling Vehicle Routing: Problem with Ants," International Journal of Energy Optimization and Engineering (IJEOE) 2, no.2: 62-77. http://doi.org/10.4018/ijeoe.2013040105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The mixed vehicle routing problem with backhauls is investigated using ant system heuristic. This distribution problem seems to suffer from a lack of published work even though it has immense practical applicability especially within logistic systems. Some enhancements to the basic ant system algorithm are embedded into the search. In particular a focus is on the choice in the placement of ants, the use of site-dependent candidate list, the introduction of a look ahead-based visibility, and appropriate strategies for updating local and global trails. Encouraging computational results are reported when tested on benchmark data sets.

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.