Skip to main content

Solving the mixed VRP with backhauling using ants

Wassan, Niaz A., Salhi, Said, Nagy, Gábor (2009) Solving the mixed VRP with backhauling using ants. AIP Conference Proceedings, 1159 . pp. 248-253. ISSN 0094-243X. (doi:10.1063/1.3223937) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:37777)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1063/1.3223937

Abstract

The mixed vehicle routing problem with backhauls is investigated using an 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 a 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.

Item Type: Article
DOI/Identification number: 10.1063/1.3223937
Uncontrolled keywords: Ant system metaheuristic, Mixed backhauling, Vehicle scheduling
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 10 Jan 2014 10:31 UTC
Last Modified: 08 Feb 2020 04:05 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37777 (The current URI for this page, for reference purposes)
Wassan, Niaz A.: https://orcid.org/0000-0003-0153-7646
Salhi, Said: https://orcid.org/0000-0002-3384-5240
Nagy, Gábor: https://orcid.org/0000-0002-7609-5718
  • Depositors only (login required):