Moohong Kang, Sung-Kwan Kim, Joe T. Felan, Hyung Rim Choi, Minje Cho
언어
영어(ENG)
URL
https://www.earticle.net/Article/A249681
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
영어
The School Bus Routing Problem (SBRP) covers the issue of establishing plans to efficiently transport students distributed across a designated area to the relevant schools using defined resources. As with the similar Vehicle Routing Problem (VRP), the SBRP may have diverse constraints such as heterogeneous vehicles, the allotted time window and multiple depots. Many solutions for effectively solving the problem are currently being studied. By their nature, these routing problems are NP-Hard (non-deterministic polynomial-time hard) problems in which the search domains increase exponentially as they become larger, thus making it difficult to obtain solutions using an exact approach except for relatively simple and localized problems. Therefore the heuristic approach is being studied in many regions. In this study, an algorithm was developed using genetic algorithms, which stem from meta-heuristic algorithms, and the algorithm was tested against diverse problems to identify its performance and practicality.
목차
Abstract 1. Introduction 2. Related Studies 3. Definition of the Problem 4. Development of a Bus Stop Selection Algorithm 5. Development of a Bus Routing and Scheduling Algorithm 5.1. Chromosome Presentation 5.2. Objective Function 5.3. Initial Solution Generation 5.4. Crossover Operator 5.5. Mutation Operator 5.6. Repair Process of Solutions 5.7. Selection Method and Elitism 5.8. Performance Evaluation 6. Conclusion References
키워드
School Bus Routing ProblemGenetic AlgorithmHeuristic Algorithm
저자
Moohong Kang [ Port Research Division, Korea Maritime Institute ]
Sung-Kwan Kim [ Dept. of Management, University of Arkansas at Little Rock ]
Joe T. Felan [ Dept. of Management, University of Arkansas at Little Rock ]
Hyung Rim Choi [ Dept. of Management Information System, Dong-A University ]
Minje Cho [ Dept. of Management Information System, Dong-A University ]
보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Software Engineering and Its Applications
간기
월간
pISSN
1738-9984
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.9 No.5