A hybrid reactive GRASP heuristic for the risk-averse k-traveling repairman problem with profits

DOI10.1016/J.COR.2019.104854MaRDI QIDQ2289922zbMATH OpenOpenAlexFDO

Authors Sara Khodaparasti, Maria Elena Bruni, Patrizia Beraldi

Publication date 27 January 2020

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

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

zbMATH Keywords

adaptive neighbourhood searchGRASPmean-risk modeltraveling repairman problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The risk-averse traveling repairman problem with profits
• The cumulative capacitated vehicle routing problem with profits under uncertainty
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Hybrid evolutionary search for the traveling repairman problem with profits

Cites work

• A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
• A new formulation for the traveling deliveryman problem
• A scatter search for multi-depot vehicle routing problem with weight-related cost
• A simple and effective metaheuristic for the minimum latency problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• Customer lead time management when both demand and price are lead time sensitive.
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Heuristics for the traveling repairman problem with profits
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 5846596 (Why is no real title available?)
• scientific article; zbMATH DE number 6297719 (Why is no real title available?)
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• The \(k\)-traveling repairmen problem
• The A priori traveling repairman problem
• The cumulative capacitated vehicle routing problem with profits under uncertainty
• The Delivery Man Problem and Cumulative Matroids
• The minimum latency problem
• The mixed capacitated general routing problem under uncertainty
• The risk-averse traveling repairman problem with profits
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• The traveling salesman problem with cumulative costs
• Time-dependent routing problems: a review
• Time‐dependent traveling salesman problem–the deliveryman case
• Variable neighborhood search for the travelling deliveryman problem
• Vehicle routing with stochastic time-dependent travel times

Cited in

(12)

• Joint optimization of container slot planning and truck scheduling for tandem quay cranes
• A metaheuristic for the delivery man problem with time windows
• The multi-depot \(k\)-traveling repairman problem
• New formulations and solution approaches for the latency location routing problem
• A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
• The cumulative capacitated vehicle routing problem with profits under uncertainty
• The risk-averse traveling repairman problem with profits
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
• An online optimization approach for post-disaster relief distribution with online blocked edges
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Layered graph models for the electric vehicle routing problem with nonlinear charging functions
• A risk-averse latency location-routing problem with stochastic travel times

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289922)