نتایج جستجو برای: dynamic hub covering problem

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

Journal: :RAIRO - Operations Research 2007
Laurent Alfandari

The Soft-Capacitated Facility Location Problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set coverin...

2014
Aydin Ozmen Ozgur Koray Sahingoz

In this paper, we present an effective solution using the genetic algorithm for the uncapacitated single allocation hub location problem (USAHLP). This solution was published before, but today it still gives the really effective results, although there are many studies have been done after it. We also make an application using this method and present the performance results of this method.

The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...

Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...

Journal: :Computers & Operations Research 2012

Journal: :Discrete Mathematics 1982

Journal: :The Electronic Journal of Combinatorics 2015

Journal: :The Electronic Journal of Combinatorics 2008

2004
Inmaculada Rodríguez Martín Juan José Salazar González

In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complet...

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

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