Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer

DOI10.1016/j.cor.2018.10.020zbMath1458.90157OpenAlexW2899488903MaRDI QIDQ1634057

Chongshou Li, Brenda Cheang, Zhenzhen Zhang, Andrew E. B. Lim

Publication date: 17 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.020

zbMATH Keywords

vehicle routing problemsimultaneous pickup and deliveryadaptive memory programmingfast fashionmulti-commodities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

A review of vehicle routing with simultaneous pickup and delivery ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ Green split multiple-commodity pickup and delivery vehicle routing problem ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ Unnamed Item ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery

Cites Work

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• A hybrid algorithm for a class of vehicle routing problems
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• Probabilistic diversification and intensification in local search for vehicle routing
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• Bike sharing systems: solving the static rebalancing problem
• A unified solution framework for multi-attribute vehicle routing problems
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multi-commodity pickup-and-delivery traveling salesman problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Balancing the stations of a self service “bike hire” system
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• Variable neighborhood search: Principles and applications

This page was built for publication: Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer