The pickup and delivery traveling salesman problem with first-in-first-out loading

DOI10.1016/J.COR.2008.05.005zbMATH Open1179.90280OpenAlexW2010102206MaRDI QIDQ1000960FDOQ1000960

Authors: Jean-François Cordeau, G. Laporte, Güneş Erdogăn 

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.05.005

Recommendations

• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• The travelling salesman problem with pick-up and delivery
• Heuristics for the traveling salesman problem with pickup and delivery

zbMATH Keywords

integer programmingtraveling salesman problemtabu searchiterated local searchpickup and deliveryfirst-in-first-out

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Handbooks in operations Research \& management science: Transportation
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A new extension of local search applied to the Dial-A-Ride problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Recent models and algorithms for one-to-one pickup and delivery problems
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• Heuristics for the traveling salesman problem with pickup and delivery
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• A heuristic for the pickup and delivery traveling salesman problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• An efficient implementation of local search algorithms for constrained routing problems
• Title not available (Why is that?)

Cited In (22)

• The traveling salesman problem with pickup, delivery, and ride-time constraints
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• Routing problems with loading constraints
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
• A heuristic for the pickup and delivery traveling salesman problem
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
• The pickup and delivery traveling salesman problem with handling costs
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• The traveling salesman problem with draft limits
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• The unit capacity pickup and delivery problem on a one-way loop
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• A branch-and-bound algorithm for the double travelling salesman problem with two stacks

Uses Software

• TSPLIB

This page was built for publication: The pickup and delivery traveling salesman problem with first-in-first-out loading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1000960)