Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS (Q6088248): Difference between revisions

Latest revision as of 18:19, 30 December 2024

scientific article; zbMATH DE number 7766427

Language	Label	Description	Also known as
English	Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS	scientific article; zbMATH DE number 7766427

Statements

instance of

scholarly article

0 references

title

Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS (English)

0 references

0 references

0 references

0 references

International Transactions in Operational Research

0 references

publication date

16 November 2023

0 references

zbMATH Keywords

capacitated \(p\)-median problem

0 references

bi-objective

0 references

compromise programming

0 references

VNS

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/itor.12485

0 references

cites work

Greedy random adaptive memory programming search for the capacitated clustering problem

0 references

A new method for solving capacitated location problems based on a set partitioning approach

0 references

A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music

0 references

A multiobjective optimization approach for location‐allocation of clinics

0 references

A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes

0 references

Q4359509

0 references

A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

0 references

Innovations in hybrid intelligent systems. Selected papers based on the presentations at the 2nd international workshop on hybrid artificial intelligence systems, (HAIS 2007), Salamance, Spain, November 2007

0 references

A Lagrangean heuristic for a modular capacitated location problem

0 references

Discretized formulations for capacitated location problems with modular distribution costs

0 references

Hybrid scatter search and path relinking for the capacitated \(p\)-median problem

0 references

Applications of evolutionary computing. EvoWorkshops 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14--16, 2003. Proceedings

0 references

An effective VNS for the capacitated \(p\)-median problem

0 references

Q4198056

0 references

Variable neighborhood search for the p-median

0 references

Variable neighborhood search: Principles and applications

0 references

Variable neighbourhood search: methods and applications

0 references

Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search

0 references

An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems

0 references

Hybridizing exact methods and metaheuristics: a taxonomy

0 references

An integration of mixed VND and VNS: the case of the multivehicle covering tour problem

0 references

An Algorithmic Approach to Network Location Problems. I: Thep-Centers

0 references

A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem

0 references

A column generation approach to capacitated \(p\)-median problems

0 references

A bionomic approach to the capacitated \(p\)-median problem

0 references

Parallel variable neighborhood search for the min–max order batching problem

0 references

Solving capacitated clustering problems

0 references

Location-routing: issues, models and methods

0 references

Capacitated clustering problems by hybrid simulated annealing and tabu search

0 references

Efficient algorithms for the capacitated concentrator location problem

0 references

Bi-objective stochastic programming models for determining depot locations in disaster relief operations

0 references

Goal programming, compromise programming and reference point method formulations: linkages and utility interpretations

0 references

A scatter search heuristic for the capacitated clustering problem

0 references

Matheuristics for the capacitated p‐median problem

0 references

Q2776577

0 references

Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem

0 references

An efficient heuristic algorithm for the capacitated \(p\)-median problem

0 references

A Class of Solutions for Group Decision Problems

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6088248

@@ Property / DOI @@
-.1111/itor.12485
@@ Property / DOI: 10.1111/itor.12485 / rank @@
-Normal rank
@@ Property / DOI @@
+.1111/ITOR.12485
@@ Property / DOI: 10.1111/ITOR.12485 / rank @@
+Normal rank

Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248): Difference between revisions

Latest revision as of 18:19, 30 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)