Ejection chains, reference structures and alternating path methods for traveling salesman problems
From MaRDI portal
Publication:1917273
DOI10.1016/0166-218X(94)00037-EzbMath0846.90117MaRDI QIDQ1917273
Publication date: 3 October 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Paths and cycles (05C38)
Related Items
Repairing high school timetables with polymorphic ejection chains, Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration, Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem, Classification of applied methods of combinatorial optimization, On service consistency in multi-period vehicle routing, Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, An ejection chain approach for the quadratic multiple knapsack problem, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Stochastic local search with learning automaton for the swap-body vehicle routing problem, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Routing problems: A bibliography, Heuristics for the mirrored traveling tournament problem, Variable neighborhood search for the dial-a-ride problem, A variable depth neighborhood search algorithm for the min-max arc crossing problem, Using tabu search for solving a dynamic multi-terminal truck dispatching problem, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Dual-neighborhood iterated local search for routing and wavelength assignment, VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, General variable neighborhood search for the order batching and sequencing problem, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Constraint-based very large-scale neighborhood search, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, A filter-and-fan approach to the 2D HP model of the protein folding problem, Knowledge-guided local search for the vehicle routing problem, Employee workload balancing by graph partitioning, Timetable construction: the algorithms and complexity perspective, What makes a VRP solution good? The generation of problem-specific knowledge for heuristics, Valuated matroid-based algorithm for submodular welfare problem, Efficiently solving very large-scale routing problems, An improved simulated annealing algorithm for bandwidth minimization, A survey on the applications of variable neighborhood search algorithm in healthcare management, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, The balanced academic curriculum problem revisited, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, A survey of very large-scale neighborhood search techniques, Sequential search and its application to vehicle-routing problems, A simple filter-and-fan approach to the facility location problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, An ejection chain algorithm for the quadratic assignment problem, Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, A hybrid heuristic for the maximum dispersion problem, A comparative analysis of two matheuristics by means of merged local optima networks, An iterated local search algorithm for the vehicle routing problem with backhauls, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP, Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas, A path relinking approach with ejection chains for the generalized assignment problem, A note on single alternating cycle neighborhoods for the TSP, Fast local search algorithms for the handicapped persons transportation problem, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Domination analysis of some heuristics for the traveling salesman problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Metaheuristics in combinatorial optimization, Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
Uses Software
Cites Work
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- On the use of augmenting chains in chain packings
- Parallel concepts in graph theory
- A parallel tabu search algorithm for large traveling salesman problems
- Tabu search for the multilevel generalized assignment problem
- A user's guide to tabu search
- Matroid Intersection
- Maximum matching and a polyhedron with 0,1-vertices
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
