نتایج جستجو برای: capacitated allocation

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

2011
Anna Adamaszek Artur Czumaj Andrzej Lingas Jakub Onufry Wojtaszczyk

We study a capacitated network design problem in geometric setting. We assume that the input consists of an integral link capacity k and two sets of points on a plane, sources and sinks, each source/sink having an associated integral demand (amount of flow to be shipped from/to). The capacitated geometric network design problem is to construct a minimum-length network N that allows to route the...

Journal: :European Journal of Operational Research 2015
Dion Gijswijt Shanfei Li

We study the capacitated k-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number k. It costs fi to open facility i, and cij for facility i to serve one unit of demand from client j. The objective is to open at most k facilities serving all the demands and satisfying the capacity constraints while minimizing the ...

Journal: :International Journal of Research -GRANTHAALAYAH 2019

Journal: :EURO Journal on Computational Optimization 2015

Journal: :SIAM Journal on Discrete Mathematics 2009

Journal: :Journal of physics 2021

Abstract The warehousing logistics mode of “pre-warehouse plus terminal distribution” is a decentralized resource allocation scheme around the industry at end distribution, supporting development New Retail, data-driven extensive retail form centered on consumer experience. Firstly, taking stand-alone pre-warehouse as research object, this paper analyzed distribution characteristics new fresh g...

1990
Jesus Rafael

We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalityconstrained minimal spanning tree problem and the identical customer vehicle routing problem. For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introduce a number of new valid inequalities and specify conditions for ensuring when these inequalities ...

Journal: :J. Heuristics 2001
Rahul Simha Tom Weidong Cai Valentin I. Spitkovsky

The general facility location problem and its variants, including most location-allocation and P-median problems, are known to be NP-hard combinatorial optimization problems. Consequently , there is now a substantial body of literature on heuristic algorithms for a variety of location problems, among which can be found several versions of the well-known simulated annealing algorithm. This paper...

2007
Mitnala Sreenivasa Rao Korada Viswanatha Sharma

In recent years, variants of Kanban mechanisms are proposed to deal with different levels of uncertainties commonly exist in a typical production system. Among them, generalized Kanban control (Buzacott [1989]) mechanism gained popularity as it is able to deal with uncertainties effectively while maintaining pull philosophy. In literature, many models are developed to gain insights on the desig...

2007
Bruce L. Golden Gilbert Laporte Éric D. Taillard

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.

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

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