Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
From MaRDI portal
Publication:6088248
DOI10.1111/ITOR.12485OpenAlexW2773107114MaRDI QIDQ6088248
Chandra Ade Irawan, Arif Imran, Martino Luis
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12485
Related Items (3)
An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping ⋮ Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ The uncapacitated r‐allocation p‐hub center problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Solving capacitated clustering problems
- Location-routing: issues, models and methods
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- An effective VNS for the capacitated \(p\)-median problem
- Variable neighbourhood search: methods and applications
- Hybridizing exact methods and metaheuristics: a taxonomy
- Efficient algorithms for the capacitated concentrator location problem
- A bionomic approach to the capacitated \(p\)-median problem
- Applications of evolutionary computing. EvoWorkshops 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14--16, 2003. Proceedings
- A Lagrangean heuristic for a modular capacitated location problem
- A column generation approach to capacitated \(p\)-median problems
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- 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
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Discretized formulations for capacitated location problems with modular distribution costs
- A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
- Bi-objective stochastic programming models for determining depot locations in disaster relief operations
- Goal programming, compromise programming and reference point method formulations: linkages and utility interpretations
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Variable neighborhood search for the p-median
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Matheuristics for the capacitated p‐median problem
- A multiobjective optimization approach for location‐allocation of clinics
- A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music
- Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
- Parallel variable neighborhood search for the min–max order batching problem
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- A Class of Solutions for Group Decision Problems
- Variable neighborhood search: Principles and applications
- A new method for solving capacitated location problems based on a set partitioning approach
This page was built for publication: Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
