A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain

DOI10.1007/S12046-017-0754-1MaRDI QIDQ1637720zbMATH OpenOpenAlexFDO

Authors Serap Ercan Cömert, Harun Reşit Yazgan, İrem Sertvuran, Hanife Şengül

Publication date 11 June 2018

Published in Sādhanā (Search for Journal in Brave)

Full work available at URL https://www.ias.ac.in/describe/article/sadh/042/12/2067-2080

zbMATH Keywords

\(K\)-means clustering algorithm\(K\)-medoids clustering algorithmcluster first route second approachDBSCAN clustering algorithmvehicle routing problem with hard time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Two-phase algorithm for solving vehicle routing problem with time windows
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• scientific article; zbMATH DE number 1264444
• Exact algorithms for the vehicle routing problem with soft time windows

Cites work

• scientific article; zbMATH DE number 1749224 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
• A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows
• A parallel algorithm for the vehicle routing problem with time window constraints
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• A vehicle routing problem with flexible time windows
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
• Data mining. Concepts and techniques
• Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• The truck dispatching problem
• The vehicle routing problem

Cited in

(2)

• Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain

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