The time-dependent capacitated profitable tour problem with time windows and precedence constraints

DOI10.1016/j.ejor.2017.07.004zbMath1375.90058OpenAlexW2735520899MaRDI QIDQ1681438

Peng Zhang

Publication date: 23 November 2017

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

Full work available at URL: http://hdl.handle.net/1871.1/ebacbcf1-66f7-429e-958e-6e0848dd8585

zbMATH Keywords

transportationpickup and delivery problemtime-dependent travel timesprofitable tour problemtailored labeling algorithm

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (12)

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 ⋮ A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows ⋮ Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows ⋮ Electric vehicle routing problem with time-dependent waiting times at recharging stations ⋮ A hybrid algorithm for time-dependent vehicle routing problem with time windows ⋮ A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints ⋮ Multi-trip time-dependent vehicle routing problem with time windows ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ Comments on: ``Perspectives on integer programming for time-dependent models ⋮ An assign-and-route matheuristic for the time-dependent inventory routing problem ⋮ A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The orienteering problem: a survey
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The selective travelling salesman problem
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Solving the stochastic time-dependent orienteering problem with time windows
• Restricted dynamic programming: a flexible framework for solving realistic VRPs
• Approximation algorithms for time-dependent orienteering.
• Vehicle dispatching with time-dependent travel times
• A fast solution method for the time-dependent orienteering problem
• Vehicle routing with dynamic travel times: a queueing approach
• Time dependent vehicle routing problem with a multi ant colony system
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• The prize collecting traveling salesman problem
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem

This page was built for publication: The time-dependent capacitated profitable tour problem with time windows and precedence constraints