The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
From MaRDI portal
Publication:6609709
DOI10.1111/ITOR.13407MaRDI QIDQ6609709
Jesús Sánchez-Oro, A. D. López-Sánchez, R. Morante-González, Alfredo G. Hernández-Díaz
Publication date: 24 September 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
traveling salesman problemprofitvariable neighborhood descentmulti-objective optimization problemgreedy randomized adaptive search proceduretraveling repairman problem
Cites Work
- Heuristics for the traveling repairman problem with profits
- The selective travelling salesman problem
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Variable neighborhood search: basics and variants
- Greedy randomized adaptive search procedures
- A simple and effective metaheuristic for the minimum latency problem
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Complexity and approximation for traveling salesman problems with profits
- Multiobjective GRASP with path relinking
- New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A multiobjective GRASP–VND algorithm to solve the waste collection problem
- Time‐dependent traveling salesman problem–the deliveryman case
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- Variable neighborhood search: Principles and applications
- Variable neighborhood search approach with intensified shake for monitor placement
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)
