Product-oriented time window assignment for a multi-compartment vehicle routing problem
type: Item
instance of: scholarly article
title: Product-oriented time window assignment for a multi-compartment vehicle routing problem
zbMATH Open document ID: 1430.90110
author: Sara Martins
author: Manuel Ostermeier
author: Pedro Amorim
author: Alexander Hübner
author: Bernardo Almada-Lobo
published in: European Journal of Operational Research
publication date: 2019-03-27T00:00:00Z
full work available at URL: urn:nbn:de:bvb:384-opus4-923265
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7043171
zbMATH Keywords: grocery retailing
zbMATH Keywords: multi-compartment
zbMATH Keywords: vehicle routing
zbMATH Keywords: consistency
zbMATH Keywords: adaptive large neighborhood search
MaRDI profile type: Publication
OpenAlex ID: W2914374758
cites work: Solving a fuel delivery problem by heuristic and exact approaches.
cites work: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
cites work: Scheduling deliveries in vehicles with multiple compartments
cites work: Classification, models and exact algorithms for multi-compartment delivery problems
cites work: A heuristic for the multi-period petrol station replenishment problem
cites work: Vehicle routing with compartments: applications, modelling and heuristics
cites work: A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
cites work: The multi-compartment vehicle routing problem with flexible compartment sizes
cites work: Delivery pattern and transportation planning in grocery retailing
cites work: Self-imposed time windows in vehicle routing problems
cites work: Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
cites work: A template-based adaptive large neighborhood search for the consistent vehicle routing problem
cites work: The multi-objective generalized consistent vehicle routing problem
cites work: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
cites work: Vehicle selection for a multi-compartment vehicle routing problem
cites work: A general heuristic for vehicle routing problems
cites work: The discrete time window assignment vehicle routing problem
cites work: A branch-and-cut framework for the consistent traveling salesman problem
cites work: Data-driven assignment of delivery patterns with handling effort considerations in retail
Wikidata QID: Q128455485
DOI: 10.1016/J.EJOR.2019.01.053
description: scientific article; zbMATH DE number 7043171