A hybrid algorithm for a class of vehicle routing problems
From MaRDI portal
Recommendations
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A general heuristic for vehicle routing problems
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A guide to vehicle routing heuristics
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- A method for solving traveling-salesman problems
- A new ILP-based refinement heuristic for vehicle routing problems
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- A simple and effective metaheuristic for the minimum latency problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A tabu search heuristic for the multi-depot vehicle routing problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A unified tabu search heuristic for vehicle routing problems with time windows
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- An integer linear programming local search for capacitated vehicle routing problems
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Probabilistic diversification and intensification in local search for vehicle routing
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
Cited in
(62)- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
- Multi-fleet feeder vehicle routing problem using hybrid metaheuristic
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- scientific article; zbMATH DE number 7347493 (Why is no real title available?)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- In-depth analysis of granular local search for capacitated vehicle routing
- Solution strategies for the vehicle routing problem with backhauls
- Shipper collaboration in forward and reverse logistics
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- Heuristics for vehicle routing problems: sequence or set optimization?
- Knowledge-guided local search for the vehicle routing problem
- Routing a mix of conventional, plug-in hybrid, and electric vehicles
- A survey on matheuristics for routing problems
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- A review of vehicle routing with simultaneous pickup and delivery
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- A matheuristic for the truck and trailer routing problem
- An iterated tabu search for the multi-compartment vehicle routing problem
- A matheuristic for the asymmetric capacitated vehicle routing problem
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- A matheuristic approach for the pollution-routing problem
- A matheuristic for the cell formation problem
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- The r‐interdiction selective multi‐depot vehicle routing problem
- The Vehicle Routing Problem with Release and Due Dates
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- Efficiently solving very large-scale routing problems
- scientific article; zbMATH DE number 2048626 (Why is no real title available?)
- Hybrid Bellman-Ford-Dijkstra algorithm
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- A performance study on multi improvement neighborhood search strategy
- A unified solution framework for multi-attribute vehicle routing problems
- Rich vehicle routing problems: from a taxonomy to a definition
- New benchmark instances for the capacitated vehicle routing problem
- scientific article; zbMATH DE number 5846596 (Why is no real title available?)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
- Routing one million customers in a handful of minutes
- On the exact solution of the multi-depot open vehicle routing problem
- An improved hybrid genetic search with data mining for the CVRP
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- Adjusting the order crossover operator for capacitated vehicle routing problems
This page was built for publication: A hybrid algorithm for a class of vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336559)
