Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
type: Item
instance of: scholarly article
title: Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
zbMATH Open document ID: 1458.90157
author: Zhenzhen Zhang
author: Brenda Cheang
author: Chongshou Li
author: Andrew Lim
published in: Computers \& Operations Research
publication date: 2018-12-17T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6994267
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: simultaneous pickup and delivery
zbMATH Keywords: multi-commodities
zbMATH Keywords: fast fashion
zbMATH Keywords: adaptive memory programming
MaRDI profile type: Publication
full work available at URL: j.cor.2018.10.020
OpenAlex ID: W2899488903
cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
cites work: Balancing the stations of a self service “bike hire” system
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: A reactive variable neighborhood search for the vehicle-routing problem with time windows
cites work: Bike sharing systems: solving the static rebalancing problem
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Variable neighborhood search: Principles and applications
cites work: A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
cites work: The multi-commodity pickup-and-delivery traveling salesman problem
cites work: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
cites work: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
cites work: A hybrid algorithm for a class of vehicle routing problems
cites work: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: A unified solution framework for multi-attribute vehicle routing problems
cites work: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
cites work: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
DOI: 10.1016/J.COR.2018.10.020
description: scientific article; zbMATH DE number 6994267