A new ILP-based refinement heuristic for vehicle routing problems
From MaRDI portal
Publication:2583137
DOI10.1007/s10107-005-0662-8zbMath1085.90011OpenAlexW2081508128MaRDI QIDQ2583137
Roberto De Franceschi, Matteo Fischetti, Paolo Toth
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0662-8
HeuristicsComputational AnalysisDistance-Constrained Vehicle Routing ProblemLarge Neighborhood SearchVehicle Routing Problems
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines, The time constrained maximal covering salesman problem, MIPping closures: An instant survey, The mixed capacitated general routing problem under uncertainty, 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 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, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, A matheuristic for the asymmetric capacitated vehicle routing problem, Matheuristics: survey and synthesis, An ILP-refined tabu search for the directed profitable rural postman problem, An ILP-based local search procedure for the VRP with pickups and deliveries, 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, Generalized local branching heuristics and the capacitated ring tree problem, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, An integer programming-based local search for the covering salesman problem, Further extension of the TSP assign neighborhood, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, An ILP improvement procedure for the open vehicle routing problem, A survey on matheuristics for routing problems, A way to optimally solve a time-dependent vehicle routing problem with time windows, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Exponential neighbourhood local search for the traveling salesman problem
- Exponential irreducible neighborhoods for combinatorial optimization problems
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- BoneRoute: An adaptive memory-based method for effective fleet management
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
