The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
From MaRDI portal
Publication:2327442
DOI10.1007/s40314-019-0976-4zbMath1438.90398OpenAlexW2979312587MaRDI QIDQ2327442
Tiago Tiburcio da Silva, Antônio Augusto Chaves, Henrique Pacca Loureiro Luna, Horacio Hideki Yanasse
Publication date: 14 October 2019
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-019-0976-4
Related Items
Uses Software
Cites Work
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- Variable neighbourhood search: methods and applications
- Simulated annealing: Practice versus theory
- Solving the traveling salesman problem with interdiction and fortification
- Future paths for integer programming and links to artificial intelligence
- Assignment Problems and the Location of Economic Activities
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The prize collecting traveling salesman problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Optimal control of plotting and drilling machines: A case study
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem
- A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
