Models for the single-vehicle preemptive pickup and delivery problem

DOI10.1007/s10878-010-9349-zzbMath1242.90196OpenAlexW2101910194MaRDI QIDQ421257

Hervé L. M. Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub

Publication date: 23 May 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9349-z

zbMATH Keywords

complexityinteger linear programsminimal representationspickup and deliverypreemptive stacker crane problemreloadsseparation problems

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (4)

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Unnamed Item ⋮ Preemptive stacker crane problem: extending tree-based properties and construction heuristics

Uses Software

• TSPLIB
• CPLEX
• Boost
• BGL
• Rudy

Cites Work

• Unnamed Item
• Planning models for long-haul operations of postal and express shipment companies
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• NP-completeness of some edge-disjoint paths problems
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The preemptive swapping problem on a tree
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• TSPLIB—A Traveling Salesman Problem Library
• Preemptive Ensemble Motion Planning on a Tree
• The General Pickup and Delivery Problem

This page was built for publication: Models for the single-vehicle preemptive pickup and delivery problem