409 research outputs found
Recommended from our members
Primal-dual variable neighborhood search for the simple plant-location problem
Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n = 15,000 users, and m = n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m = n = 7,000; and (iii) exact solutions of instances with variable fixed costs and up to m = n = 15, 000.This work is supported by NSERC Grant 105574-02; NSERC Grant OGP205041; and partly by the Serbian Ministry of Science, Project 1583
Recommended from our members
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
Copyright @ 2000 INFORMSThe multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a), p-Median plus Weber (Hansen ct al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.This study was supported by the Department
of National Defence (Canada) Academic Research; Office of Naval Research Grant N00014-92-J-1194, Natural Sciences and Engineering Research Council of Canada Grant GPO 105574 and Fonds pour la Formation des Chercheurs et l’Aide a la Recherche Grant 32EQ 1048; and by an International Postdoctoral Fellowship of the Natural Sciences and Engineering Research Council
of Canada, Grant OGPOO 39682
Pooling problem: Alternate formulations and solution methods
Copyright @ 2004 INFORMSThe pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given requirements. It is well known that the pooling problem can be modeled through bilinear and nonconvex quadratic programming. In this paper, we investigate how best to apply a new branch-and-cut quadratic programming algorithm to solve the pooling problem. To this effect, we consider two standard models: One is based primarily on flow variables, and the other relies on the proportion. of flows entering pools. A hybrid of these two models is proposed for general pooling problems. Comparison of the computational properties of flow and proportion models is made on several problem instances taken from the literature. Moreover, a simple alternating procedure and a variable neighborhood search heuristic are developed to solve large instances and compared with the well-known method of successive linear programming. Solution of difficult test problems from the literature is substantially accelerated, and larger ones are solved exactly or approximately.This project was funded by Ultramar Canada and Luc Massé. The work of C. Audet was supported by NSERC (Natural Sciences and Engineering Research Council) fellowship PDF-207432-1998 and by CRPC (Center for Research on Parallel Computation). The work of J. Brimberg was supported by NSERC grant #OGP205041. The work of P. Hansen was supported by FCAR(Fonds pour la Formation des Chercheurs et l’Aide à la Recherche)
grant #95ER1048, and NSERC grant #GP0105574
The Fall and Rise of the 8th Grade School
Historical look at schooling and grade configurations.https://educate.bankstreet.edu/progressive/1002/thumbnail.jp
An oil pipeline design problem
Copyright @ 2003 INFORMSWe consider a given set of offshore platforms and onshore wells producing known (or estimated) amounts of oil to be connected to a port. Connections may take place directly between platforms, well sites, and the port, or may go through connection points at given locations. The configuration of the network and sizes of pipes used must be chosen to minimize construction costs. This problem is expressed as a mixed-integer program, and solved both heuristically by Tabu Search and Variable Neighborhood Search methods and exactly by a branch-and-bound method. Two new types of valid inequalities are introduced. Tests are made with data from the South Gabon oil field and randomly generated problems.The work of the first author was supported by NSERC grant #OGP205041. The work of the second author was supported by FCAR (Fonds pour la Formation des Chercheurs et l’Aide à la Recherche) grant #95-ER-1048, and NSERC grant #GP0105574
Solving the planar p-median problem by variable neighborhood and concentric searches
Two new approaches for the solution of the p-median problem
in the plane are proposed. One is a Variable Neighborhood Search (VNS)
and the other one is a concentric search. Both approaches are enhanced by a
front-end procedure for finding good starting solutions and a decomposition
heuristic acting as a post optimization procedure. Computational results
confirm the effectiveness of the proposed algorithms
Less is more approach: basic variable neighborhood search for the obnoxious p-median problem
The goal of the less is more approach (LIMA) for solving optimization problems that has recently been proposed in Mladenović et al. (2016) is to find the minimum number of search ingredients that make a heuristic more efficient than the currently best. In this paper, LIMA is successfully applied to solve the obnoxious p-median problem (OpMP). More precisely, we developed a basic variable neighborhood search for solving the OpMP, where the single search ingredient, the interchange neighborhood structure, is used. We also propose a new simple local search strategy for solving facility location problems, within the interchange neighborhood structure, which is in between the usual ones: first improvement and best improvement strategies. We call it facility best improvement local search. On the basis of experiments, it appeared to be more efficient and effective than both first and best improvement. According to the results obtained on the benchmark instances, our heuristic turns out to be highly competitive with the existing ones, establishing new state-of-the-art results. For example, four new best-known solutions and 133 ties are claimed in testing the set with 144 instances. © 2019 The Authors. International Transactions in Operational Research © 2019 International Federation of Operational Research Societies15YJC630097Higher Education Discipline Innovation ProjectMinistarstvo Prosvete, Nauke i TehnoloÅ¡kog Razvoja, MPNTR: BR05236839, 044006, 174010National Natural Science Foundation of China, NSFC: 71601065, 71690235, 71521001, 71871080, 71501058This research is partially supported by Serbian Ministry of Education, Science and Technological Development under the grants nos. 174010 and 044006. In addition, this research is partially supported by the framework of the grant number BR05236839 ?Development of information technologies and systems for stimulation of personality's sustainable development as one of the bases of development of digital Kazakhstan? and by the National Natural Science Foundation of China (Nos. 71871080, 71601065, 71690235, 71501058), Innovative Research Groups of the National Natural Science Foundation of China (71521001), the Humanities and Social Sciences Foundation of the Chinese Ministry of Education (No. 15YJC630097), and the Base of Introducing Talents of Discipline to Universities for Optimization and Decision-Making in the Manufacturing Process of Complex Product (111 project)
- …