The time-dependent prize-collecting arc routing problem
DOI10.1016/J.COR.2012.08.001zbMATH Open1349.90071OpenAlexW2056468581MaRDI QIDQ340251FDOQ340251
Authors: Dan Black, Sanne Wøhlk, Richard Eglese 
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/12454130/BLACK_2013_The_Time_Dependent_Prize_Collecting_Arc_Routing_Problem.pdf
Recommendations
- A scatter search algorithm for time-dependent prize-collecting arc routing problems
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time dependent vehicle routing problem with a multi ant colony system
- Time-dependent routing
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cited In (15)
- A time-dependent hierarchical Chinese postman problem
- The directed profitable rural postman problem with incompatibility constraints
- New results for the directed profitable rural postman problem
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- Solving the selective multi-category parallel-servicing problem
- Multi-vehicle prize collecting arc routing for connectivity problem
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- A branch-and-cut algorithm for the profitable windy rural postman problem
- The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints
- A scatter search algorithm for time-dependent prize-collecting arc routing problems
- Arc routing problems with time-dependent service costs
- Time-dependent routing problems: a review
- Freight railway operator timetabling and engine scheduling
- Arc routing for parking enforcement officers: exact and heuristic solutions
This page was built for publication: The time-dependent prize-collecting arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340251)
