지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제10권 제1호
- 발행연도
- 2011.3
- 수록면
- 24 - 33 (10page)
이용수
초록· 키워드
오류제보하기
In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.
목차
Abstract
1. INTRODUCTION
2. PROBLEM DEFINITION AND MATHEMATICAL MODEL
3. PROPOSED HYRBID GENETIC ALGORITHM
4. COMPUTATIONAL RESULTS
5. CONCLUSION
ACKNOWLEDGMENT
REFERENCES
참고문헌 (35)
참고문헌 신청
Albareda-Sambola, M. / 2005 / A compact model and tight bounds for a combined location-routing problem / Computers and Operations Research 32:407~428
Angelelli Angelelli, E. / 2002 / The vehicle routing problem with time windows and simultaneous pick-up and delivery, In Quantitative Approaches to Distribution Logistics and Supply Chain Management / Springer-Verlag :249~267
Belenguer, J.-M. / 2006 / A Branch and Cut method for the Capacitated Location-Routing Problem / International Conference on Service Systems and Service Management :1541~1546
Berbeglia, G. / 2007 / Static pickup and delivery problems: a classification scheme and survey / TOP 15:1~31
Berger, R. T. / 2007 / Location-Routing Problems with Distance Constraints / Transportation Science 41:29~43
Angelelli Angelelli, E. / 2002 / The vehicle routing problem with time windows and simultaneous pick-up and delivery, In Quantitative Approaches to Distribution Logistics and Supply Chain Management / Springer-Verlag :249~267
Belenguer, J.-M. / 2006 / A Branch and Cut method for the Capacitated Location-Routing Problem / International Conference on Service Systems and Service Management :1541~1546
Berbeglia, G. / 2007 / Static pickup and delivery problems: a classification scheme and survey / TOP 15:1~31
Berger, R. T. / 2007 / Location-Routing Problems with Distance Constraints / Transportation Science 41:29~43
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003635921