نتایج جستجو برای: hub location routing

تعداد نتایج: 288768  

2007
Dongdong Ge Yinyu Ye Jiawei Zhang

This paper discusses the fixed-hub single allocation problem. In the model hubs are fixed and fully connected; and each terminal node is connected to a single hub which routes all its traffic. The goal is to minimize the cost of routing the traffic in the network. This paper presents linear programming-based algorithms that deliver both high quality solutions and a theoretical worst case bound....

Journal: :European Journal of Operational Research 2008

Journal: :مهندسی صنایع 0
علی¬رضا محمدی شاد دانش آموخته کارشناسی ارشد مهندسی صنایع- دانشگاه بوعلی سینا پرویز فتاحی دانشیار و مدیر گروه مهندسی صنایع- دانشگاه بوعلی سینا

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

Journal: :مهندسی صنایع 0
نرگس نوروزی دانشجوی دکتری مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران رضا توکلی مقدم استاد دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران محسن صادق عمل نیک دانشیار دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران صادق خائفی دانشجوی کارشناسی ارشد دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

2007
Dongdong Ge Yinyu Ye Jiawei Zhang

This paper discusses the fixed-hub single allocation problem. In the model hubs are fixed and fully connected; and each terminal node is connected to a single hub which routes all its traffic. The goal is to minimize the cost of routing the traffic in the network. This paper presents linear programming-based algorithms that deliver both high quality solutions and a theoretical worst case bound....

A. R. Eydi, E. Korani, I. Nakhai Kamalabadi

The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...

Farshid Samaei Mahdi Bashiri Reza Tavakkoli-Moghaddam

In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید