The pickup and delivery traveling salesman problem with handling costs
type: Item
instance of: scholarly article
title: The pickup and delivery traveling salesman problem with handling costs
zbMATH Open document ID: 1394.90501
author: Marjolein Veenstra
author: Kees Jan Roodbergen
author: Iris F. A. Vis
author: Leandro C. Coelho
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
full work available at URL: The pickup and delivery traveling salesman problem with handling costs.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6872914
zbMATH Keywords: routing
zbMATH Keywords: pickup and delivery
zbMATH Keywords: packing
zbMATH Keywords: handling costs
zbMATH Keywords: metaheuristics
describes a project that uses: TSPLIB
MaRDI profile type: Publication
OpenAlex ID: W2471268145
cites work: An adaptive large neighborhood search for a vehicle routing problem with multiple routes
cites work: The multiple vehicle pickup and delivery problem with LIFO constraints
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
cites work: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
cites work: The pickup and delivery traveling salesman problem with first-in-first-out loading
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: Optimization by Simulated Annealing
cites work: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
cites work: A heuristic for the pickup and delivery traveling salesman problem
cites work: An efficient implementation of local search algorithms for constrained routing problems
DOI: 10.1016/J.EJOR.2016.07.009
description: scientific article; zbMATH DE number 6872914