Research the Incident Vehicle Routing Problem with Soft Time-windows (IVRP-STW). Associated logistics scheduling problem with soft time windows using the logistic function optimization method to improve the chaotic particle algorithm, compared with the GA and the standard PSO algorithm. Simulation results show that such optimization method can effectively improve the global search of the particles in the particle swarm and the ability of local search is effective in resolving such problems.
목차
Abstract 1. Introduction 2. Logistics Associated with Soft Time Windows Scheduling Problem Description and Mathematical Model 2.1. The Description of Logistics and Transport Scheduling Problems with Soft Time Windows 2.2. The Mathematical Model of Associated Scheduling Transportation Problem with Soft Time Window 3. Chaos Particle Swarm Optimization Algorithm of Logistics Scheduling Problem with Soft Time Window 3.1. Chaos PMO Algorithm Optimized by Logistic Function 3.2. Algorithm Process 4.Experiment Results and Analyze 5. Summary Acknowledgements Reference
키워드
Chaotic particle swarm optimization algorithmSoft time windowsScheduling problem
저자
Yuqiang Chen [ Department of Computer Engineering Dong Guan Polytechnic Dongguan, Guangdong, China ]
Jianlan Guo [ Department of Computer Engineering Dong Guan Polytechnic Dongguan, Guangdong, China ]
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.8 No.3