Hybrid evolutionary search for the traveling repairman problem with profits

DOI10.1016/J.INS.2019.05.075MaRDI QIDQ2224863zbMATH OpenOpenAlexWikidataFDO

Authors Yongliang Lu, Jin-Kao Hao, Qinghua Wu

Publication date 4 February 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.05.075

zbMATH Keywords

heuristicshybrid evolutionary searchtraveling repairman problemvariable neighborhood search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
• Heuristics for the traveling repairman problem with profits
• Heuristics for the traveling repairman problem with profits
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• The risk-averse traveling repairman problem with profits

Cites work

• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• A simple and effective metaheuristic for the minimum latency problem
• Advanced scatter search for the max-cut problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective PSO-inspired algorithm for the team orienteering problem
• An improved approximation ratio for the minimum latency problem
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• 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 5829047 (Why is no real title available?)
• Polynomial time algorithms for some minimum latency problems
• Profit-based latency problems on the line
• Solving the Orienteering Problem through Branch-and-Cut
• The \(k\)-traveling repairmen problem
• The maximum collection problem with time-dependent rewards
• The minimum latency problem
• The orienteering problem with variable profits
• The orienteering problem: a survey
• The risk-averse traveling repairman problem with profits
• Variable neighborhood search
• Variable neighborhood search for location routing
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• Variable neighborhood search: basics and variants

Cited in

(10)

• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
• Heuristics for the traveling repairman problem with profits
• Heuristics for the traveling repairman problem with profits
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
• A hybrid genetic algorithm for the Hamiltonian p‐median problem

Describes a project that uses

Uses Software

• CBMix
• SPOT
• irace

This page was built for publication: Hybrid evolutionary search for the traveling repairman problem with profits

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