메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Ayi Purbasari (Universitas Pasundan) Handoko Supeno (Universitas Pasundan) Achmad Nizar Hidayanto (Universitas Indonesia)
저널정보
한국정보통신학회 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING 2019 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING Vo.11 No.1
발행연도
2019.6
수록면
249 - 253 (5page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
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.

목차

Abstract
I. INTRODUCTION
II. SYSTEM MODEL AND METHODS
III. RESULT
IV. DISCUSSION AND CONCLUSIONS
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2019-004-000919461