Tabu Search Variants for the Mix Fleet Vehicle Routing Problem

Wassan, Niaz A., Osman, Ibrahim H. (2002) Tabu Search Variants for the Mix Fleet Vehicle Routing Problem. Journal of the Operational Research Society, 53 (7). pp. 768-782. ISSN 0160-5682. (doi:10.1057/palgrave.jors.2601344) (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:10022)

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.
Official URL http://dx.doi.org/10.1057/palgrave.jors.2601344

Abstract

This paper develops several algorithms based on different variants of tabu search strategy and introduces a new escape diversification mechanism for the reactive tabu search method that proved highly sucessful in producing best results in the literature.

Item Type:	Article
DOI/Identification number:	10.1057/palgrave.jors.2601344
Subjects:	Q Science > Operations Research - Theory
Divisions:	Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User:	Niaz Wassan
Date Deposited:	18 Oct 2008 01:23 UTC
Last Modified:	16 Nov 2021 09:48 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/10022 (The current URI for this page, for reference purposes)
Wassan, Niaz A.:	https://orcid.org/0000-0003-0153-7646

Depositors only (login required):

Altmetric