Heuristic search to the capacitated clustering problem
From MaRDI portal
Publication:1622798
DOI10.1016/j.ejor.2018.08.043zbMath1403.90661OpenAlexW2889505328MaRDI QIDQ1622798
Qing Zhou, Jin-Kao Hao, Qinghua Wu, Una Benlic
Publication date: 19 November 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.08.043
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (10)
Learning-driven feasible and infeasible tabu search for airport gate assignment ⋮ STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES ⋮ Reinforcement learning based tabu search for the minimum load coloring problem ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ A matheuristic for large-scale capacitated clustering ⋮ Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ Resilient route design for collection of material from suppliers with split deliveries and stochastic demands ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions ⋮ The balanced maximally diverse grouping problem with block constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Operational research in education
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Iterated maxima search for the maximally diverse grouping problem
- A reactive GRASP with path relinking for capacitated clustering
- A hybrid metaheuristic approach to solving the UBQP problem
- An efficient memetic algorithm for the graph partitioning problem
- Solving capacitated clustering problems
- Tabu search and GRASP for the maximum diversity problem
- Tabu search and GRASP for the capacitated clustering problem
- Resource constrained routing and scheduling: review and research prospects
- Hybrid evolutionary algorithms for graph coloring
- A hybrid metaheuristic method for the maximum diversity problem
- TTT plots: a perl program to create time-to-target plots
- An artificial bee colony algorithm for the maximally diverse grouping problem
- Balancing assembly lines with tabu search
- Experimental Methods for the Analysis of Optimization Algorithms
- An empirical comparison of heuristic methods for creating maximally diverse groups
- A Gentle Introduction to Memetic Algorithms
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A dynamic tabu search for large-scale generalized assignment problems
This page was built for publication: Heuristic search to the capacitated clustering problem
