The simulated trading heuristic for solving vehicle routing problems

DOI10.1016/0166-218X(95)00027-OzbMath0848.90054OpenAlexW1990067406MaRDI QIDQ1917260

Winfried Hochstättler, M. Malich, Achim Bachem

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00027-o

zbMATH Keywords

vehicle routingparallelizationimprovement heuristic

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Parallel numerical computation (65Y05)

Related Items

A decision support system for a real vehicle routing problem., Tree partitioning under constraints. -- Clustering for vehicle routing problems, Pricing strategies for the site-dependent vehicle routing problem, Tabu search heuristics for the vehicle routing problem with time windows.

Uses Software

• PVM
• VRP

Cites Work

• An efficient implementation of local search algorithms for constrained routing problems
• The vehicle routing problem: An overview of exact and approximate algorithms
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Tabu Search—Part I
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Parallel iterative search methods for vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A GRASP for the Vehicle Routing Problem with Time Windows
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item