A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
From MaRDI portal
Publication:2359136
DOI10.1007/s10732-012-9210-xzbMath1365.90293OpenAlexW2040371063MaRDI QIDQ2359136
Juan-José Salazar-González, Inmaculada Rodríguez-Martín
Publication date: 27 June 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-012-9210-x
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ An ILP-based local search procedure for the VRP with pickups and deliveries ⋮ A survey on matheuristics for routing problems ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
Uses Software
Cites Work
- Unnamed Item
- Models for the single-vehicle preemptive pickup and delivery problem
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Variable neighborhood search
- Local branching
- A heuristic for the pickup and delivery traveling salesman problem
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Greedy randomized adaptive search procedures
- The traveling salesman problem with backhauls
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Matheuristics
- The swapping problem
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- The General Pickup and Delivery Problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
