Journal ArticleDOI
A single source transportation algorithm
TLDR
Two heuristic solution methods and a branch and bound algorithm for solving single source transportation problems and Computational experience with the solution of randomly generated problems having up to 40,000 integer variables are reported.About:
This article is published in Computers & Operations Research.The article was published on 1980-01-01. It has received 16 citations till now. The article focuses on the topics: Fuzzy transportation & 1-center problem.read more
Citations
More filters
Journal ArticleDOI
A Lagrangian heuristic for the capacitated plant location problem with single source constraints
TL;DR: In this article, the Lagrangian relaxations of the CAPACitated Plant Location Problem with Single Source constraints were studied in terms of the bounds and solution techniques, and a heuristic based on a lagrangian relaxation of the problem was proposed.
Journal ArticleDOI
Solving a large scale districting problem: a case report
TL;DR: The problem of defining the territories for 168 sales agents of a German manufacturer of consumer goods is solved by means of a location-allocation approach involving a standard code of a primal network algorithm as well as a new heuristic for resolving split areas.
Journal ArticleDOI
Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
Gustavo Alfredo Bula,Gustavo Alfredo Bula,Caroline Prodhon,Fabio A. González,H. Murat Afsar,Nubia Velasco +5 more
TL;DR: This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation, and a variant of the Variable Neighborhood Search (VNS) algorithm is employed.
Journal ArticleDOI
Approximate solutions to large scale capacitated facility location problems
TL;DR: In this paper, a heuristic algorithm for solving large scale capacitated facility location problems is presented, where the single source problem is solved by applying an iterative procedure in which lower bounds on the optimal objective value are generated through Lagrangian relaxation techniques.
Journal Article
A Survey of Discrete Facility Location Problems
Z. Ulukan,E. Demircioğlu +1 more
TL;DR: A general review on studies, efforts and developments in Facility Location Problems which are classical optimization problems having a wide-spread applications in various areas such as transportation, distribution, production, supply chain decisions and telecommunication is provided.
References
More filters
Journal ArticleDOI
A branch and bound algorithm for the generalized assignment problem
G. Terry Ross,Richard M. Soland +1 more
TL;DR: A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds.
Journal ArticleDOI
The Loading Problem
Samuel Eilon,Nicos Christofides +1 more
TL;DR: The loading problem is defined as the allocation of given items with known magnitude to boxes with constrained capacity, so as to minimize the number of boxes required, and two methods of solution are considered.
Journal ArticleDOI
Modeling Facility Location Problems as Generalized Assignment Problems
G. Terry Ross,Richard M. Soland +1 more
TL;DR: In this article, a variety of well-known facility location and location-allocation models are shown to be equivalent to, and therefore solvable as, generalized assignment problems GAP's, a 0-1 programming model in which it is desired to minimize the cost of assigning n tasks to a subset of m agents.
Journal ArticleDOI
An all Zero-One Algorithm for a Certain Class of Transportation Problems
TL;DR: A search method, roughly resembling Balas's filter method, is proposed for the solution of the problem, and an application of the model to a real industrial problem is described.
Journal ArticleDOI
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
TL;DR: In this article, the authors define a set of properties that are to be expected from a proper measure of solution quality and investigate the family of functions which satisfy those conditions and conclude with several examples of linear functions which are suitable for certain classes of problems.
Related Papers (5)
A branch and bound algorithm for the generalized assignment problem
G. Terry Ross,Richard M. Soland +1 more