Use of the BATA algorithm and MIS to solve the mail carrier problem

DOI10.1016/S0307-904X(01)00047-6zbMath1116.90414MaRDI QIDQ1614192

R. Smith

Publication date: 3 September 2002

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimizationManagement information systemsMeta-heuristic algorithmsVehicle routing modelling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The savings algorithm for the vehicle routing problem
• Heuristic procedures for the capacitated vehicle routing problem
• Current modeling practices in bank courier scheduling
• Extensions to the generalised assignment heuristic for vehicle routing
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Integer Programming Formulation of Traveling Salesman Problems
• A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
• Parallel iterative search methods for vehicle routing problems
• A Repeated Matching Heuristic for the Vehicle Routeing Problem
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Extensions of the Petal Method for Vehicle Routeing
• A Method for Solving Traveling-Salesman Problems
• Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

This page was built for publication: Use of the BATA algorithm and MIS to solve the mail carrier problem