An ILP-based local search procedure for the VRP with pickups and deliveries
From MaRDI portal
Publication:1698289
DOI10.1007/s10479-017-2520-5zbMath1384.90014OpenAlexW2615749417MaRDI QIDQ1698289
Juan José Miranda-Bront, Isabel Méndez-Díaz, Agustín Montero
Publication date: 15 February 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2520-5
Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
TLHSA and SACA: two heuristic algorithms for two variant VRP models ⋮ A multi-objective humanitarian pickup and delivery vehicle routing problem with drones
Uses Software
Cites Work
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- The vehicle routing problem. Latest advances and new challenges.
- An ILP improvement procedure for the open vehicle routing problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Local branching
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A note on ``A LP-based heuristic for a time-constrained routing problem
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search and local branching
- A survey on matheuristics for routing problems
- A new ILP-based refinement heuristic for vehicle routing problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Vehicle Routing
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: An ILP-based local search procedure for the VRP with pickups and deliveries