The pickup and delivery traveling salesman problem with handling costs

DOI10.1016/J.EJOR.2016.07.009MaRDI QIDQ1752776zbMATH OpenOpenAlexFDO

Authors Marjolein Veenstra, Kees Jan Roodbergen, Iris F. A. Vis, Leandro C. Coelho

Publication date 24 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/78170109/The_pickup_and_delivery_traveling_salesman_problem_with_handling_costs.pdf

zbMATH Keywords

handling costsmetaheuristicspackingpickup and deliveryrouting

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• The pickup and delivery problem with time windows, multiple stacks, and handling operations

Cites work

• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A heuristic for the pickup and delivery traveling salesman problem
• A new extension of local search applied to the Dial-A-Ride problem
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
• An efficient implementation of local search algorithms for constrained routing problems
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• Optimization by simulated annealing
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• The multiple vehicle pickup and delivery problem with LIFO constraints
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• TSPLIB—A Traveling Salesman Problem Library
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading

Cited in

(17)

• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
• The pickup and delivery problem with time windows and handling operations
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• The traveling salesman problem with pickup, delivery, and ride-time constraints
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• Stow \& pick: optimizing combined stowing and picking tours in scattered storage warehouses

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: The pickup and delivery traveling salesman problem with handling costs

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