Green split multiple-commodity pickup and delivery vehicle routing problem

DOI10.1016/j.cor.2023.106318OpenAlexW4381194404MaRDI QIDQ6047862

Hongxia Dong, Jiao Zhao, Ning Wang

Publication date: 13 September 2023

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

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

zbMATH Keywords

heuristic algorithmvehicle routing problemreallocationtraffic congestionsplit multiple-commodity demand

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Quantum-behaved particle swarm optimization with collaborative attractors for nonlinear numerical problems
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study
• The multi-commodity pickup-and-delivery traveling salesman problem
• Savings by Split Delivery Routing

This page was built for publication: Green split multiple-commodity pickup and delivery vehicle routing problem