Approximative solutions to the bicriterion vehicle routing problem with time windows
type: Item
instance of: scholarly article
title: Approximative solutions to the bicriterion vehicle routing problem with time windows
zbMATH Open document ID: 1173.90517
author: Juliane Müller
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5634756
zbMATH Keywords: logistics
zbMATH Keywords: heuristics
zbMATH Keywords: bicriterion optimization
zbMATH Keywords: vehicle routing with soft time windows
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.04.029
OpenAlex ID: W2085922519
cites work: An improved ant system algorithm for the vehicle routing problem
cites work: Q4451071
cites work: The truck dispatching problem
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4079017
cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: Vehicle Routing with Time Windows
cites work: Nonlinear multiobjective optimization
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: The granular tabu search and its application to the vehicle-routing problem
DOI: 10.1016/J.EJOR.2009.04.029
description: scientific article; zbMATH DE number 5634756