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

From MaRDI portal
Revision as of 15:10, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (32)

An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depotThe multi-vehicle profitable pickup and delivery problemA population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problemMulti-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailerA hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problemNested general variable neighborhood search for the periodic maintenance problemTwo level general variable neighborhood search for attractive traveling salesman problemSkewed general variable neighborhood search for the location routing scheduling problemA hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraintsHeuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problemA destroy and repair algorithm for the bike sharing rebalancing problemTwo multi-start heuristics for the \(k\)-traveling salesman problemScalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan RegionAn adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problemA general variable neighborhood search variants for the travelling salesman problem with draft limitsVariable neighborhood search for metric dimension and minimal doubly resolving set problemsA multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problemIn memory of Professor Nenad Mladenović (1951--2022)General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visitsA branch-and-cut algorithm for the one-commodity pickup and delivery location routing problemOrder matters -- a variable neighborhood search for the swap-body vehicle routing problemVariable neighborhood search for the travelling deliveryman problemA general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobsBike sharing systems: solving the static rebalancing problemHybrid evolutionary search for the traveling repairman problem with profitsA survey on the applications of variable neighborhood search algorithm in healthcare managementA branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problemMaking the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problemA variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problemsParallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deteriorationThe single-vehicle two-echelon one-commodity pickup and delivery problemThe multi-commodity pickup-and-delivery traveling salesman problem




Cites Work




This page was built for publication: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem