인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 저널정보
- 한국정보통신학회 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING 2019 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING Vo.11 No.1
- 발행연도
- 2019.6
- 수록면
- 249 - 253 (5page)
이용수
초록· 키워드
Combinatorial optimization is a problem of finding discrete feasible solutions and its best solution for all feasible solutions. The Travelling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) are the common problems of combinatorial optimization. In VRP, we need to find the optimal set of routes for a vehicle to traverse in order to deliver to a given set of customers. VRP generalises TSP (multi-TSP) and the objective of the VRP is to minimize the total route cost. Many approaches and algorithms proposed by researchers nowdays. In this paper, we propose an Artificial Immune System"s algorithm as a promising new VRP algorithm. We use the Clonal Selection Algorithm (CSA) which is an immuneinspired algorithm based on Clonal Selection Principle. This approach is implemented and tested on various dataset of waste transportation In Northern Bandung, West Java, Indonesia. The preliminary results are promising and lead to believe that the Clonal Selection Algorithm is a viable approximation heuristic for the VRP.
#Vehicle Routing Problem
#VRP
#Optimization Problem
#Combinatorial Problem
#Artificial Immune System
#Clonal Selection Algorithm
#Immune-Inspired Algorithm
#Bio-inpired Algorithms
상세정보 수정요청해당 페이지 내 제목·저자·목차·페이지정보가 잘못된 경우 알려주세요!
목차
- Abstract
- I. INTRODUCTION
- II. SYSTEM MODEL AND METHODS
- III. RESULT
- IV. DISCUSSION AND CONCLUSIONS
- REFERENCES
참고문헌
참고문헌 신청최근 본 자료
UCI(KEPA) : I410-ECN-0101-2019-004-000919461
