A bi-criteria heuristic for the vehicle routing problem with time windows
From MaRDI portal
Publication:1102175
DOI10.1016/0377-2217(88)90428-6zbMath0643.90035OpenAlexW2051828520MaRDI QIDQ1102175
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90428-6
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
A bi-criteria heuristic for the vehicle routing problem with time windows ⋮ Routing problems: A bibliography ⋮ A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times ⋮ A dial-a-ride problem for client transportation in a health-care organization ⋮ COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM ⋮ A two-phase hybrid metaheuristic for the vehicle routing problem with time windows ⋮ A soft time-windowed mechanism for vendor selection model ⋮ A parametric analysis of heuristics for the vehicle routing problem with side-constraints
Cites Work
- A bi-criteria heuristic for the vehicle routing problem with time windows
- State-space relaxation procedures for the computation of bounds to routing problems
- A Dual Heuristic for Vehicle Scheduling
- A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
- An Integer Programming Approach to the Vehicle Scheduling Problem
- The Vehicle Scheduling Problem and Monte Carlo Simulation
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A bi-criteria heuristic for the vehicle routing problem with time windows