A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
From MaRDI portal
Publication:705506
DOI10.1016/j.dam.2003.09.013zbMath1058.90054OpenAlexW2031736545MaRDI QIDQ705506
Juan-José Salazar-González, Hipólito Hernández-Pérez
Publication date: 31 January 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.013
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot, A hybrid heuristic approach for the multi-commodity one-to-one 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, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, An adaptive large neighborhood search for relocating vehicles in electric carsharing services, Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, An exact algorithm for the static rebalancing problem arising in bicycle sharing systems, A branch-and-cut algorithm for the preemptive swapping problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A heuristic algorithm for a single vehicle static bike sharing rebalancing 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, 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, PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, Green split multiple-commodity pickup and delivery vehicle routing problem, A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem, Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems, An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation, Bike sharing systems: solving the static rebalancing problem, An exact method for the double TSP with multiple stacks, Single vehicle routing with a predefined customer sequence and multiple depot returns, A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, Balancing the stations of a self service “bike hire” system, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Inventory routing with pickups and deliveries, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, A branch‐and‐cut algorithm for the nonpreemptive swapping problem, The single-vehicle two-echelon one-commodity pickup and delivery problem, A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries, 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, Single-commodity vehicle routing problem with pickup and delivery service, Strong cuts from compatibility relations for the dial-a-ride problem, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Circular Jaccard distance based multi-solution optimization for traveling salesman problems, A truck scheduling problem arising in intermodal container transportation, Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Heuristics for the traveling salesman problem with pickup and delivery
- The travelling salesman problem with pick-up and delivery
- The traveling salesman problem with delivery and backhauls
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The swapping problem
- Set Partitioning: A survey
- The General Pickup and Delivery Problem
