The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario

DOI10.1111/ITOR.13407MaRDI QIDQ6609709zbMATH OpenFDO

Authors R. Morante-González, A. D. López-Sánchez, Jesús Sánchez-Oro, Alfredo G. Hernández-Díaz

Publication date 24 September 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13407

zbMATH Keywords

greedy randomized adaptive search proceduremulti-objective optimization problemprofittraveling repairman problemtraveling salesman problemvariable neighborhood descent

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• A multiobjective GRASP-VND algorithm to solve the waste collection problem
• A simple and effective metaheuristic for the minimum latency problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Complexity and approximation for traveling salesman problems with profits
• Greedy randomized adaptive search procedures
• Heuristics for the traveling repairman problem with profits
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• Multiobjective GRASP with path relinking
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
• The selective travelling salesman problem
• Time‐dependent traveling salesman problem–the deliveryman case
• Variable neighborhood search approach with intensified shake for monitor placement
• Variable neighborhood search: basics and variants
• Variable neighborhood search: Principles and applications

This page was built for publication: The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario

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