Examining the effects of construction heuristics and problem structure on solution quality of the vehicle routing problem with split deliveries and time windows
Explore this paper's citation graph
Summary
Results indicate construction method does not substantively impact solution quality while local search operators with faster run times tend to generate higher-quality solutions where solution quality is primarily total distance travelled by the fleet of delivery vehicles.
- Type
- article
- Published
- 2017-07-17
- Cited by
- 0
- References
- 32
- OpenAlex
- https://openalex.org/W2625139705
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:40776111
Keywords
Vehicle routing problem, Heuristics, Quality (philosophy), Computer science, Routing (electronic design automation)
References
- Ant Colony Optimisation for vehicle routing problems: from theory to applications.
- Solving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization
- Improving the Ant System: A Detailed Report on the MAX-MIN Ant System
- Optimization, Learning and Natural Algorithms
- Max-Min Ant System (MMAS) for Vehicle Routing Problem with Time Windows
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Ant colony system for a VRP with multiple time windows and multiple visits
- An Improved Ant Colony Algorithm for VRP Problem
- An ant colony optimization model: The period vehicle routing problem with time windows
- Metaheuristics in combinatorial optimization: Overview and conceptual comparison
- An Ant Colony Algorithm for the Capacitated Vehicle Routing
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
- Vehicle routing problems with split deliveries
- What you should know about the vehicle routing problem
- An improved ant colony optimization and its application to vehicle routing problem with time windows
- An improved Ant System algorithm for theVehicle Routing Problem
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows
- An overview of metaheuristics: accurate and efficient methods for optimisation
- Ant colony optimization techniques for the vehicle routing problem
Cited by
No citing papers recorded for this paper.
Related papers
- Emerging Research Fields in Vehicle Routing Problem: A Short Review
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Performance Analysis of Greedy-based Construction Heuristics on Classical Vehicle Routing Problem
- Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost
- A self-adaptive local search algorithm for the classical vehicle routing problem