MineReduce: an approach based on data mining for problem size reduction
From MaRDI portal
Publication:2664324
Abstract: Hybrid variations of metaheuristics that include data mining strategies have been utilized to solve a variety of combinatorial optimization problems, with superior and encouraging results. Previous hybrid strategies applied mined patterns to guide the construction of initial solutions, leading to more effective exploration of the solution space. Solving a combinatorial optimization problem is usually a hard task because its solution space grows exponentially with its size. Therefore, problem size reduction is also a useful strategy in this context, especially in the case of large-scale problems. In this paper, we build upon these ideas by presenting an approach named MineReduce, which uses mined patterns to perform problem size reduction. We present an application of MineReduce to improve a heuristic for the heterogeneous fleet vehicle routing problem. The results obtained in computational experiments show that this proposed heuristic demonstrates superior performance compared to the original heuristic and other state-of-the-art heuristics, achieving better solution costs with shorter run times.
Recommendations
- Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining
- DB-HReduction: a data preprocessing algorithm for data mining applications
- An incremental attribute reduction method for dynamic data mining
- Mining classification rules with Reduced MEPAR-miner Algorithm
- On Approximation Algorithms for Data Mining Applications
- Exact and approximate minimal pattern mining
Cites work
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A heuristic column generation method for the heterogeneous fleet VRP
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
- A hybrid data mining GRASP with path-relinking
- A hybrid data mining metaheuristic for the p‐median problem
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Applications of the DM‐GRASP heuristic: a survey
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
- Hybridization of GRASP metaheuristic with data mining techniques
- Industrial aspects and literature survey: fleet composition and routing
- Making a state-of-the-art heuristic faster with data mining
- Network design for express shipment delivery
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- Routing a heterogeneous fleet of vehicles
- The fleet size and mix vehicle routing problem
- The Vehicle Scheduling Problem with Multiple Vehicle Types
- Thirty years of heterogeneous vehicle routing
- TTT plots: a perl program to create time-to-target plots
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
Cited in
(7)- Making a state-of-the-art heuristic faster with data mining
- Metaheuristics for data mining
- Hybridization of GRASP metaheuristic with data mining techniques
- New variable-length data compression scheme for solution representation of meta-heuristics
- Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining
- An improved hybrid genetic search with data mining for the CVRP
- Solving heterogeneous vehicle routing problems using decomposition and set covering
This page was built for publication: MineReduce: an approach based on data mining for problem size reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664324)
