지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2012.11
- 수록면
- 939 - 952 (14page)
이용수
초록· 키워드
오류제보하기
The location routing problem with multi-compartment and multi-trip (LRPMCMT) is regarded as an important extension to the location routing problem (LRP). In this new problem, potential depots are used to deliver several types of products using a fleet of heterogeneous vehicles with several compartments. Each compartment has a limited capacity and is dedicated to a single type of product. Each vehicle is allowed to make more than one trip as long as it satisfies the maximum distance allowed within a workday. A mixed integer program is presented. A constructive heuristic and a hybrid genetic algorithm are also proposed. A local search and a packing algorithm are embedded into the algorithms to further improve the solutions. Numerical experiments are conducted on randomly generated instances. The proposed algorithms proved to be efficient when compared to the optimal solutions from the mixed integer program on small to medium size instances.
목차
Abstract
1. Introduction
2. Mathematical Model
3. A Constructive-Based Heuristic
4. Hybrid Genetic Algorithm
5. Computational Experiments
6. Conclusions and Suggestions
References
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-530-000999644