Pages that link to "Item:Q5959394"

The following pages link to On the use of genetic algorithms to solve location problems (Q5959394):

Displaying 33 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran (Q264250) (← links)
• A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage (Q286207) (← links)
• Robust facility location problem for hazardous waste transportation (Q301070) (← links)
• \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
• New genetic algorithms based approaches to continuous \(p\)-median problem (Q539099) (← links)
• Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
• A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs (Q850283) (← links)
• Developing effective meta-heuristics for a probabilistic location model via experimental design (Q856202) (← links)
• A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
• A GIS-based optimization framework for competitive multi-facility location-routing problem (Q993466) (← links)
• Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
• Bilevel programming and applications (Q1665319) (← links)
• Efficient metaheuristics to solve the intermodal terminal location problem (Q1761128) (← links)
• Covering models and optimization techniques for emergency response facility location and planning: a review (Q1935907) (← links)
• Designing a supply chain network under the risk of disruptions (Q1954554) (← links)
• Genetic algorithm for obstacle location-allocation problems with customer priorities (Q1983729) (← links)
• A novel differential evolution algorithm for binary optimization (Q2376130) (← links)
• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
• Optimizing the size and locations of facilities in competitive multi-site service systems (Q2384881) (← links)
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
• A multiperiod set covering location model for dynamic redeployment of ambulances (Q2456639) (← links)
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach (Q2569100) (← links)
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model (Q2654319) (← links)
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
• LOCATING SUGAR CANE LOADING STATIONS UNDER VARIATIONS IN CANE SUPPLY (Q4649878) (← links)
• A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM (Q5487850) (← links)
• Wartime logistics model for multi‐support unit location–allocation problem with frontline changes (Q6090511) (← links)
• Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities (Q6092512) (← links)
• Discrete cooperative coverage location models with alternative facility types in a probabilistic setting (Q6495368) (← links)