earticle

논문검색

Differential Evolution Algorithm for Constraint Joint Replenishment Problem with Indirect Grouping Strategy

원문정보

Li Chengyan, Gao Jun, Zhang Tianwei, Wang Xiaotian

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.8 No.5 2015.05 pp.259-266
피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

The joint replenishment problem with deterministic resource restriction is considered. We present a differential evolution (DE) algorithm that uses indirect grouping strategy to solve constrained joint replenishment. The procedure and structure of the DE algorithm is proposed. Extensive computational experiments are performed to compare the performances of the DE algorithm with results of genetic algorithm (GA) and heuristic algorithm CRAND. The experimental results indicate that the DE algorithm performs relative to CRAND and superior to GA.

목차

Abstract
 1. Introduction
 2. Mathematical Model of Constraint Joint Replenishment Problem
 3. Differential Evolution Algorithm
  3.1. Representation and Initialization
  3.2. Mutation
  3.3. Crossover
  3.4. Selection
  3.5. Elitist Procedure
  3.6. Stop Criterion
 4. Numerical Example
 5. Computational Experiments
 6. Conclusion
 Acknowledgements
 References

키워드

저자정보

  • Li Chengyan School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
  • Gao Jun School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
  • Zhang Tianwei School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
  • Wang Xiaotian School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.