Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

DOI10.1016/S0167-8191(00)00102-2MaRDI QIDQ5940908zbMATH OpenOpenAlexFDO

Authors C. Rego

Publication date 20 August 2001

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00102-2

zbMATH Keywords

tabu search algorithmvehicle routing problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1054962
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• A parallel algorithm for the vehicle routing problem with time window constraints
• A parallel algorithm for the vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem

Cited in

(27)

• Use of the BATA algorithm and MIS to solve the mail carrier problem
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
• Knowledge-guided local search for the vehicle routing problem
• Solving the vehicle routing problem with adaptive memory programming methodology
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A multi-start local search algorithm for the vehicle routing problem with time windows
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• A simple filter-and-fan approach to the facility location problem
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• A subpath ejection method for the vehicle routing problem
• An ejection chain algorithm for the quadratic assignment problem
• Chain partitioning as a key element for building vehicle routing problem heuristics
• Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
• scientific article; zbMATH DE number 1054962 (Why is no real title available?)
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• scientific article; zbMATH DE number 6311376 (Why is no real title available?)
• AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
• Feature-guided metaheuristic with diversity management for solving the capacitated vehicle routing problem
• Metaheuristics in combinatorial optimization
• A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
• A filter-and-fan approach to the job shop scheduling problem

This page was built for publication: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940908)