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

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

P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

2015
Mucahit Erken

Design of network, through which data, packages or even people can be transported, is an important issue for achieving a desired level of service quality at an acceptable cost. For this purpose, it is possible to design a network comprised of nodes that are connected to each other with dedicated lines. However, this kind of solution will not be cost effective. In order to decrease the total tra...

Iraj Mahdavi, Nezam Mahdavi-Amiri, Reza Tavakkoli-Moghaddam, Vorya Zarei,

The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

Journal: :international journal of industrial engineering and productional research- 0
m. mohammadi master student in department of industrial engineering, college of engineering, university of tehran, iran r. tavakkoli-moghaddam professor in department of industrial engineering, college of engineering, university of tehran, iran. a. ghodratnama ph.d. student in department of industrial engineering, college of engineering, university of tehran, iran. h. rostami student in department of industrial engineering, college of engineering, university of tabriz, iran

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

2013
Juanjo Peiró Ángel Corberán Rafael Martí

In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...

Journal: :Rairo-operations Research 2022

In hub-and-spoke systems, due to the changes in input parameters affecting system over time, transportation providers should make right and timely decisions about hub facilities. For this reason, multi-period location problems are especially important. This paper presents a comprehensive review of from 1990 up most recent published studies. First, we study developed models based on some charact...

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

Journal: :international journal of industrial engineering and productional research- 0
a. ghodratnama tehran, iran r. tavakkoli-moghaddam tehran, iran a. ghodratnama baboli vahdani lyon, france b. vahdani tehran, iran

hub location-allocation problems are currently a subject of keen interest in the research community. however, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. in this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...

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

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