The pickup and delivery traveling salesman problem with first-in-first-out loading
type: Item
instance of: scholarly article
title: The pickup and delivery traveling salesman problem with first-in-first-out loading
zbMATH Open document ID: 1179.90280
author: Jean-François Cordeau
author: G. Laporte
author: Güneş Erdogăn
published in: Computers \& Operations Research
publication date: 2009-02-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5506609
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: pickup and delivery
zbMATH Keywords: first-in-first-out
zbMATH Keywords: integer programming
zbMATH Keywords: tabu search
zbMATH Keywords: iterated local search
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.cor.2008.05.005
OpenAlex ID: W2010102206
cites work: Q3523238
cites work: Q4944966
cites work: Optimal routing of multiple-load AGV subject to LIFO loading constraints
cites work: An algorithm for the traveling salesman problem with pickup and delivery customers
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: An efficient implementation of local search algorithms for constrained routing problems
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm
cites work: A heuristic for the pickup and delivery traveling salesman problem
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: Heuristics for the traveling salesman problem with pickup and delivery
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: TSPLIB—A Traveling Salesman Problem Library
DOI: 10.1016/J.COR.2008.05.005
description: scientific article; zbMATH DE number 5506609