An ILP-based local search procedure for the VRP with pickups and deliveries
type: Item
instance of: scholarly article
title: An ILP-based local search procedure for the VRP with pickups and deliveries
zbMATH Open document ID: 1384.90014
author: Agustín Montero
author: Juan José Miranda-Bront
author: Isabel Méndez-Díaz
published in: Annals of Operations Research
publication date: 2018-02-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6839492
zbMATH Keywords: VRP with pickups and deliveries
zbMATH Keywords: integer linear programming
zbMATH Keywords: matheuristic
describes a project that uses: LKH
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10479-017-2520-5
OpenAlex ID: W2615749417
cites work: A survey on matheuristics for routing problems
cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: The dial-a-ride problem: Models and algorithms
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: A new ILP-based refinement heuristic for vehicle routing problems
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: Local branching
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: Variable neighborhood search and local branching
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
cites work: A note on ``A LP-based heuristic for a time-constrained routing problem''
cites work: An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
cites work: A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
cites work: An ILP improvement procedure for the open vehicle routing problem
cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
cites work: Vehicle Routing
DOI: 10.1007/S10479-017-2520-5
description: scientific article; zbMATH DE number 6839492