An integer linear programming local search for capacitated vehicle routing problems
From MaRDI portal
Recommendations
- A new ILP-based refinement heuristic for vehicle routing problems
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- A fast multi-neighborhood iterated local search algorithm for vehicle routing problems
- An ILP-based local search procedure for the VRP with pickups and deliveries
- An ILP improvement procedure for the open vehicle routing problem
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 1054962 (Why is no real title available?)
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A general heuristic for vehicle routing problems
- A new ILP-based refinement heuristic for vehicle routing problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A reactive tabu search for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Handbooks in operations Research \& management science: Transportation
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- New heuristics for the vehicle routing problem
- On the capacitated vehicle routing problem
- Parallel iterative search methods for vehicle routing problems
- Probabilistic diversification and intensification in local search for vehicle routing
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- The granular tabu search and its application to the vehicle-routing problem
- The vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(21)- A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
- An exponential (matching based) neighborhood for the vehicle routing problem
- A fast multi-neighborhood iterated local search algorithm for vehicle routing problems
- scientific article; zbMATH DE number 5667551 (Why is no real title available?)
- Hybridizations of evolutionary algorithms with large neighborhood search
- A hybrid algorithm for a class of vehicle routing problems
- Integer linear programming models for global routing
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- An effective matheuristic for the capacitated total quantity discount problem
- An ILP improvement procedure for the open vehicle routing problem
- Large neighborhood and hybrid genetic search for inventory routing problems
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- A new ILP-based refinement heuristic for vehicle routing problems
- An ILP-based local search procedure for the VRP with pickups and deliveries
- scientific article; zbMATH DE number 1766758 (Why is no real title available?)
- Enhanced mixed integer programming techniques and routing problems
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- The time constrained maximal covering salesman problem
- In-depth analysis of granular local search for capacitated vehicle routing
- An integer programming-based local search for the covering salesman problem
This page was built for publication: An integer linear programming local search for capacitated vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564361)
