000163315 001__ 163315
000163315 005__ 20251024172259.0
000163315 0247_ $$2doi$$a10.1111/itor.70105
000163315 0248_ $$2sideral$$a145725
000163315 037__ $$aART-2025-145725
000163315 041__ $$aeng
000163315 100__ $$0(orcid)0000-0001-7603-9380$$aCalvete, Herminia I.$$uUniversidad de Zaragoza
000163315 245__ $$aAn iterated greedy‐based metaheuristic with local search for the rank pricing problem
000163315 260__ $$c2025
000163315 5060_ $$aAccess copy available to the general public$$fUnrestricted
000163315 5203_ $$aThe rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction phases. In this process, some components of a solution are removed, yielding partial solutions from which complete solutions are reconstructed. A local search method with three neighborhood exploration strategies is then applied. Computational experiments demonstrate the effectiveness of the proposed algorithm by comparing its performance with exact and heuristic methods from the literature. It consistently finds optimal or near‐optimal solutions for instances with known optima. For most cases where the optimal solution is unknown, the algorithm matches or outperforms the best‐known solutions. Moreover, it achieves these results with significantly lower computational times, reinforcing its suitability for solving the rank pricing problem.
000163315 536__ $$9info:eu-repo/grantAgreement/ES/DGA/E41-23R$$9info:eu-repo/grantAgreement/ES/MICINN/PID2022-139543OB-C43$$9info:eu-repo/grantAgreement/EUR/MICINN/TED2021-130961B-I00
000163315 540__ $$9info:eu-repo/semantics/openAccess$$aby-nc-nd$$uhttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
000163315 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/publishedVersion
000163315 700__ $$0(orcid)0000-0002-5630-3719$$aGalé, Carmen$$uUniversidad de Zaragoza
000163315 700__ $$0(orcid)0000-0003-4420-7567$$aHernández, Aitor$$uUniversidad de Zaragoza
000163315 700__ $$0(orcid)0000-0001-9993-9816$$aIranzo, José A.$$uUniversidad de Zaragoza
000163315 7102_ $$12007$$2265$$aUniversidad de Zaragoza$$bDpto. Métodos Estadísticos$$cÁrea Estadís. Investig. Opera.
000163315 773__ $$g(2025), [35 pp.]$$pInt. trans. oper. res.$$tINTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH$$x0969-6016
000163315 8564_ $$s1327621$$uhttps://zaguan.unizar.es/record/163315/files/texto_completo.pdf$$yVersión publicada
000163315 8564_ $$s2108381$$uhttps://zaguan.unizar.es/record/163315/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada
000163315 909CO $$ooai:zaguan.unizar.es:163315$$particulos$$pdriver
000163315 951__ $$a2025-10-24-16:56:59
000163315 980__ $$aARTICLE