Uniform crossover in genetic algorithms
Proceedings of the third international conference on Genetic algorithms
Computers and Operations Research
An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Computers and Operations Research
Genetic Algorithms
A multiplicatively-weighted Voronoi diagram approach to logistics districting
Computers and Operations Research
Logistics distribution centers location problem and algorithm under fuzzy environment
Journal of Computational and Applied Mathematics
Information Sciences: an International Journal
Decomposition heuristic to minimize total cost in a multi-level supply chain network
Computers and Industrial Engineering
Supply chain optimisation using evolutionary algorithms
International Journal of Computer Applications in Technology
Solving continuous location-districting problems with Voronoi diagrams
Computers and Operations Research
Robotics and Computer-Integrated Manufacturing
Expert Systems with Applications: An International Journal
A steady-state genetic algorithm for multi-product supply chain network design
Computers and Industrial Engineering
Information Sciences: an International Journal
A multiplicatively-weighted Voronoi diagram approach to logistics districting
Computers and Operations Research
Review article: A review of soft computing applications in supply chain management
Applied Soft Computing
Computers and Industrial Engineering
Computers and Operations Research
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Formulations and branch-and-cut algorithm for the k-rooted mini-max spanning forest problem
INOC'11 Proceedings of the 5th international conference on Network optimization
A class of rough multiple objective programming and its application to solid transportation problem
Information Sciences: an International Journal
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Supply Hub in Industrial Park (SHIP): The value of freight consolidation
Computers and Industrial Engineering
Application of Genetic Algorithm for Solving Optimum Power Flow Problems
International Journal of Information Systems and Supply Chain Management
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
Discrete Applied Mathematics
Hi-index | 0.01 |
In a typical location-allocation problem, customer demand data are often aggregated according to some arbitrary spatial points (e.g. population centers) or boundaries (e.g. census districts). Since such points or boundaries do not represent true sources of customer demands, allocation of aggregated customers to distribution centers can lead to underutilization of distribution centers and deterioration of customer services. In an effort to design a supply chain network that maintains the best balance of transportation cost and customer service, this paper proposes a new model based on naïve balanced star spanning forest formulation. This model goes beyond traditional mathematical programming by incorporating a genetic algorithm that is proven to be effective in dealing with the NP-hard problem.