scientific article; zbMATH DE number 1452993
From MaRDI portal
Publication:4955265
zbMath0997.90021MaRDI QIDQ4955265
James P. Kelly, Edward A. Wasil, I-Ming Chao, Bruce L. Golden
Publication date: 7 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Large-scale problems in mathematical programming (90C06) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (82)
A simple and effective evolutionary algorithm for the vehicle routing problem ⋮ Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm ⋮ A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem ⋮ Consolidating home meal delivery with limited operational disruption ⋮ Dynamic vehicle routing using genetic algorithms ⋮ 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 ⋮ Battery swap station location-routing problem with capacitated electric vehicles ⋮ Hybrid metaheuristics for the clustered 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 directed tabu search method for solving controlled Volterra integral equations ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ A general heuristic for vehicle routing problems ⋮ A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem ⋮ 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 exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ The open vehicle routing problem: algorithms, large-scale test problems, and computational results ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ 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 ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ What you should know about the vehicle routing problem ⋮ 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 ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Designing a multi-modal and variable-echelon delivery system for last-mile logistics ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. ⋮ A threshold accepting approach to the Open Vehicle Routing problem ⋮ What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ Efficiently solving very large-scale routing problems ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ Routing a Heterogeneous Fleet of Vehicles ⋮ Parallel Solution Methods for Vehicle Routing Problems ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ 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 cooperative parallel metaheuristic for the capacitated vehicle routing problem ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ Honey bees mating optimization algorithm for large scale vehicle routing problems ⋮ Very large-scale vehicle routing: new test problems, algorithms, and results ⋮ A TABU search heuristic for the team orienteering problem ⋮ Path relinking for the vehicle routing problem ⋮ Creating very large scale neighborhoods out of smaller ones by compounding moves ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ A library of local search heuristics for the vehicle routing problem ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ An adaptive VNS algorithm for vehicle routing problems with intermediate stops ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem ⋮ A dynamic vehicle routing problem with time-dependent travel times ⋮ A tabu search method for the truck and trailer routing problem ⋮ On the shortest path problem with negative cost cycles ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ A tabu search heuristic for the vehicle routing problem with private fleet and common carrier ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem ⋮ A new ILP-based refinement heuristic for vehicle routing problems ⋮ A memetic algorithm for the multiperiod vehicle routing problem with profit ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
This page was built for publication:
