A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand

DOI10.1016/J.COR.2010.07.003zbMATH Open1231.90275OpenAlexW1988207468MaRDI QIDQ709182FDOQ709182

Authors Vedat Verter, G. Laporte, Alper Murat

Publication date 15 October 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2010.07.003

zbMATH Keywords

boundary value problemshooting algorithmlocation-allocation problemcontinuous modeling

Mathematics Subject Classification ID

Numerical solution of boundary value problems involving ordinary differential equations (65L10) Continuous location (90B85) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65M99)

Recommendations

• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• On location-allocation problems for dimensional facilities
• Heuristic cluster algorithm for multiple facility location-allocation problem
• LOCATION-ALLOCATION PROBLEM OF MULTI-PERSON FACILITY

Cites work

• scientific article; zbMATH DE number 1803761 (Why is no real title available?)
• scientific article; zbMATH DE number 3889235 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• A continuous approach to the design of physical distribution systems
• A continuous location-allocation problem with zone-dependent fixed cost
• A continuous model for production-distribution system design
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• A linear program for the two-hub location problem
• A new heuristic approach for the P-median problem
• A new heuristic for the multi-mode resource investment problem
• A quadratic integer program for the location of interacting hub facilities
• An Overview of Representative Problems in Location Research
• An efficient algorithm for the location-allocation problem with rectangular regions
• An optimal method for solving the (generalized) multi-Weber problem
• Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
• Evaluation of plant focus strategies: A continuous approximation framework
• Facility location and capacity acquisition: An integrated approach
• Heuristic Methods for Location-Allocation Problems
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Location-Allocation Problems
• Location-allocation for distribution to a uniform demand with transshipments
• On the Complexity of Some Common Geometric Location Problems
• On the Continuous Fermat-Weber Problem
• Properties and Solution Methods for Large Location-Allocation Problems
• Scheduling, Location, Transportation, and Continuum Mechanics: Some Simple Approximations to Optimization Problems
• The general optimal market area model
• Using estimated missing spatial data with the 2-median model

Cited in

(9)

• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• LOCATION-ALLOCATION PROBLEM OF MULTI-PERSON FACILITY
• Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
• On location-allocation problems for dimensional facilities
• Conditional facility location problems with continuous demand and a polygonal barrier
• A quadtree-based allocation method for a class of large discrete Euclidean location problems
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• Structural properties of Voronoi diagrams in facility location problems with continuous demand
• Joint location, inventory, and preservation decisions for non-instantaneous deterioration items under delay in payments

This page was built for publication: A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709182)