Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
type: Item
instance of: scholarly article
title: Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
zbMATH Open document ID: 1391.90656
author: Hipólito Hernández-Pérez
author: Juan-José Salazar-González
author: Beatriz Santos-Hernández
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901633
zbMATH Keywords: travelling salesman
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: split demand
zbMATH Keywords: heuristics
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2018.04.016
OpenAlex ID: W2801120890
cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
cites work: The swapping problem
cites work: Branch-and-cut algorithms for the split delivery vehicle routing problem
cites work: Vehicle routing problems with split deliveries
cites work: Bike sharing systems: solving the static rebalancing problem
cites work: A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
cites work: A destroy and repair algorithm for the bike sharing rebalancing problem
cites work: An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
cites work: The static bicycle relocation problem with demand intervals
cites work: Load-dependent and precedence-based models for pickup and delivery problems
cites work: Q4414640
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: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
cites work: Models for the single-vehicle preemptive pickup and delivery problem
cites work: Variable neighborhood search
cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
cites work: The travelling salesman problem with pick-up and delivery
cites work: The graphical relaxation: A new framework for the symmetric traveling salesman polytope
cites work: Vehicle Routing
Wikidata QID: Q129925056
DOI: 10.1016/J.COR.2018.04.016
description: scientific article; zbMATH DE number 6901633