A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints

DOI10.1016/j.ejor.2019.07.014zbMath1487.90623OpenAlexW2962099521WikidataQ127528511 ScholiaQ127528511MaRDI QIDQ2029262

Gonzalo Lera-Romero, Juan José Miranda-Bront

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingtraveling salesmanbranch and cuttime-dependent travel timesprofitable tour problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (2)

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem

Uses Software

• VRP

Cites Work

• Integer programming formulations for the elementary shortest path problem
• Time-dependent routing problems: a review
• An integer programming approach for the time-dependent traveling salesman problem with time windows
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• Vehicle dispatching with time-dependent travel times
• The precedence-constrained asymmetric traveling salesman polytope
• The time dependent traveling salesman problem: polyhedra and algorithm
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• A branch-and-cut algorithm for the capacitated profitable tour problem
• A note on the separation of subtour elimination constraints in elementary shortest path problems
• A fast solution method for the time-dependent orienteering problem
• The time-dependent orienteering problem with time windows: a fast ant colony system
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
• Solving elementary shortest-path problems as mixed-integer programs
• Facets and valid inequalities for the time-dependent travelling salesman problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Vehicle Routing
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

This page was built for publication: A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints