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

DOI10.1016/J.EJOR.2019.07.014MaRDI QIDQ2029262zbMATH OpenOpenAlexWikidataFDO

Authors 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

branch and cutinteger programmingprofitable tour problemtime-dependent travel timestraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut algorithm for the capacitated profitable tour problem
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• A branch-and-cut framework for the consistent traveling salesman problem
• A new branch-and-price algorithm for the traveling tournament problem
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

Cites work

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

Cited in

(8)

• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Branch-and-check approaches for the tourist trip design problem with rich constraints
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
• A matheuristic for the split delivery capacitated profitable tour problem with incomplete service
• A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
• A novel robust decomposition algorithm for a profit-oriented production routing problem with backordering, uncertain prices, and service level constraints

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029262)