An ILP improvement procedure for the open vehicle routing problem

DOI10.1016/J.COR.2010.02.010MaRDI QIDQ991364zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• A general heuristic for vehicle routing problems
• A heuristic method for the open vehicle routing problem
• A hybrid heuristic for an inventory routing problem
• A new ILP-based refinement heuristic for 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
• A tabu search algorithm for the open vehicle routing problem
• A threshold accepting approach to the Open Vehicle Routing problem
• A variable neighbourhood search algorithm for the open vehicle routing problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• An integer linear programming local search for capacitated vehicle routing problems
• Combination of geographical information system and efficient routing algorithms for real life distribution operations.
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Handbooks in operations Research \& management science: Transportation
• Local branching
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• The vehicle routing problem

Cited in

(23)

• The probabilistic uncapacitated open vehicle routing location problem
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem
• A variable neighborhood search and its application to a ring star problem generalization
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• An ILP-based local search procedure for the VRP with pickups and deliveries
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
• An integer linear programming local search for capacitated vehicle routing problems
• 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
• A survey on matheuristics for routing problems
• The close-open mixed vehicle routing problem
• The time constrained maximal covering salesman problem
• An integer programming-based local search for the covering salesman problem
• The open vehicle routing problem with decoupling points
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• Enhanced mixed integer programming techniques and routing problems
• Consolidating home meal delivery with limited operational disruption
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem

Describes a project that uses

Uses Software

• CPLEX
• VRP

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)