Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

DOI10.1016/j.cor.2018.04.016zbMath1391.90656OpenAlexW2801120890WikidataQ129925056 ScholiaQ129925056MaRDI QIDQ1652698

Beatriz Santos-Hernández, Hipólito Hernández-Pérez, Juan-José Salazar-González

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.016

zbMATH Keywords

heuristicsvehicle routing problemtravelling salesmansplit demand

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands ⋮ Transportation Problem Allowing Sending and Bringing Back ⋮ Transportation problem on a graph

Uses Software

• VRP

Cites Work

• Unnamed Item
• The static bicycle relocation problem with demand intervals
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
• Load-dependent and precedence-based models for pickup and delivery problems
• A destroy and repair algorithm for the bike sharing rebalancing problem
• Models for the single-vehicle preemptive pickup and delivery problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The travelling salesman problem with pick-up and delivery
• Variable neighborhood search
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• Bike sharing systems: solving the static rebalancing problem
• Vehicle Routing
• The swapping problem
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Vehicle routing problems with split deliveries
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms

This page was built for publication: Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem