Results 41 to 50 of about 2,210,593 (198)

A GPU-based genetic algorithm for the p-median problem [PDF]

open access: yesJournal of Supercomputing, 2016
The p-median problem is a well-known NP-hard problem. Many heuristics have been proposed in the literature for this problem. In this paper, we exploit a GPGPU parallel computing platform to present a new genetic algorithm implemented in CUDA and based on
Bader F. AlBdaiwi, H. Aboelfotoh
semanticscholar   +1 more source

A comparative study of formulations and solution methods for the discrete ordered p-median problem

open access: yesComputers & Operations Research, 2017
This paper presents several new formulations for the Discrete Ordered Median Problem (DOMP) based on its similarity with some scheduling problems. Some of the new formulations present a considerably smaller number of constraints to define the problem ...
M. Labbé, Diego Ponce, J. Puerto
semanticscholar   +1 more source

An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem

open access: yesInternational Journal of Industrial Engineering and Production Research, 2010
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity ...
M. Yaghini   +2 more
doaj  

Modelling a Multi-Product P-hub Median Problem by Considering Methods of Finance [PDF]

open access: yesچشم‌انداز مدیریت صنعتی, 2015
Hub location problems arise wherever we face complex networks for information or products transshipment. Hubs are special facilities that act as distribution intermediaries in distribution networks.
Esmail Cheraghi   +2 more
doaj  

Parallelization of the scatter search for the p-median problem [PDF]

open access: yesParallel Computing, 2003
This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase of exploration.
Félix García-López   +3 more
openaire   +2 more sources

P-medyan Tesis Yeri Seçim Problemi ve Çözüm Yaklaşımları

open access: yesOnline Academic Journal of Information Technology, 2012
Her geçen gün globalleşen ve rekabetin sürekli olarak arttığı dünyamızda organizasyonların yaşamlarını devam ettirebilmelerinde başarılı bir tedarik zinciri yönetimi stratejisi vazgeçilmez hale gelmiştir. Organizasyonların giderlerinin önemli bir kısmını
Mehmet Bastı
doaj   +1 more source

Parallel Genetic Algorithm for Capacitated P-median Problem

open access: yes, 2017
This paper presents an implementation of a specific genetic algorithm on a high performance computing cluster. The algorithm is designed to approximately solve the capacitated p-median problem.
Milos Herda
semanticscholar   +1 more source

A fuzzy interval optimization approach for p-hub median problem under uncertain information.

open access: yesPLoS ONE
Stochastic and robust optimization approaches often result in sub-optimal solutions for the uncertain p-hub median problem when continuous design parameters are discretized to form different environmental scenarios.
Yu Wang, Tao Zhu, Kaibo Yuan, Xin Li
doaj   +1 more source

Diversity Management Techniques for the Upper-Bounded Hamiltonian p-Median Problem

open access: yesMathematical and Computational Applications
The Hamiltonian p-median problem (HpMP) generalizes the classical traveling salesperson (TSP) and the Hamiltonian cycle problems. The HpMP aims to find a collection of p non-intersecting cycles that span all the vertices of a given edge-weighted graph G=(
José Alejandro Cornejo-Acosta   +3 more
doaj   +1 more source

Exact and heuristic algorithms for the Hamiltonian p-median problem

open access: yesEuropean Journal of Operational Research, 2016
This paper presents an exact algorithm, a constructive heuristic algorithm, and a metaheuristic for the Hamiltonian p-Median Problem (HpMP). The exact algorithm is a branch-and-cut algorithm based on an enhanced p-median based formulation, which is ...
G. Erdoğan   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy