An ILP improvement procedure for the open vehicle routing problem
From MaRDI portal
Publication:991364
DOI10.1016/J.COR.2010.02.010zbMATH Open1231.90413OpenAlexW2161130615MaRDI QIDQ991364FDOQ991364
Authors: Majid Salari, Paolo Toth, Andrea Tramontani 
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
Recommendations
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- A new tabu search heuristic for the open vehicle routing problem
- A heuristic method for the open vehicle routing problem
- A new ILP-based refinement heuristic for vehicle routing problems
- An integer linear programming local search for capacitated vehicle routing problems
Applications of mathematical programming (90C90) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Local branching
- 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 heuristic method for the open vehicle routing problem
- Handbooks in operations Research \& management science: Transportation
- A new tabu search heuristic for 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
- A tabu search algorithm for the open vehicle routing problem
- A general heuristic for vehicle routing problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- Title not available (Why is that?)
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A hybrid heuristic for an inventory routing problem
- An integer linear programming local search for capacitated vehicle routing problems
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- A simple and efficient tabu search heuristic for solving the open vehicle routing problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
Cited In (23)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- A multi-start algorithm for a balanced real-world open vehicle routing problem
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- Consolidating home meal delivery with limited operational disruption
- The close-open mixed vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- New notation and classification scheme for vehicle routing problems
- A new ILP-based refinement heuristic for vehicle routing problems
- Location‐routing problem: a classification of recent research
- The open vehicle routing problem with decoupling points
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- An ILP-based local search procedure for the VRP with pickups and deliveries
- The probabilistic uncapacitated open vehicle routing location problem
- Enhanced mixed integer programming techniques and routing problems
- An integer linear programming local search for capacitated vehicle routing problems
- A variable neighborhood search and its application to a ring star problem generalization
- The time constrained maximal covering salesman problem
- A survey on matheuristics for routing problems
- An integer programming-based local search for the covering salesman problem
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
Uses Software
This page was built for publication: An ILP improvement procedure for the open vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991364)
