Application of Genetic algorithm in solution of uncapacitated multi-period single allocation p-hub median problem.

سال انتشار: 1392
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,193

فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد

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

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

NIESC02_215

تاریخ نمایه سازی: 27 اردیبهشت 1393

چکیده مقاله:

Allocation p-hub median design problems play an important role in many real-life network systems such as transportation and telecommunication networks. It seeks to simultaneously determine the location of p hubs between n nodes and the optimized design of the network facilities in order to connecting an efficient hub and spoke network that minimizes the flow-weighted costs across the network. This paper is focused on uncapacitated single allocation multi-period p-hub median problem (UCSApHMP), which arises in many real-worlds hub networks of logistics operations. Instead of classical models, this paper assumed that there is a budget constraint in project and it leads the problem to be multi-period. We here in use a genetic algorithm determine location of hubs and optimal allocation of remained nodes to these hubs. The simulation results show that the proposed method can be considered as an efficient and robust method

نویسندگان

Hamid Rastegar

MSc student, School of Industrial Engineering, college of Engineering, University of Tehran, Tehran-Iran

Masoud Rabbani

Professor, School of Industrial Engineering, college of Engineering, University of Tehran, Tehran-Iran

Hooman Madani Saatchi

MSc student, School of Industrial Engineering, college of Engineering University of Tehran, Tehran-Iran.

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Skorin-kapov, j, O'Kelly, 1996.tight LP relaxations _ incapacitated p-hub median ...
  • Sohn.j, park.s, 1998.efficient solution procedure and reduced size formulation for ...
  • Ermst. at j rishnamoorthy _ 1996.efficient algorithms for the incapacitated ...
  • Ebrey.j, 2001, solving large single allocation p-hub problems with 2 ...
  • O'kelly, m.e, 1987.a quadratic integer program for the location of ...
  • Klincewicz.j.g, 1991, heuristic method for the p-hub location problem. european ...
  • Klincewicz, j.g, 1992, avoiding local optima in the p-hub location ...
  • Skorin-kapov. d, 1994.one tabu search for the solution of interacting ...
  • Campbell. J.f, 1996, hub location and the p-hub median problem. ...
  • Ernst.a.t, Kri shnamurthy' S, 1998, an exact solution approach based ...
  • Pirkul.h, schilling's, 1998.an efficient procedure for designing single allocation hub ...
  • J. f. campb ell.location and allocation for distribution systems with ...
  • N.boland, m _ krishnamurthy, preprocessing and cutting for multiple allocation ...
  • Hayman, 2008, the hierarchical hub median problem with single assignments. ...
  • Yaman.h, Kara.b.y, Tansel.b, 2007, the latest arrival hub location problems ...
  • Lin.ch, ling.y, chen.y, the capacitated p-hub median problem with integral ...
  • Kang-Ting Ma, Apply Ant Colony Optimization for Solving the Uncapacitated ...
  • K.Fleszar a, 1, K.S. Hindi b, An effective VNS for ...
  • Sergio Garcia a, Mercedes Landete b, Alfredo Man, New formulation ...
  • James F.Campbell, Hub location for time definite transportation, 30 January ...
  • Hande Yaman, Star p-hub median problem with modular arc capacities, ...
  • نمایش کامل مراجع