A new ILP-based refinement heuristic for vehicle routing problems
From MaRDI portal
Publication:2583137
Recommendations
- An integer linear programming local search for capacitated vehicle routing problems
- An ILP improvement procedure for the open vehicle routing problem
- Heuristic procedures for the capacitated vehicle routing problem
- New exact method for large asymmetric distance-constrained vehicle routing problem
- Recent advances in vehicle routing exact algorithms
Cites work
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A survey of very large-scale neighborhood search techniques
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- BoneRoute: An adaptive memory-based method for effective fleet management
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Exponential irreducible neighborhoods for combinatorial optimization problems
- Exponential neighbourhood local search for the traveling salesman problem
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 2134197 (Why is no real title available?)
- scientific article; zbMATH DE number 2064409 (Why is no real title available?)
- scientific article; zbMATH DE number 2064411 (Why is no real title available?)
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- scientific article; zbMATH DE number 956786 (Why is no real title available?)
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- New heuristics for the vehicle routing problem
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(32)- A way to optimally solve a time-dependent vehicle routing problem with time windows
- The time constrained maximal covering salesman problem
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Large-scale vehicle routing problems: quantum annealing, tunings and results
- A matheuristic for the asymmetric capacitated vehicle routing problem
- An ILP-based local search procedure for the VRP with pickups and deliveries
- Generalized local branching heuristics and the capacitated ring tree problem
- An integer programming-based local search for the covering salesman problem
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- MIPping closures: An instant survey
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Further extension of the TSP assign neighborhood
- A survey on matheuristics for routing problems
- The mixed capacitated general routing problem under uncertainty
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- Consolidating home meal delivery with limited operational disruption
- A hybrid algorithm for a class of vehicle routing problems
- An effective matheuristic for the capacitated total quantity discount problem
- An integer linear programming local search for capacitated vehicle routing problems
- An ILP-refined tabu search for the directed profitable rural postman problem
- The capacitated general windy routing problem with turn penalties
- Kernel search: a new heuristic framework for portfolio selection
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- Matheuristics: survey and synthesis
- Contemporary approaches in matheuristics an updated survey
- An ILP improvement procedure for the open vehicle routing problem
This page was built for publication: A new ILP-based refinement heuristic for vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583137)
