A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
Publication:1926735
DOI10.1016/J.EJOR.2012.01.036zbMath1253.90200OpenAlexW2156449943MaRDI QIDQ1926735
Dragan Urošević, Aleksandar Ilić, Saïd Hanafi, Nenad Mladenović
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.036
combinatorial optimizationmetaheuristicsvariable neighborhood searchpickup-and-delivery travelling salesman problem
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (32)
Cites Work
- Unnamed Item
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Attraction probabilities in variable neighborhood search
- The traveling salesman problem: An overview of exact and approximate algorithms
- Heuristics for the traveling salesman problem with pickup and delivery
- The travelling salesman problem with pick-up and delivery
- Variable neighborhood search
- Routing a vehicle of capacity greater than one
- Sequential search and its application to vehicle-routing problems
- First vs. best improvement: an empirical study
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
- Approximating Capacitated Routing and Delivery Problems
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- The General Pickup and Delivery Problem
- A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem