Publisher of Iranian Journals and Conference Proceedings

Please waite ..
Publisher of Iranian Journals and Conference Proceedings
Login |Register |Help |عضویت کتابخانه ها
Paper
Title

An augmented sweep clustering method for inventory-routing problem with simultaneous pickup and delivery considering lateral transshipment between repair centers

Year: 1398
COI: JR_IJIEPR-31-1_007
Language: EnglishView: 99
This Paper With 14 Page And PDF Format Ready To Download

Buy and Download

با استفاده از پرداخت اینترنتی بسیار سریع و ساده می توانید اصل این Paper را که دارای 14 صفحه است به صورت فایل PDF در اختیار داشته باشید.
آدرس ایمیل خود را در کادر زیر وارد نمایید:

Authors

Vahid Babaveisi - PhD student, School of Industrial Engineering, Iran University of Science & Technology
Farnaz Barzinpour - Associate Professor, School of Industrial Engineering, Iran University of Science & Technology
Ebrahim Teimoury - Associate Professor, School of Industrial Engineering, Iran University of Science & Technology

Abstract:

In this paper, an inventory-routing problem for a network of appliance repair service is discussed including several repair depots and customers. The customer in this network makes a demand to have his/her faulty appliance repaired. Then, the repairman is assigned to the demand based on the skill needed for repairing of appliance differing for each one. The assigned repairman picks up the faulty appliance from the customer place using the vehicle for transferring faulty appliances to repair depot. The vehicle for picking up and delivering the appliances has a maximum capacity. Additionally, the repair depot needs spare parts to repair the faulty appliances that is supplied either by the supplier or lateral transshipment from the other depots. The capacitated vehicle inventory-routing problem with simultaneous pickup and delivery is NP-hard which needs special optimization procedure. Regarding the skill of repairman, it becomes more complex. Many solution approaches have been provided so far which have their pros and cons to deal with. In this study, an augmented angle-based sweep method is developed to cluster nodes for solving the problem. Finally, the heuristic is used in the main body of genetic algorithm with special representation.

Keywords:

Vehicle Routing problem , Heuristic , Appliance repair service network , Genetic algorithm

Paper COI Code

This Paper COI Code is JR_IJIEPR-31-1_007. Also You can use the following address to link to this article. This link is permanent and is used as an article registration confirmation in the Civilica reference:

https://civilica.com/doc/1159201/

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:
Babaveisi, Vahid and Barzinpour, Farnaz and Teimoury, Ebrahim,1398,An augmented sweep clustering method for inventory-routing problem with simultaneous pickup and delivery considering lateral transshipment between repair centers,https://civilica.com/doc/1159201

Research Info Management

Certificate | Report | من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:

اطلاعات استنادی این Paper را به نرم افزارهای مدیریت اطلاعات علمی و استنادی ارسال نمایید و در تحقیقات خود از آن استفاده نمایید.

Scientometrics

The specifications of the publisher center of this Paper are as follows:
Type of center: دانشگاه دولتی
Paper count: 24,081
In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.

Share this page

More information about COI

COI stands for "CIVILICA Object Identifier". COI is the unique code assigned to articles of Iranian conferences and journals when indexing on the CIVILICA citation database.

The COI is the national code of documents indexed in CIVILICA and is a unique and permanent code. it can always be cited and tracked and assumed as registration confirmation ID.

Support