A Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm | ||
| Interdisciplinary Journal of Management Studies | ||
| مقاله 7، دوره 8، شماره 2، 2015، صفحه 287-313 اصل مقاله (581.78 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/ijms.2015.52635 | ||
| نویسندگان | ||
| Ehsan Yadegari* 1؛ Hesamaddin Najmi2؛ Morteza Ghomi-Avili3؛ Mostafa Zandieh1 | ||
| 1Faculty of Management and Accounting, Shahid Beheshti University, Tehran, Iran | ||
| 2Department of Industrial Engineering, University of Tehran, Iran | ||
| 3Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran | ||
| چکیده | ||
| Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to deal with such issues. The model integrates the network design decisions in both forward and backward logistics networks, and also applies three kinds of delivering modes (normal delivery, direct shipment, and direct delivery) which enrich the model to be able to deliver the products to customers by distribution-skipping the mid-process strategy in order to deliver products in more flexible paths to customer zones. To tackle with such an NP-hard problem, a memetic algorithm (MA) with random path-based direct representation and combinatorial local search methods is developed. Numerical experiments are conducted to demonstrate the significance and applicability of the model as well as the efficiency and accuracy of the proposed solution approach. | ||
| کلیدواژهها | ||
| Integrated supply chain؛ Logistics network design؛ Random path-based direct encoding؛ Memetic algorithm | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 3,908 تعداد دریافت فایل اصل مقاله: 2,708 |
||