On the use of genetic algorithms to solve location problems
From MaRDI portal
Publication:5959394
DOI10.1016/S0305-0548(01)00021-1zbMath0995.90060OpenAlexW2017705568MaRDI QIDQ5959394
Joy Bhadury, Jorge H. Jaramillo, Rajan Batta
Publication date: 24 October 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00021-1
Related Items
A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran, A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage, Robust facility location problem for hazardous waste transportation, A novel differential evolution algorithm for binary optimization, Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example, A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs, Optimizing the size and locations of facilities in competitive multi-site service systems, Developing effective meta-heuristics for a probabilistic location model via experimental design, \((r|p)\)-centroid problems on networks with vertex and edge demand, Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model, Bilevel programming and applications, Covering models and optimization techniques for emergency response facility location and planning: a review, Wartime logistics model for multi‐support unit location–allocation problem with frontline changes, Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities, Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences, Designing a supply chain network under the risk of disruptions, A multiperiod set covering location model for dynamic redeployment of ambulances, Genetic algorithm for obstacle location-allocation problems with customer priorities, LOCATING SUGAR CANE LOADING STATIONS UNDER VARIATIONS IN CANE SUPPLY, A memetic algorithm for multi-objective dynamic location problems, Efficient metaheuristics to solve the intermodal terminal location problem, New genetic algorithms based approaches to continuous \(p\)-median problem, A GIS-based optimization framework for competitive multi-facility location-routing problem, Allocation search methods for a generalized class of location-allocation problems, A genetic algorithm for a single product network design model with lead time and safety stock considerations, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, A robust and efficient algorithm for planar competitive location problems, A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM, Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, Heuristic procedures for solving the discrete ordered median problem, Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Heuristics for the capacitated plant location model
- A genetic algorithm for the set covering problem
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Genetic algorithms applied to computationally difficult set covering problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
