scientific article; zbMATH DE number 1054962
From MaRDI portal
Publication:4350082
zbMath0877.90034MaRDI QIDQ4350082
Catherine Roucairol, César Rego
Publication date: 28 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Parallel numerical computation (65Y05)
Related Items (21)
Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration ⋮ Multi-ant colony system (MACS) for a vehicle routing problem with backhauls ⋮ An ejection chain approach for the quadratic multiple knapsack problem ⋮ A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ An adaptive memory heuristic for a class of vehicle routing problems with minmax objective ⋮ Constructing efficient simulated annealing algorithms ⋮ Metaheuristics: A bibliography ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. ⋮ Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics ⋮ A neural-tabu search heuristic for the real time vehicle routing problem ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem ⋮ A survey of very large-scale neighborhood search techniques ⋮ Path relinking for the vehicle routing problem ⋮ Creating very large scale neighborhoods out of smaller ones by compounding moves ⋮ A heuristic algorithm for the truckload and less-than-truckload problem ⋮ Relaxed tours and path ejections for the traveling salesman problem ⋮ A genetic algorithm for the vehicle routing problem ⋮ Metaheuristics in combinatorial optimization
This page was built for publication:
