Publisher of Iranian Journals and Conference Proceedings

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

Developing Genetic Algorithm to Solve Vehicle Routing Problem with Simultaneous Pickup and Delivery

Year: 1399
COI: JR_JCEMA-4-2_003
Language: EnglishView: 228
This Paper With 12 Page And PDF Format Ready To Download

Buy and Download

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

Authors

Amir Masoud Rahimi - Department of Civil Engineering, Faculty of Engineering, University of Zanjan, Zanjan, Iran
Vahid Rajabi - Transportation Engineering, Imam Khomeini International University, Qazvin,Iran.
Ehsan Ramezani Khansari - Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran.

Abstract:

One of the well-known and highly used extensions of vehicle routing problem (VRP) is Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD), in which delivery and pickup for each customer is carried out simultaneously. In this study, it is attempted to present an optimal method for solving VRPSPD using genetic algorithm. In this method, genetic algorithm is improved by modifying genetic parameters and presenting efficient and proper operators. Three Randomized, Nearest neighbor and Cheapest Insertion algorithms are utilized to create the initial population. Given the different structure used in each of these methods, the initial solutions are varied and include all feasible regions. In addition, by making modifications in these methods, the initial population was tried to be created through higher quality solutions to help genetic algorithm reach a better future generation. Also, 4 algorithms were invented for mutation operators, which prevented convergence in local optimums and helped finding better solutions by comparing the results. The proposed algorithm is executed on 40 different standard examples. After comparing the results by this algorithm and the best solutions by other algorithms, improvement is observed in 3 of the examples.

Keywords:

Paper COI Code

This Paper COI Code is JR_JCEMA-4-2_003. 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/1032281/

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:
Rahimi, Amir Masoud and Rajabi, Vahid and Ramezani Khansari, Ehsan,1399,Developing Genetic Algorithm to Solve Vehicle Routing Problem with Simultaneous Pickup and Delivery,https://civilica.com/doc/1032281

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :

  • Min H. The multiple vehicle routing problem with simultaneous delivery ...
  • Fu C, Zhang L, Wang X, Qiao L. Solving TSP ...
  • Hussain A, Muhammad YS, Nauman Sajid M, Hussain I, Mohamd ...
  • Salhi S, Nagy G. A cluster insertion heuristic for single ...
  • Dethloff J. Vehicle routing and reverse logistics: the vehicle routing ...
  • Montané FA, Galvão RD. Vehicle routing problems with simultaneous pick-up ...
  • Nagy G, Salhi S. Heuristic algorithms for single and multiple ...
  • Chen JF, Wu TH. Vehicle routing problem with simultaneous deliveries ...
  • Montané FA, Galvao RD. A tabu search algorithm for the ...
  • Bianchessi N, Righini G. Heuristic algorithms for the vehicle routing ...
  • Zachariadis EE, Tarantilis CD, Kiranoudis CT. A hybrid metaheuristic algorithm ...
  • Gajpal Y, Abad P. An ant colony system (ACS) for ...
  • Çatay B. A new saving-based ant algorithm for the vehicle ...
  • Zachariadis EE, Kiranoudis CT. A local search metaheuristic algorithm for ...
  • Mukhopadhyay DM, Balitanas MO, Farkhod A, Jeon SH, Bhattacharyya D. ...
  • Mirjalili S, Dong JS, Sadiq AS, Faris H. Genetic algorithm: ...
  • Donis-Díaz CA, Bello R, Kacprzyk J. Using ant colony optimization ...
  • Schroeders U, Wilhelm O, Olaru G. Meta-heuristics in short scale ...
  • Zhao F, Yao Z, Luan J, Song X. A novel ...
  • Asadi AA, Naserasadi A, Asadi ZA. A new hybrid algorithm ...
  • Kartheeswaran S, Durairaj DD. A hybrid genetic algorithm and back-propagation ...
  • Fatyanosa TN, Sihananto AN, Alfarisy GA, Burhan MS, Mahmudy WF. ...
  • Chen PH, Shahandashti SM. Hybrid of genetic algorithm and simulated ...
  • Pomar LA, Pulido EC, Roa JD. A Hybrid Genetic Algorithm ...
  • Kuo RJ, Han YS. A hybrid of genetic algorithm and ...
  • Cherki I, Chaker A, Djidar Z, Khalfallah N, Benzergua F. ...
  • DengWei L. Optimization design based on hierarchic genetic algorithm and ...
  • Melanie M. An introduction to genetic algorithms. Cambridge, Massachusetts London, ...
  • Davis L. Applying adaptive algorithms to epistatic domains. InIJCAI 1985 ...
  • Simsir F, Ekmekci D. A metaheuristic solution approach to capacitied ...

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: 9,948
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