A Study on the Taboo Search Algorithm for the Open Vehicle Routing Problem with Hard Time Windows

DOI

10.2991/iccasm.2012.104How to use a DOI?

Keywords

open vehicle routing problem, hard time windows, taboo search algorithm

Abstract

In this paper studying open vehicle routing problem, a taboo search algorithm for the open vehicle routing problem with hard time windows is proposed. After constructing a mathematical model for the problem, this paper focuses on the introduction of the design procedure of TS algorithm for solving the problem. In the searching process of this algorithm, infeasible solution is allowed by adding a penalizing factor, to reduce the probability of local optimal. The computational results are provided. It shows that in most of cases this algorithm can find better solutions.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shuxia Wang
AU  - Ying Xiong
AU  - Zengqiang Wang
PY  - 2012/08
DA  - 2012/08
TI  - A Study on the Taboo Search Algorithm for the Open Vehicle Routing Problem with Hard Time Windows
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 415
EP  - 418
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.104
DO  - 10.2991/iccasm.2012.104
ID  - Wang2012/08
ER  -