Publisher of Iranian Journals and Conference Proceedings

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

A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version

مجله هوش مصنوعی و داده کاوی، دوره: 7، شماره: 1
Year: 1398
COI: JR_JADM-7-1_015
Language: EnglishView: 301
This Paper With 11 Page And PDF Format Ready To Download

Buy and Download

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

Authors

M. YousefiKhoshbakht - Department of Mathematics, Faculty of Sciences, Bu-Ali Sina University, Hamedan, Iran
N. Mahmoodi Darani - Hashtgerd Branch, Islamic Azad University, Karag, Iran

Abstract:

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all the customers, and between each pair of customers. In the OVRP against to VRP, vehicles are not required to return to the depot after completing service. Because VRP and OVRP belong to NP-hard Problems, an efficient hybrid elite ant system called EACO is proposed for solving them in the paper. In this algorithm, a modified tabu search (TS), a new state transition rule and a modified pheromone updating rule are used for more improving solutions. These modifications lead that the proposed algorithm does not trapped at the local optimum and discovers different parts of the solution space. Computational results on fourteen standard benchmark instances for VRP and OVRP show that EACO finds the best known solutions for most of the instances and is comparable in terms of solutions quality to the best performing published metaheuristics in the literature.

Keywords:

Paper COI Code

This Paper COI Code is JR_JADM-7-1_015. 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/894081/

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:
YousefiKhoshbakht, M. and Mahmoodi Darani, N.,1398,A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version,https://civilica.com/doc/894081

Research Info Management

Certificate | Report | من نویسنده این مقاله هستم

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

Scientometrics

The specifications of the publisher center of this Paper are as follows:
Type of center: دانشگاه دولتی
Paper count: 10,876
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