Load-dependent and precedence-based models for pickup and delivery problems

DOI10.1016/j.cor.2015.04.008zbMath1349.90087OpenAlexW2154338060MaRDI QIDQ342036

Mario Ruthmair, Luís Gouveia

Publication date: 17 November 2016

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

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

zbMATH Keywords

transportationtraveling salesmanprecedence constraintspickup and deliverysequential ordering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (17)

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Layered graph approaches for combinatorial optimization problems ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem ⋮ An improved ant colony system for the sequential ordering problem ⋮ An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ Branch-and-bound for the precedence constrained generalized traveling salesman problem ⋮ The multi-pickup and delivery problem with time windows ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Perspectives on integer programming for time-dependent models ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hop constrained Steiner trees with multiple root nodes
• Natural and extended formulations for the time-dependent traveling salesman problem
• A hybrid particle swarm optimization approach for the sequential ordering 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
• A classification of formulations for the (time-dependent) traveling salesman problem
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• Greedy randomized adaptive search procedures
• The precedence-constrained asymmetric traveling salesman polytope
• The time dependent traveling salesman problem: polyhedra and algorithm
• The two-level diameter constrained spanning tree problem
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• Projection results for vehicle routing
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Multivalued Decision Diagrams for Sequencing Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• On extended formulations for the precedence constrained asymmetric traveling salesman problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Variable neighborhood search: Principles and applications

This page was built for publication: Load-dependent and precedence-based models for pickup and delivery problems