A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
From MaRDI portal
Publication:2242245
DOI10.1016/j.ejor.2021.05.040zbMath1487.90110OpenAlexW3165929423MaRDI QIDQ2242245
Hipólito Hernández-Pérez, Juan-José Salazar-González
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.05.040
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (3)
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ Research on improved ant colony optimization for traveling salesman problem
Cites Work
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
- Bike sharing systems: solving the static rebalancing problem
- Vehicle routing problems with split deliveries
This page was built for publication: A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
