The time-dependent capacitated profitable tour problem with time windows and precedence constraints
type: Item
instance of: scholarly article
title: The time-dependent capacitated profitable tour problem with time windows and precedence constraints
zbMATH Open document ID: 1375.90058
author: Peng Zhang
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6811980
zbMATH Keywords: transportation
zbMATH Keywords: profitable tour problem
zbMATH Keywords: pickup and delivery problem
zbMATH Keywords: tailored labeling algorithm
zbMATH Keywords: time-dependent travel times
MaRDI profile type: Publication
OpenAlex ID: W2735520899
cites work: The prize collecting traveling salesman problem
cites work: Q3993187
cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
cites work: Time dependent vehicle routing problem with a multi ant colony system
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: Approximation algorithms for time-dependent orienteering.
cites work: Restricted dynamic programming: a flexible framework for solving realistic VRPs
cites work: Orienteering problem: a survey of recent variants, solution approaches and applications
cites work: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
cites work: Vehicle dispatching with time-dependent travel times
cites work: The selective travelling salesman problem
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm
cites work: Q4310695
cites work: Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
cites work: The orienteering problem: a survey
cites work: A fast solution method for the time-dependent orienteering problem
cites work: Solving the stochastic time-dependent orienteering problem with time windows
cites work: Vehicle routing with dynamic travel times: a queueing approach
DOI: 10.1016/J.EJOR.2017.07.004
Recommended article: A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Recommended article: An integer programming approach for the time-dependent traveling salesman problem with time windows
Recommended article: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
Recommended article: Dynamic capacitated user-optimal departure time/route choice problem with time-window
Recommended article: Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
Recommended article: Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
Recommended article: Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
Recommended article: A branch-and-cut algorithm for the capacitated profitable tour problem
Recommended article: Multi-trip time-dependent vehicle routing problem with time windows
Recommended article: The vehicle routing problem with time windows and temporal dependencies
description: scientific article; zbMATH DE number 6811980