The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Transportation Science

• Publication date

  2010-08-01

• Fields of study

  Business, Engineering, Computer Science

• Identifiers
  DOI 10.1287/trsc.1100.0316
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

  2010cited by this paper
• Exact solutions to the double travelling salesman problem with multiple stacks

  2010cited by this paper
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries

  2009cited by this paper
• The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches

  2009cited by this paper
• The pickup and delivery traveling salesman problem with first-in-first-out loading

  2009cited by this paper
• Traveling Salesman Problem

  2008cited by this paper
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems

  2008cited by this paper
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

  2007cited by this paper
• General solutions to the single vehicle routing problem with pickups and deliveries

  2007cited by this paper
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

  2007cited by this paper
• Static pickup and delivery problems: a classification scheme and survey

  2007cited by this paper
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search

  2006influential reference
• Partitioning procedures for solving mixed-variables programming problems

  2005cited by this paper
• Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation

  2002cited by this paper
• Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities

  2002cited by this paper
• Heuristics for the traveling salesman problem with pickup and delivery

  1999cited by this paper
• Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO

  1997cited by this paper
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem

  1997cited by this paper
• Combinatorial algorithms for stacking problems

  1989cited by this paper
• OPTIMAL ROUTING OF A SINGLE VEHICLE WITH LOADING AND UNLOADING CONSTRAINTS

  1984cited by this paper
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

  1981cited by this paper
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

  1972influential reference

• Stow & pick: Optimizing combined stowing and picking tours in scattered storage warehouses

  2025cites this paper
• The truck-and-robot routing problem with pickups and deliveries

  2025cites this paper
• High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study

  2024cites this paper
• The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode

  2024cites this paper
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery

  2023cites this paper
• ARAÇ ROTALAMA PROBLEMLERİNDE SEZGİSEL YÖNTEMLERİN KULLANIMI VE BİR UYGULAMA

  2023cites this paper
• Selection of auto-carrier loading policy in automobile shipping

  2023influential citation
• A Selective Many-to-Many Pickup and Delivery Problem With Handling Cost in the Omni-Channel Last-Mile Delivery

  2022cites this paper
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs

  2022cites this paper
• Interactive planning of revisiting-free itinerary for signed-for delivery

  2022cites this paper
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry

  2022cites this paper
• Minimizing the handling time in VRP with pickup-and-delivery and time windows

  2021influential citation
• An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs

  2020cites this paper
• Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem

  2020influential citation
• The vehicle routing problem with simultaneous pickup and delivery and handling costs

  2020influential citation
• The pickup and delivery problem with time windows, multiple stacks, and handling operations

  2020cites this paper
• Simulated annealing algorithm for solving pickup and delivery problem with LIFO, time duration and limited vehicle number

  2019cites this paper
• A concise guide to existing and emerging vehicle routing problem variants

  2019cites this paper
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

  2019cites this paper
• An efficient two-stage method for solving the order-picking problem

  2019cites this paper
• Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit

  2019cites this paper
• Optimal Delivery Routing in Road Network With Occupancy Detection

  2019cites this paper
• Multi-vehicle selective pickup and delivery using metaheuristic algorithms

  2017cites this paper
• The pickup and delivery traveling salesman problem with handling costs

  2017cites this paper
• Formulations and algorithms for rich routing problems

  2017cites this paper
• The pickup and delivery problem with time windows and handling operations

  2017cites this paper
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

  2017cites this paper
• A branch-and-cut framework for the consistent traveling salesman problem

  2016cites this paper
• Minimizing takeoff and landing risk in helicopter pickup and delivery operations

  2015cites this paper
• An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot

  2015cites this paper
• A study of perturbation operators for the pickup and delivery traveling salesman problem with LIFO or FIFO loading

  2015cites this paper
• Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading

  2015cites this paper
• The multiple vehicle pickup and delivery problem with LIFO constraints

  2015cites this paper
• Vehicle routing problem with deliveries and pickups: Modelling issues and meta-heuristics solution approaches

  2014cites this paper
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

  2014cites this paper
• Pickup-and-Delivery Problems for Goods Transportation

  2014cites this paper
• Rich routing problems arising in supply chain management

  2013influential citation
• AN ANNOTATED BIBLIOGRAPHY OF COMBINED ROUTING AND LOADING PROBLEMS

  2013cites this paper
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints

  2013cites this paper
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks

  2013cites this paper
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

  2012cites this paper
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

  2012cites this paper
• The Traveling Salesman Problem with Draft Limits

  2012cites this paper
• The vehicle routing problem with restricted mixing of deliveries and pickups

  2012influential citation
• Exact and heuristic algorithms for routing problems

  2011cites this paper
• Comments on: Routing problems with loading constraints

  2010cites this paper
• A Branch-and-Bound Algorithm for the Double TSP with Two Stacks

  2010cites this paper
• Routing problems with loading constraints

  2010cites this paper