A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
From MaRDI portal
Publication:959510
DOI10.1016/j.cor.2008.03.008zbMath1177.90343OpenAlexW2072003508MaRDI QIDQ959510
Inmaculada Rodríguez-Martín, Hipólito Hernández-Pérez, Juan-José Salazar-González
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.03.008
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (20)
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ A two-stage solution method for the annual dairy transportation problem ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Coordinating technician allocation and maintenance routing for offshore wind farms ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem ⋮ A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Planification des tournées dans le domaine de la messagerie rapide ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics ⋮ A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ A truck scheduling problem arising in intermodal container transportation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- The travelling salesman problem with pick-up and delivery
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- An annotated bibliography of GRASP-Part II: Applications
- Approximating Capacitated Routing and Delivery Problems
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- The General Pickup and Delivery Problem
- The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
