A memetic algorithm for multi-objective dynamic location problems
From MaRDI portal
Publication:960114
DOI10.1007/s10898-007-9239-9zbMath1173.90004OpenAlexW2038959944WikidataQ59682325 ScholiaQ59682325MaRDI QIDQ960114
Joana Dias, Maria Eugénia Captivo, Joao Carlos Namorado Climaco
Publication date: 16 December 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/7914
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ Multiple criteria facility location problems: a survey ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A genetic algorithm for solving a capacitated \(p\)-median problem
- Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
- Heuristic procedures for solving the discrete ordered median problem
- Efficient primal-dual heuristic for a dynamic location problem
- A memetic algorithm for multi-objective dynamic location problems
- An algorithm for the bi-criterion integer programming problem
- A multicriteria approach to the location of public facilities
- The use of dynamic programming in genetic algorithms for permutation problems
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Upper and lower bounds for the single source capacitated location problem.
- An interactive procedure dedicated to a bicriteria plant location model.
- Interactive specification and analysis of aspiration-based preferences.
- An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution
- Guidance in evolutionary multi-objective optimization
- Parallel genetic algorithms with local search
- Solving the simple plant location problem by genetic algorithm
- The Plant Location Problem: New Models and Research Prospects
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- On the use of genetic algorithms to solve location problems
This page was built for publication: A memetic algorithm for multi-objective dynamic location problems
