A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem

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

zbMATH Keywords

combinatorial optimizationmetaheuristicsvariable neighborhood searchpickup-and-delivery travelling salesman problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (32)

An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ The multi-vehicle profitable pickup and delivery problem ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Nested general variable neighborhood search for the periodic maintenance problem ⋮ Two level general variable neighborhood search for attractive traveling salesman problem ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ Two multi-start heuristics for the \(k\)-traveling salesman problem ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ A general variable neighborhood search variants for the travelling salesman problem with draft limits ⋮ Variable neighborhood search for metric dimension and minimal doubly resolving set problems ⋮ A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem ⋮ In memory of Professor Nenad Mladenović (1951--2022) ⋮ General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Order matters -- a variable neighborhood search for the swap-body vehicle routing problem ⋮ Variable neighborhood search for the travelling deliveryman problem ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ The multi-commodity pickup-and-delivery traveling salesman problem

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