What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
From MaRDI portal
Publication:1734855
Recommendations
- A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- Selection of Vehicle Routing Heuristic Using Neural Networks
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- scientific article; zbMATH DE number 4181146
- Knowledge-guided local search for the vehicle routing problem
Cites work
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Comprehensible credit scoring models using rule extraction from support vector machines
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Guided Local Search
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- Random forests
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows
- To explain or to predict?
- What you should know about the vehicle routing problem
Cited in
(16)- A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Shared resources in collaborative vehicle routing
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- An attribute based similarity function for VRP decision support
- An improved hybrid genetic search with data mining for the CVRP
- An a-priori parameter selection approach to enhance the performance of genetic algorithms solving pickup and delivery problems
- A machine learning approach for predicting the best heuristic for a large scaled capacitated lotsizing problem
- Distance approximation to support customer selection in vehicle routing problems
- GRASP and VNS approaches for a vehicle routing problem with step cost functions
- A causal framework for stochastic local search optimization algorithms
- A large neighborhood search-based approach to tackle the very large scale team orienteering problem in industrial context
- A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
- Determining good solutions and validating them with a metaheuristic approach in social network influence minimization problems
- Feature-guided metaheuristic with diversity management for solving the capacitated vehicle routing problem
This page was built for publication: What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734855)
