The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
From MaRDI portal
Publication:3091523
DOI10.1007/978-3-642-21527-8_45zbMath1345.90078OpenAlexW50311049MaRDI QIDQ3091523
Inmaculada Rodríguez-Martín, Juan-José Salazar-González
Publication date: 9 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_45
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) 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 ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ A survey on matheuristics for routing problems ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
