Options
Introducing Algorithm Portfolios to a Class of Vehicle Routing and Scheduling Problem
Conference
Proceedings of the 2nd International Conference on Operations and Supply Chain Management
Publisher(s)
University of the Thai Chamber of Commerce
Date Issued
2007
Author(s)
Abstract
The paper presents a comprehensive foundation and implementation of Algorithm Portfolios to solve Theater Distribution Vehicle Routing and Scheduling Problems (TDVRSP). In order to evaluate the performance of proposed approach, it has been applied to varying dimensions of theater distribution problem. In particular, eight random search metaheuristics embedded in four processors, packed to form different portfolios. Four basic algorithms- Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS) and Artificial Immune System (AIS), as well as their group theoretic counterparts have been utilized. The proposed approach also takes care of platform dependence and helps evolving a robust solution pack. The portfolio concept is shown to be computationally advantageous and qualitatively competitive over the benchmark set of problems. The paper does not only provide modeling to TDVRSP, but also aids in developing a generic solution framework for other problems of its kind.
Subject(s)
Access Rights
public
Rights
This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
Rights Holder(s)
University of the Thai Chamber of Commerce
Bibliographic Citation
Nagesh Shukla, Yogesh Dashora, M. K. Tiwari, F. T. S. Chan, T. C. Wong (2007) Introducing Algorithm Portfolios to a Class of Vehicle Routing and Scheduling Problem.
File(s)
