Green split multiple-commodity pickup and delivery vehicle routing problem
Authors:
- Jiao ZhaoJZJiao Zhao
- Hongxia DongHDHongxia Dong
- Ning WangNWNing Wang
- 19 June 2023
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 159
Abstract
No abstract availableKeywords
Funding Information
- Yulin Science and Technology Bureau (CXY-2020-025)
- National Natural Science Foundation of China (71971030)
This publication has 30 references indexed in Scilit:
- The green vehicle routing problem: A heuristic based exact solution approachApplied Soft Computing, 2016
- Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loadsTransportation Research Part E: Logistics and Transportation Review, 2014
- The multi‐commodity pickup‐and‐delivery traveling salesman problemNetworks, 2013
- An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package ShippingTransportation Science, 2013
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveriesComputers & Operations Research, 2012
- Pickup and Delivery with Split LoadsTransportation Science, 2008
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Lean or agile: A solution for supply chain management in the textiles and clothing industry?International Journal of Operations & Production Management, 2004
- The split delivery vehicle scheduling problem with time windows and grid network distancesComputers & Operations Research, 1995
- Savings by Split Delivery RoutingTransportation Science, 1989