|
Tai Nguyen So - Vietnam National University, Ha Noi - VNU >
TRƯỜNG ĐẠI HỌC CÔNG NGHỆ >
PTN Micro Nano >
Articles of Universities of Vietnam from Scopus >
Search
|
Please use this identifier to cite or link to this item:
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/12748
|
| Title: | Combining constraint programming and Tabu search to solve vehicle routing problem with time windows |
| Authors: | Quoc N.H.B.
Anh D.T. |
| Keywords: | |
| Issue Date: | 2010 |
| Publisher: | 2010 IEEE-RIVF International Conference on Computing and Communication Technologies: Research, Innovation and Vision for the Future, RIVF 2010 |
| Citation: | Volume , Issue , Page - |
| Abstract: | This paper presents a new two-stage approach to solve Vehicle Routing Problem with Time Windows. The first stage aims to minimize the number of routes and the second stage is to minimize the travel distance. The approach is also based on a combination of Tabu search method and constraint programming technology. The main idea is to apply the power of constraint propagation in constraint programming to reduce the computational cost when Tabu search needs to scan the whole neighborhood to find the best non-tabu moves at each iteration. ©2010 IEEE. |
| URI: | http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/12748 |
| ISSN: | |
| Appears in Collections: | Articles of Universities of Vietnam from Scopus
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
