A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
type: Item
instance of: scholarly article
title: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
zbMATH Open document ID: 1253.90200
author: Dragan Urošević
author: Saïd Hanafi
author: Aleksandar Ilić
author: Nenad Mladenović
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6119357
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: pickup-and-delivery travelling salesman problem
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.01.036
OpenAlex ID: W2156449943
cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
cites work: Attraction probabilities in variable neighborhood search
cites work: Approximating Capacitated Routing and Delivery Problems
cites work: Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
cites work: Heuristics for the traveling salesman problem with pickup and delivery
cites work: An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
cites work: Routing a vehicle of capacity greater than one
cites work: First vs. best improvement: an empirical study
cites work: Variable neighbourhood search: methods and applications
cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
cites work: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Sequential search and its application to vehicle-routing problems
cites work: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
cites work: Q4875205
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Variable neighborhood search
cites work: The travelling salesman problem with pick-up and delivery
cites work: A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
cites work: Traveling salesman problem heuristics: leading methods, implementations and latest advances
cites work: The General Pickup and Delivery Problem
DOI: 10.1016/J.EJOR.2012.01.036
description: scientific article; zbMATH DE number 6119357