A scatter search algorithm for time-dependent prize-collecting arc routing problems

DOI10.1016/j.cor.2021.105392OpenAlexW3169435679MaRDI QIDQ2669496

M. A. Hakim Newton, Vahid Riahi, Abdul Sattar

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105392

zbMATH Keywords

heuristicsscatter searchtime-dependentarc routing problemssingle vehicle

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• The time-dependent prize-collecting arc routing problem
• Lower bounds and heuristics for the windy rural postman problem
• The undirected capacitated arc routing problem with profits
• Solving the prize-collecting rural postman problem
• Multi-vehicle prize collecting arc routing for connectivity problem
• The undirected capacitated general routing problem with profits
• Vehicle dispatching with time-dependent travel times
• Privatized rural postman problems
• A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Vehicle routing and scheduling with time-varying data: A case study

This page was built for publication: A scatter search algorithm for time-dependent prize-collecting arc routing problems