A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
type: Item
instance of: scholarly article
title: A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
zbMATH Open document ID: 1390.90061
author: Serap Ercan Cömert
author: Harun Reşit Yazgan
author: İrem Sertvuran
author: Hanife Şengül
published in: Sādhanā
publication date: 2018-06-11T00:00:00Z
full work available at URL: https://www.ias.ac.in/describe/article/sadh/042/12/2067-2080
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6882717
zbMATH Keywords: vehicle routing problem with hard time windows
zbMATH Keywords: \(K\)-means clustering algorithm
zbMATH Keywords: \(K\)-medoids clustering algorithm
zbMATH Keywords: DBSCAN clustering algorithm
zbMATH Keywords: cluster first route second approach
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2769834283
cites work: The truck dispatching problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: Data mining. Concepts and techniques
cites work: Q4532227
cites work: The vehicle routing problem
cites work: A vehicle routing problem with flexible time windows
cites work: Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
cites work: An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
cites work: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
cites work: A parallel algorithm for the vehicle routing problem with time window constraints
cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
cites work: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
cites work: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
cites work: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
cites work: A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows
cites work: Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
cites work: Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows
cites work: Q5617409
DOI: 10.1007/S12046-017-0754-1
description: scientific article; zbMATH DE number 6882717