A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints

DOI10.1023/A:1009808327381zbMath0985.90038MaRDI QIDQ1591428

Paul Shaw, Patrick Prosser, Philip Kilby

Publication date: 5 July 2001

Published in: Constraints (Search for Journal in Brave)

zbMATH Keywords

vehicle routing problemside constraintsconstruction and improvement techniques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A case study of mutual routing-scheduling reformulation ⋮ Model and algorithm for inventory/routing decision in a three-echelon logistics system ⋮ A general vehicle routing problem ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Vehicle routing problem with elementary shortest path based column generation ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Vehicle routing problem with time windows and a limited number of vehicles. ⋮ The vehicle routing problem with time windows and temporal dependencies ⋮ New Notation and Classification Scheme for Vehicle Routing Problems

Uses Software

• SALSA

This page was built for publication: A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints