A bi-criteria heuristic for the vehicle routing problem with time windows

DOI10.1016/0377-2217(88)90428-6MaRDI QIDQ1102175zbMATH OpenOpenAlexFDO

Authors H. R. G. Van Landeghem

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

zbMATH Keywords

heuristicsheuristictime windowsvehicle routingroad transportationClarke and Wright Savings method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A heuristic for the vehicle routing problem with time windows
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Tabu search heuristics for the vehicle routing problem with time windows.
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints

Cites work

• A Dual Heuristic for Vehicle Scheduling
• A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
• A bi-criteria heuristic for the vehicle routing problem with time windows
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Integer Programming Approach to the Vehicle Scheduling Problem
• State-space relaxation procedures for the computation of bounds to routing problems
• The Vehicle Scheduling Problem and Monte Carlo Simulation

Cited in

(20)

• On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
• Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
• Self-imposed time windows in vehicle routing problems
• The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
• COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
• A multi-shift vehicle routing problem with windows and cycle times
• Vehicles scheduling with sliding time windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A bi-criteria heuristic for the vehicle routing problem with time windows
• The improved saving methods of vehicle routing problems with time window
• Routing problems: A bibliography
• A soft time-windowed mechanism for vendor selection model
• A heuristic for the vehicle routing problem with time windows
• A dial-a-ride problem for client transportation in a health-care organization
• Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
• A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times
• Applied Statistical Indicators to the Vehicle Routing Problem with Time Windows for Discriminate Appropriately the Best Algorithm
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• Routing relatively few customers per route
• A parametric analysis of heuristics for the vehicle routing problem with side-constraints

This page was built for publication: A bi-criteria heuristic for the vehicle routing problem with time windows

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