The vehicle routing problem with time window (VRPTW) is a well-known combinatorial optimization problem, which is to find the lowest-cost routes from a central depot to a set of geographically scattered points with various demands. This paper deals with a multi-objective variant of the VRPTW that simultaneously minimizes the number of the vehicles and the traveled distance. A metaheuristic based on simulated annealing was proposed, and the concept of archive was introduced, in order to provide a set of tradeoff solutions for the problem. The accuracy of solutions is defined as their proximity to the best known solution of Solomon’s benchmarking tests. Computational results demonstrate that the proposed approach is quite effective, as it provides solutions competitive with the best known in the literature.
목차
Abstract 1. Introduction 2. Literature Review 3. The AMOSA Algorithm for VRPTW 3.1. Parameter Setting 3.2. The Main AMOSA Process 4. Experimental Results 5. Concluding Remarks References
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.9 No.12