Multicommodity Network Problems: Applications and Computations

Ali, I.; Barnett, Doug; Farhangian, Keyvan; Kennington, Jeffery L.; Patty, Bruce W.; Shetty, Bala; McCarl, Bruce A.; Wong, Peter J.

doi:10.1080/07408178408974677

Cited by 25 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Surveys on the application of the MCFP as well as some experimental results can be found in Assad [2], Kennington [6], and Ali et al [1]. Although constraints (14) and (15) represent flow conservation as a function of each bin-and-rack (origin-destination) pair, the BRAM does not have the shared arc capacity constraints that generally occur with the MCFP.…”

Section: The Constraintsmentioning

confidence: 97%

Models for the design and analysis of a large package sort facility

2002

View full text Add to dashboard Cite

At the sort facility in a large overnight package delivery operation, palletized loads are moved in a container (called an inbound ULD) from a plane to a bin, unloaded from the bin, and moved by forklift one item at a time from a bin to a rack. At the rack, each palletized load is loaded into a container (called an outbound ULD) and this outbound ULD is delivered to a plane for delivery to its final delivery airport. The purpose of this study was to determine the optimal design of this sort facility that acts as a hub in a hub-and-spoke system. For a given topology of the sort facility (a topology being the specification of the locations of the bins and the racks), a design of this sort facility is the assignment of inbound ULDs to bins and outbound ULDs to racks and the determination of the number of forklifts needed to carry out the sort. In this paper, the Bin and Rack Assignment Model (BRAM) is developed to perform this analysis; the objective of the BRAM is to minimize the daily operating and amortized capital cost of performing the sort. Since the BRAM is computationally difficult to solve, the BAM and RAM algorithm is developed to derive heuristic solutions to the BRAM. Several examples of the BAM and RAM algorithm are presented. A modification to the BAM and RAM algorithm for solving practical-sized problems is then presented and future directions for this analysis are discussed.

show abstract

Section: The Constraintsmentioning

confidence: 97%

Models for the design and analysis of a large package sort facility

2002

View full text Add to dashboard Cite

show abstract

“…Benders' decomposition method has been employed to solve the strategic and operations management problems, especially in networks based problems, which as such can be solved by linear programming methods. Ali et al utilized it for solving multi-commodity network problems [18]. Dogan et al [19] used Benders decomposition method for solving a mixed integer programming problem for the strategic production-distribution allocation problem for the supply chain network.…”

Section: Literature Reviewmentioning

confidence: 99%

Dual Market Facility Network Design under Bounded Rationality

et al. 2018

View full text Add to dashboard Cite

A number of markets, geographically separated, with different demand characteristics for different products that share a common component, are analyzed. This common component can either be manufactured locally in each of the markets or transported between the markets to fulfill the demand. However, final assemblies are localized to the respective markets. The decision making challenge is whether to manufacture the common component centrally or locally. To formulate the underlying setting, a newsvendor modeling based approach is considered. The developed model is solved using Frank-Wolfe linearization technique along with Benders' decomposition method. Further, the propensity of decision makers in each market to make suboptimal decisions leading to bounded rationality is considered. The results obtained for both the cases are compared.

show abstract

“…Convergence to the optimal solution is guaranteed for PPD and PP, whereas RDD may experience convergence problems. Ali et al (1984) present a comparison of the primal partitioning algorithm for solving the multicommodity model with a general purpose LP code. On a set of test problems, they find that the primal partitioning technique runs in approximately one-half the time required by the LP code.…”

Section: Solution Techniquesmentioning

confidence: 99%

“…Multicommodity models have also been used for casualty evacuation of war time casualties, grain transportation, and aircraft routing for the USAF. A discussion of these applications can be found in Ali et al (1984). Additional applications of multicommodity flows are given in Gautier andGranot (1995), andPopken (1994).…”

Section: Introductionmentioning

confidence: 99%

“…Multicommodity network flow problems are extensively studied because of their numerous applications and because of the intriguing network structure exhibited by these problems (Ahuja et al 1993;Ali et al 1984;Assad 1978;Castro and Nabona 1996;Kennington 1978;McBride 1998). Multicommodity models have been proposed for planning studies involving urban traffic systems (Chen and Meyer 1988;LeBlanc 1973;Potts and Oliver 1972) and communications systems (LeBlanc 1973;Naniwada 1969).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Machine Learning

2013

Encyclopedia of Operations Research and Management Science

View full text Add to dashboard Cite

A term used in the artificial intelligence community to indicate automated improvement based on experience or empirical data in accomplishing a given task such as optimizing an objective function. MaintenanceMaintenance is the support of successful system operation during long periods of usage by means of: (1) regular or sample check-ups; (2) planned or preventive replacement of the system's units; (3) failure diagnosis; and/or (4) spare units supply. Operations research models for a system maintenance analysis are represented mainly by optimization models for the improvement of system and equipment reliability.For (1) and (2), one usually uses methods of controlled stochastic processes. For (3), one uses special methods based on mathematical logic, while (4) is considered in the scope of optimal redundancy and inventory control. IntroductionManpower (or, human resource) planning is concerned with the quantitative aspects of the supply of and demand for people in employment. At one extreme this might include the whole working population of a country, but it has been most successful when applied to smaller, more homogeneous systems like individual firms or professions. The term manpower planning appears to date from the 1960s though many of the ideas can be traced back much further. In recent years terms such as Workforce Panning and Personnel Planning have been used in the same sense. A history of the subject up to the 1980s,from a U.K. perspective, will be found in Smith and Bartholomew (1988). The literature of the subject is very scattered reflecting the diverse disciplinary origins of the practitioners, but most of the technical material is to be found in the journals of operations research, probability, and statistics. There was an initial surge of publication in the late 1960s and early 1970s and since then book length treatments include Grinold and Marshall (1977), Vajda (1978), and Bennison and Casson (1984). Bartholomew, Forbes and McClean (1991) gives a thorough coverage of the technical material and contains an extensive bibliography. Since then there has been a period of consolidation. The earlier theoretical work has largely proved adequate for practical needs, though there have been developments in closely related areas. See, for example, Kalamatianou and McLean (2003). The essence of manpower planning is summed up in the aphorism that its aim is to have the right numbers of people of the right kinds in the right places at the right time. The basic approach is first to classify the members of a system in relevant ways. These will often be on the basis of such things as grade, salary level, sex, qualifications, and job title. The state of the system at any point in time can then be described by the numbers in these categories, often referred to as the stocks. Over time, changes occur as individuals join, leave the system or move within it. The numbers making these transitions are called the flows. The factors giving rise to change may be predictable or unpredictable but will include such things ...

show abstract

Multicommodity Network Problems: Applications and Computations

Cited by 25 publications

References 10 publications

Models for the design and analysis of a large package sort facility

Models for the design and analysis of a large package sort facility

Dual Market Facility Network Design under Bounded Rationality

Machine Learning

Contact Info

Product

Resources

About