The pickup and delivery traveling salesman problem with handling costs
From MaRDI portal
Publication:1752776
DOI10.1016/j.ejor.2016.07.009zbMath1394.90501OpenAlexW2471268145MaRDI QIDQ1752776
Kees Jan Roodbergen, Marjolein Veenstra, 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
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (10)
The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ 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 ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
Uses Software
Cites Work
- Optimization by Simulated Annealing
- The multiple vehicle pickup and delivery problem with LIFO constraints
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- An efficient implementation of local search algorithms for constrained routing problems
- The pickup and delivery traveling salesman problem with first-in-first-out loading
- A new extension of local search applied to the Dial-A-Ride problem
- A heuristic for the pickup and delivery traveling salesman problem
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- TSPLIB—A Traveling Salesman Problem Library
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
This page was built for publication: The pickup and delivery traveling salesman problem with handling costs
