The time-dependent prize-collecting arc routing problem
From MaRDI portal
Publication:340251
DOI10.1016/j.cor.2012.08.001zbMath1349.90071OpenAlexW2056468581MaRDI QIDQ340251
Dan Black, Sanne Wøhlk, Richard W. 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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
New results for the directed profitable rural postman problem ⋮ Freight railway operator timetabling and engine scheduling ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Multi-vehicle prize collecting arc routing for connectivity problem ⋮ Time-dependent routing problems: a review ⋮ 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: A review of the past, present, and future ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ A time-dependent hierarchical Chinese postman problem ⋮ Arc routing for parking enforcement officers: exact and heuristic solutions ⋮ Solving the selective multi-category parallel-servicing problem
This page was built for publication: The time-dependent prize-collecting arc routing problem
