Variable neighborhood tabu search and its application to the median cycle problem.
From MaRDI portal
Publication:1410620
DOI10.1016/S0377-2217(02)00831-7zbMath1053.90056OpenAlexW2059825934WikidataQ62609365 ScholiaQ62609365MaRDI QIDQ1410620
José A. Moreno Pérez, José Marcos Moreno-Vega, Inmaculada Rodríguez-Martín
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00831-7
Related Items
On the integrated charge planning with flexible jobs in primary steelmaking processes, Dynamic job shop scheduling using variable neighbourhood search, MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem, Variable neighborhood search for the pharmacy duty scheduling problem, A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations, Metaheuristics and cooperative approaches for the bi-objective ring star problem, General network design: a unified view of combined location and network design problems, Variable neighbourhood structures for cycle location problems, Product line pricing for services with capacity constraints and dynamic substitution, Comparing different metaheuristic approaches for the median path problem with bounded length, An exact algorithm for solving the ring star problem, Multiple depot ring star problem: a polyhedral study and an exact algorithm, Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem, A branch-and-price algorithm for a vehicle routing with demand allocation problem, Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study, An improved LNS algorithm for real-time vehicle routing problem with time windows, A location-routing problem in glass recycling, Variable neighbourhood search: methods and applications, Pharmacy duty scheduling problem, Algorithms for the metric ring star problem with fixed edge-cost ratio, Variable neighbourhood search: Methods and applications, A parallel variable neighborhood search for solving covering salesman problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, A covering traveling salesman problem with profit in the last mile delivery, The Ring Star Problem: Polyhedral analysis and exact algorithm, Spatial coverage in routing and path planning problems, An efficient evolutionary algorithm for the ring star problem, Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
