Approximative solutions to the bicriterion vehicle routing problem with time windows
From MaRDI portal
Publication:1038402
DOI10.1016/j.ejor.2009.04.029zbMath1173.90517OpenAlexW2085922519MaRDI QIDQ1038402
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.04.029
Related Items
Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency, Dynamic vehicle routing using an improved variable neighborhood search algorithm, A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows, A bi-objective approach for scheduling ground-handling vehicles in airports, Scheduling just-in-time transport vehicles to feed parts for mixed model assembly lines, Two-echelon collaborative routing problem with heterogeneous crowd-shippers, Objectives and methods in multi-objective routing problems: a survey and classification scheme
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear multiobjective optimization
- An improved ant system algorithm for the vehicle routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The Truck Dispatching Problem
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle Routing with Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
