The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
From MaRDI portal
Publication:5434593
DOI10.1002/net.20209zbMath1146.90056OpenAlexW4256246856MaRDI QIDQ5434593
Hipólito Hernández-Pérez, Juan-José Salazar-González
Publication date: 7 January 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20209
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (24)
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ The static bicycle relocation problem with demand intervals ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ An exact algorithm for the static rebalancing problem arising in bicycle sharing systems ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A branch-and-cut algorithm for the preemptive swapping problem ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ A branch‐and‐cut algorithm for the nonpreemptive swapping problem ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands ⋮ The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
This page was built for publication: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
