Solving the bi-objective capacitated p -median problem with multilevel capacities using compromise programming and VNS
Published 2017 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Solving the bi-objective capacitated p
-median problem with multilevel capacities using compromise programming and VNS
Authors
Keywords
-
Journal
International Transactions in Operational Research
Volume -, Issue -, Pages -
Publisher
Wiley
Online
2017-12-02
DOI
10.1111/itor.12485
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
- (2016) Milorad Vidović et al. International Transactions in Operational Research
- Parallel variable neighborhood search for the min-max order batching problem
- (2016) Borja Menéndez et al. International Transactions in Operational Research
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- (2016) Manel Kammoun et al. International Transactions in Operational Research
- Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems
- (2015) Chandra Ade Irawan et al. JOURNAL OF HEURISTICS
- A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music
- (2015) Matteo Balliauw et al. International Transactions in Operational Research
- Bi-objective stochastic programming models for determining depot locations in disaster relief operations
- (2015) Stefan Rath et al. International Transactions in Operational Research
- An adaptive multiphase approach for large unconditional and conditional p-median problems
- (2014) Chandra Ade Irawan et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A multiobjective optimization approach for location-allocation of clinics
- (2014) Sara Beheshtifar et al. International Transactions in Operational Research
- Matheuristics for the capacitated p-median problem
- (2014) Fernando Stefanello et al. International Transactions in Operational Research
- A hybrid metaheuristic approach for the capacitated p-median problem
- (2013) Masoud Yaghini et al. APPLIED SOFT COMPUTING
- Solving large $$p$$ p -median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- (2013) Chandra A. Irawan et al. JOURNAL OF GLOBAL OPTIMIZATION
- An efficient heuristic algorithm for the capacitated $$p-\!$$ median problem
- (2012) Masoud Yaghini et al. 4OR-A Quarterly Journal of Operations Research
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- (2011) I. Landa-Torres et al. COMPUTERS & OPERATIONS RESEARCH
- Size-reduction heuristics for the unrelated parallel machines scheduling problem
- (2010) Luis Fanjul-Peyro et al. COMPUTERS & OPERATIONS RESEARCH
- Variable neighbourhood search: methods and applications
- (2009) Pierre Hansen et al. ANNALS OF OPERATIONS RESEARCH
- Discretized formulations for capacitated location problems with modular distribution costs
- (2009) Isabel Correia et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Hybridizing exact methods and metaheuristics: A taxonomy
- (2008) L. Jourdan et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An effective VNS for the capacitated p-median problem
- (2007) K. Fleszar et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started