A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

DOI10.1016/J.EJOR.2021.05.040MaRDI QIDQ2242245zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2021.05.040

zbMATH Keywords

bike shared systempickup-and-deliverysplit demandtravelling salesmanvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• Branch-and-cut algorithms for the split delivery vehicle routing problem

Cites work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
• Bike sharing systems: solving the static rebalancing problem
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
• Vehicle routing problems with split deliveries

Cited in

(12)

• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem
• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
• Research on improved ant colony optimization for traveling salesman problem
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs
• 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
• A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries
• The robust bike sharing rebalancing problem: formulations and a branch-and-cut algorithm
• The generator distribution problem for base stations during emergency power outage: a branch-and-price-and-cut approach
• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
• Title not available (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242245)