scientific article; zbMATH DE number 1452993
From MaRDI portal
Publication:4955265
Recommendations
- Metaheuristics in combinatorial optimization
- New heuristics for the vehicle routing problem
- Metaheuristics applied to vehicle routing. A case study. I: Formulating the problem
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
Cited in
(92)- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- An iterated tabu search for the multi-compartment vehicle routing problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Large-scale vehicle routing problems: quantum annealing, tunings and results
- Stochastic local search with learning automaton for the swap-body vehicle routing problem
- An efficient implementation of a static move descriptor-based local search heuristic
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- Efficiently solving very large-scale routing problems
- New benchmark instances for the capacitated vehicle routing problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- A TABU search heuristic for the team orienteering problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A dynamic vehicle routing problem with time-dependent travel times
- A simple and effective evolutionary algorithm for the vehicle routing problem
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
- A memetic algorithm for the multiperiod vehicle routing problem with profit
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- Dynamic vehicle routing using genetic algorithms
- A directed tabu search method for solving controlled Volterra integral equations
- Improved branch-cut-and-price for capacitated vehicle routing
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Path relinking for the vehicle routing problem
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- A unified solution framework for multi-attribute vehicle routing problems
- Implicit depot assignments and rotations in vehicle routing heuristics
- A new ILP-based refinement heuristic for vehicle routing problems
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems
- Metaheuristics applied to vehicle routing. A case study. I: Formulating the problem
- Consolidating home meal delivery with limited operational disruption
- Battery swap station location-routing problem with capacitated electric vehicles
- Hybrid metaheuristics for the clustered vehicle routing problem
- What you should know about the vehicle routing problem
- Routing a heterogeneous fleet of vehicles
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Parallel solution methods for vehicle routing problems
- An integer linear programming local search for capacitated vehicle routing problems
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
- Application of metaheuristics to large-scale transportation problems
- A threshold accepting approach to the Open Vehicle Routing problem
- A tabu search method for the truck and trailer routing problem
- On the shortest path problem with negative cost cycles
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
- Bi‐objective green vehicle routing problem
- Designing a multi-modal and variable-echelon delivery system for last-mile logistics
- Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- An improved hybrid genetic search with data mining for the CVRP
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A flexible variable neighbourhood search algorithm for different variants of the electric vehicle routing problem
- A library of local search heuristics for the vehicle routing problem
- TuneNSearch: a hybrid transfer learning and local search approach for solving vehicle routing problems
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- A general heuristic for vehicle routing problems
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955265)
