The traveling purchaser problem with time-dependent quantities

DOI10.1016/j.cor.2017.01.001zbMath1391.90502OpenAlexW2569893621WikidataQ56476013 ScholiaQ56476013MaRDI QIDQ1652259

Renata Mansini, Michele Vindigni, Enrico Angelelli, Michel Gendreau

Publication date: 11 July 2018

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

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

zbMATH Keywords

traveling purchaser problembranching strategytime-dependent quantity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

The bi-objective traveling purchaser problem with deliveries ⋮ The traveling purchaser problem with fast service option ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Uses Software

• CPLEX
• MAXFLOW

Cites Work

• Unnamed Item
• A column generation approach for a school bus routing problem with resource constraints
• Time-dependent routing problems: a review
• Natural and extended formulations for the time-dependent traveling salesman problem
• Exploring greedy criteria for the dynamic traveling purchaser problem
• A heuristic approach for the travelling purchaser problem
• Models for a traveling purchaser problem with additional side-constraints
• Solving the asymmetric traveling purchaser problem
• Arc routing problems with time-dependent service costs
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• The traveling purchaser problem with budget constraint
• A classification of formulations for the (time-dependent) traveling salesman problem
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• Vehicle dispatching with time-dependent travel times
• The distance constrained multiple vehicle traveling purchaser problem
• A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
• Projection results for vehicle routing
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Efficient modeling of travel in networks with time-varying link speeds
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• A stochastic programming approach for the traveling purchaser problem
• Sequencing many jobs on a multi-purpose facility

This page was built for publication: The traveling purchaser problem with time-dependent quantities