scientific article; zbMATH DE number 3643061

Cited in

(only showing first 100 items - show all)

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
Combined location-routing problems -- a neural network approach
Local improvement in planar facility location using vehicle routing
A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
The savings algorithm for the vehicle routing problem
Polyhedral results for a vehicle routing problem
Topological design of telecommunication networks --- local access design methods
The vehicle routing problem: An overview of exact and approximate algorithms
Scheduling with neural networks -- the case of the Hubble Space Telescope
Planning models for freight transportation
Vehicle routing with a sparse feasibility graph
Combination of local search and CLP in the vehicle-fleet scheduling problem
Entwicklung eines hybriden genetischen Algorithmus zur Tourenplanung
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
A double annealing algorithm for discrete location/allocation problems
Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
Combination of geographical information system and efficient routing algorithms for real life distribution operations.
A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
Heuristic solutions to multi-depot location-routing problems
Separating capacity constraints in the CVRP using tabu search
Use of the BATA algorithm and MIS to solve the mail carrier 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
An exact algorithm for a vehicle-and-driver scheduling problem
A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
Stochastic local search with learning automaton for the swap-body vehicle routing problem
Mathematical models for green vehicle routing problems with pickup and delivery: a case of semiconductor supply chain
A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
The open vehicle routing problem with decoupling points
A matheuristic for the asymmetric capacitated vehicle routing problem
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
Adaptive large neighborhood search on the graphics processing unit
A genetic algorithm for a green vehicle routing problem
New benchmark instances for the capacitated vehicle routing problem
A hierarchical algorithm for the planar single-facility location routing problem
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
Active guided evolution strategies for large-scale vehicle routing problems with time windows
A heuristic algorithm for the truckload and less-than-truckload problem
Solving the vehicle routing problem with adaptive memory programming methodology
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Extensions to the generalised assignment heuristic for vehicle routing
Accelerating the convergence of subgradient optimisation
A visual interactive approach to vehicle routing
A simple and effective evolutionary algorithm for the vehicle routing problem
Routing problems: A bibliography
The simulated trading heuristic for solving vehicle routing problems
Probabilistic diversification and intensification in local search for vehicle routing
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems
Algorithms and codes for dense assignment problems: The state of the art
Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
Bin packing problem with conflicts and item fragmentation
The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
Vehicle routing for milk collection with gradual blending: a case arising in Chile
A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
A generic exact solver for vehicle routing and related problems
A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
On the minimum clique partitioning problem on weighted chordal graphs
A lexicographic minimax approach to the vehicle routing problem with route balancing
The split delivery vehicle routing problem with three-dimensional loading constraints
Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
Solving the vehicle routing problem with multi-compartment vehicles for city logistics
Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
An effective PSO-inspired algorithm for the team orienteering problem
A matheuristic for the truck and trailer routing problem
Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Planning and approximation models for delivery route based services with price-sensitive demands
A variable neighbourhood search algorithm for the open vehicle routing problem
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
Heuristics for the lexicographic Max-ordering vehicle routing problem
Operations research at container terminals: a literature update
Very large-scale vehicle routing: new test problems, algorithms, and results
Creating very large scale neighborhoods out of smaller ones by compounding moves
Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
A memetic algorithm for the multi trip vehicle routing problem
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
A survey of variants and extensions of the location-routing problem
A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
A review of vehicle routing with simultaneous pickup and delivery
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
Simultaneously exploiting two formulations: an exact Benders decomposition approach

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 Q3048611)