scientific article; zbMATH DE number 1054962
From MaRDI portal
Publication:4350082
zbMATH Open0877.90034MaRDI QIDQ4350082FDOQ4350082
Authors: César Rego, Catherine Roucairol 
Publication date: 28 August 1997
Title of this publication is not available (Why is that?)
Recommendations
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A tabu search algorithm for the vehicle routing problem
- A parallel algorithm for the vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
Learning and adaptive systems in artificial intelligence (68T05) Parallel numerical computation (65Y05) Transportation, logistics and supply chain management (90B06)
Cited In (26)
- Algorithms for path optimizations: a short survey
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Iterated local search with ejection chains for the space-free multi-row facility layout problem
- Dual-neighborhood iterated local search for routing and wavelength assignment
- Constructing efficient simulated annealing algorithms
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A survey of very large-scale neighborhood search techniques
- Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
- Path relinking for the vehicle routing problem
- A subpath ejection method for the vehicle routing problem
- A genetic algorithm for the vehicle routing problem
- Relaxed tours and path ejections for the traveling salesman problem
- An ejection chain approach for the quadratic multiple knapsack problem
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Metaheuristics in combinatorial optimization
- A heuristic algorithm for the truckload and less-than-truckload problem
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- A neural-tabu search heuristic for the real time vehicle routing problem
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- Metaheuristics: A bibliography
- An integer linear programming local search for capacitated vehicle routing problems
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350082)
