Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search
From MaRDI portal
Publication:1956483
DOI10.1007/s12597-009-0028-8zbMath1202.90233OpenAlexW2047111852MaRDI QIDQ1956483
Amarinder Singh, Satya Prakash, Mahesh K. Sharma
Publication date: 22 September 2010
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-009-0028-8
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
A bicriterion call center problem through an evolved branch and bound algorithm ⋮ Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized ⋮ A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
Cites Work
This page was built for publication: Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search