An ILP improvement procedure for the open vehicle routing problem

DOI10.1016/j.cor.2010.02.010zbMath1231.90413OpenAlexW2161130615MaRDI QIDQ991364

Paolo Toth, Andrea Tramontani, Majid Salari

Publication date: 7 September 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.02.010

zbMATH Keywords

heuristicslocal searchinteger linear programmingopen vehicle routing problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (20)

A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization ⋮ A multi-start algorithm for a balanced real-world open vehicle routing problem ⋮ The time constrained maximal covering salesman problem ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ Consolidating home meal delivery with limited operational disruption ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ The close-open mixed vehicle routing problem ⋮ The open vehicle routing problem with decoupling points ⋮ Location‐routing problem: a classification of recent research ⋮ An ILP-based local search procedure for the VRP with pickups and deliveries ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ Enhanced mixed integer programming techniques and routing problems ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ An integer programming-based local search for the covering salesman problem ⋮ A survey on matheuristics for routing problems ⋮ A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A tabu search algorithm for the open vehicle routing problem
• A general heuristic for vehicle routing problems
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• Combination of geographical information system and efficient routing algorithms for real life distribution operations.
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A variable neighbourhood search algorithm for the open vehicle routing problem
• A new ILP-based refinement heuristic for vehicle routing problems
• The Vehicle Routing Problem
• A Hybrid Heuristic for an Inventory Routing Problem
• A heuristic method for the open vehicle routing problem
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• A new tabu search heuristic for the open vehicle routing problem
• A simple and efficient tabu search heuristic for solving the open vehicle routing problem
• Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
• A threshold accepting approach to the Open Vehicle Routing problem

This page was built for publication: An ILP improvement procedure for the open vehicle routing problem